Bibliography

1

Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman.
Compilers. Principles, Techniques and Tools.
Addison Wesley, 1986.

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

Cormen, Leiserson, and Rivest.
Introduction to Algorithms.
MIT Press, Cambridge Mass., 1990.

4

Edmund Grimley Evans.
Approximating context-free grammars with a finite-state calculus.
In 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, pages 452-459, Madrid, 1997.

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

J. Howard Johnson and Derick Wood.
Instruction computation in subset construction.
In Darrell Raymond, Derick Wood, and Sheng Yu, editors, Automata Implementation, pages 64-71. Springer Verlag, 1997.
Lecture Notes in Computer Science 1260.

8

Ted Leslie.
Efficient approaches to subset construction.
Master's thesis, Computer Science, University of Waterloo, 1995.

9

Mehryar Mohri.
On some applications of finite-state automata theory to natural language processing.
Natural Language Engineering, 2:61-80, 1996.
Originally appeared in 1994 as Technical Report, institut Gaspard Monge, Paris.

10

Mehryar Mohri.
Finite-state transducers in language and speech processing.
Computational Linguistics, 23(2):269-311, 1997.

11

M. J. Nederhof.
Regular approximations of CFLs: A grammatical view.
In International Workshop on Parsing Technologies, Massachusetts Institute of Technology, September 1997.

12

Fernando C. N. Pereira and Rebecca N. Wright.
Finite-state approximation of phrase-structure grammars.
In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 149-173. MIT Press, Cambridge, 1997.

13

Gertjan van Noord.
FSA Utilities: A toolbox to manipulate finite-state automata.
In Darrell Raymond, Derick Wood, and Sheng Yu, editors, Automata Implementation, pages 87-108. Springer Verlag, 1997.
Lecture Notes in Computer Science 1260.

14

Gertjan van Noord, Gosse Bouma, Rob Koeling, and Mark-Jan Nederhof.
Robust grammatical analysis for spoken dialogue systems.
Journal of Natural Language Engineering, 1998.
To appear; 48 pages.