Bibliography

1

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

2

A.W. Black.
Finite state machines from feature grammars.
In International Workshop on Parsing Technologies, pages 277-285, Pittsburgh, 1989.

3

Noam Chomsky.
Formal properties of grammars.
In R. Duncan Luce, Robert R. Bush, and Eugene Galanter, editors, Handbook of Mathematical Psychology; Volume II, pages 323-418. John Wiley, 1963.

4

Noam Chomsky.
On the notion `rule of grammar'.
In Jerry E. Fodor and Jerrold J. Katz, editors, The Structure of Language; Readings in the Philosophy of Language, pages 119-136. Prentice Hall, 1964.

5

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

6

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.

7

Dale Gerdemann and Gertjan van Noord.
Transducers from rewrite rules with backreferences.
In Ninth Conference of the European Chapter of the Association for Computational Linguistics, Bergen Norway, 1999.

8

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

9

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.

10

Mark Johnson.
Finite-state approximation of constraint-based grammars using left-corner grammar transforms.
In COLING-ACL '98. 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics. Proceedings of the Conference, Montreal, 1998.

11

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

12

George Miller and Noam Chomsky.
Finitary models of language users.
In R. Luce, R. Bush, and E. Galanter, editors, Handbook of Mathematical Psychology. Volume 2. John Wiley, 1963.

13

Mehryar Mohri, Fernando C.N. Pereira, and Michael Riley.
A rational design for a weighted finite-state transducer library.
In Automata Implementation. Second International Workshop on Implementing Automata, WIA '97. Springer Verlag, 1998.
Lecture Notes in Computer Science 1436.

14

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

15

Mark-Jan Nederhof.
Context-free parsing through regular approximation.
In Finite-state Methods in Natural Language Processing, pages 13-24, Ankara, 1998.

16

Richard A. O'Keefe.
The Craft of Prolog.
The MIT Press, Cambridge Mass., 1990.

17

Fernando C. N. Pereira and R. N. Wright.
Finite-state approximation of phrase structure grammars.
In 29th Annual Meeting of the Association for Computational Linguistics, Berkeley, 1991.

18

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.

19

C.M. Rood.
Efficient finite-state approximation of context free grammars.
In A. Kornai, editor, Extended Finite State Models of Language, Proceedings of the ECAI'96 workshop, pages 58-64, Budapest University of Economic Sciences, Hungary, 1996.

20

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.

21

Gertjan van Noord.
The treatment of epsilon moves in subset construction.
In Finite-state Methods in Natural Language Processing, Ankara, 1998.
cmp-lg/9804003.

22

Gertjan van Noord.
FSA6 reference manual, 1999.
The FSA Utilities toolbox is available free of charge under Gnu General Public License at http://www.let.rug.nl/~vannoord/Fsa/.

23

Gertjan van Noord and Dale Gerdemann.
An extendible regular expression compiler for finite-state approaches in natural language processing.
In O. Boldt, H. Juergensen, and L. Robbins, editors, Workshop on Implementing Automata; WIA99 Pre-Proceedings, Potsdam Germany, 1999.