Bibliography

1

Jean Berstel.
Transductions and Context-Free Languages.
Teubner Studienbücher, Stuttgart, 1979.

2

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

3

Ch. Choffrut.
Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationelles.
Theoretical Computer Science, 5:325-338, 1977.

4

M. Fröhlich and M. Werner.
The graph visualization system davinci - A user interface for applications.
Technical Report 5/94, Department of Computer Science; University of Bremen, 1994.

5

John E. Hopcroft.
An n log n algorithm for minimizing the states in a finite automaton.
In Z. Kohavi, editor, The Theory of Machines and Computations, pages 189-196. Academic Press, 1971.

6

John E. Hopcroft and Jeffrey D. Ullman.
Introduction to Automata Theory, Languages and Computation.
Addison Wesley, 1979.

7

Ronald M. Kaplan and Martin Kay.
Regular models of phonological rule systems.
Computational Linguistics, 20(3):331-378, 1994.

8

Bernard Lang.
A generative view of ill-formed input processing.
In ATR Symposium on Basic Research for Telephone Interpretation (ASTI), Kyoto Japan, 1989.

9

Martin Oerder and Hermann Ney.
Word graphs: An efficient interface between continuous-speech recognition and language understanding.
In ICASSP Volume 2, pages 119-122, 1993.

10

John K. Ousterhout.
Tcl and the Tk Toolkit.
Addison Wesley, 1994.

11

Fernando C. N. Pereira and Michael D. Riley.
Speech recognition by composition of weighted finite automata, 1996.
cmp-lg/9603001.

12

Emmanuel Roche and Yves Schabes.
Deterministic part-of-speech tagging with finite-state transducers.
Computational Linguistics, 21(2), 1995.

13

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

14

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

15

Atro Voutilainen and Pasi Tapanainen.
Ambiguity resolution in a reductionist parser.
In Sixth Conference of the European Chapter of the Association for Computational Linguistics, Utrecht, 1993.

16

Bruce W. Watson.
Taxonomies and Toolkits of Regular Language Algorithms.
PhD thesis, Eindhoven University of Technology, 1995.