\begin{thebibliography}{10}

\bibitem{berstel}
Jean Berstel.
\newblock {\em Transductions and Context-Free Languages}.
\newblock Teubner Studienb{\"u}cher, Stuttgart, 1979.

\bibitem{brzozowski}
J.~A. Brzozowski.
\newblock Canonical regular expressions and minimal state graphs for definite
  events.
\newblock In {\em Mathematical theory of Automata}, pages 529--561. Polytechnic
  Press, Polytechnic Institute of Brooklyn, N.Y., 1962.
\newblock Volume 12 of MRI Symposia Series.

\bibitem{choffrut}
Ch. Choffrut.
\newblock Une caract\'erisation des fonctions s\'equentielles et des fonctions
  sous-s\'equentielles en tant que relations rationelles.
\newblock {\em Theoretical Computer Science}, 5:325--338, 1977.

\bibitem{davinci}
M.~Fr{\"o}hlich and M.~Werner.
\newblock The graph visualization system {\em davinci} - {A} user interface for
  applications.
\newblock Technical Report 5/94, Department of Computer Science; University of
  Bremen, 1994.

\bibitem{hopcroft}
John~E. Hopcroft.
\newblock An $n$ log $n$ algorithm for minimizing the states in a finite
  automaton.
\newblock In Z.~Kohavi, editor, {\em The Theory of Machines and Computations},
  pages 189--196. Academic Press, 1971.

\bibitem{hopcroft-ullman}
John~E. Hopcroft and Jeffrey~D. Ullman.
\newblock {\em Introduction to Automata Theory, Languages and Computation}.
\newblock Addison Wesley, 1979.

\bibitem{kk:94}
Ronald~M. Kaplan and Martin Kay.
\newblock Regular models of phonological rule systems.
\newblock {\em Computational Linguistics}, 20(3):331--378, 1994.

\bibitem{lang-atr}
Bernard Lang.
\newblock A generative view of ill-formed input processing.
\newblock In {\em ATR Symposium on Basic Research for Telephone Interpretation
  (ASTI)}, Kyoto Japan, 1989.

\bibitem{oerder-ney}
Martin Oerder and Hermann Ney.
\newblock Word graphs: An efficient interface between continuous-speech
  recognition and language understanding.
\newblock In {\em ICASSP Volume 2}, pages 119--122, 1993.

\bibitem{tcl-tk}
John~K. Ousterhout.
\newblock {\em Tcl and the Tk Toolkit}.
\newblock Addison Wesley, 1994.

\bibitem{pereira-fst}
Fernando C.~N. Pereira and Michael~D. Riley.
\newblock Speech recognition by composition of weighted finite automata, 1996.
\newblock cmp-lg/9603001.

\bibitem{roche-schabes}
Emmanuel Roche and Yves Schabes.
\newblock Deterministic part-of-speech tagging with finite-state transducers.
\newblock {\em Computational Linguistics}, 21(2), 1995.

\bibitem{vcg}
G.~Sander.
\newblock Graph layout through the {VCG} tool.
\newblock In R.~Tamassia and I.~G. Tollis, editors, {\em Graph Drawing, DIMACS
  International Workshop GD '94, Proceedings; Lecture Notes in Computer Science
  894}, pages 194--205. Springer Verlag, 1995.

\bibitem{acl95}
Gertjan van Noord.
\newblock The intersection of finite state automata and definite clause
  grammars.
\newblock In {\em 33th Annual Meeting of the Association for Computational
  Linguistics}, pages 159--165, MIT Cambridge Mass., 1995.
\newblock cmp-lg/9504026.

\bibitem{voutilainen}
Atro Voutilainen and Pasi Tapanainen.
\newblock Ambiguity resolution in a reductionist parser.
\newblock In {\em Sixth Conference of the European Chapter of the Association
  for Computational Linguistics}, Utrecht, 1993.

\bibitem{watson}
Bruce~W. Watson.
\newblock {\em Taxonomies and Toolkits of Regular Language Algorithms}.
\newblock PhD thesis, Eindhoven University of Technology, 1995.

\end{thebibliography}
