Suggested Reading

• Formal Language Theory

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

  2. Dominique Perrin. Finite automata. In J. Van Leuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pages 1-57. Elsevier, Amsterdam, 1990.

  3. Jean Berstel. Transductions and Context-Free Languages. Teubner Studienbucher: Stuttgart, 1979.

  4. Jean Berstel and Christophe Reutenauer. Rational Series and Their Languages. Springer-Verlag: Berlin-New York, 1988.

• Finite-State Algorithms

  1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The design and analysis of computer algorithms. Addison Wesley: Reading, MA, 1974.

  2. Mehryar Mohri. On some applications of finite-state automata theory to natural language processing. Journal of Natural Language Engineering, 2:1-20, 1996.

  3. Mehryar Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23, 1996.

Speech Recognition Applications

1. Fernando C. N Pereira and Michael Riley. Speech recognition by composition of weighted finite automata. In E. Roche and Y. Schabes, editors, Finite-State Devices for Natural Langue Processing. MIT Press, Cambridge, Massachusetts. 1997.

2. Michael Riley, Fernando Pereira, and Mehryar Mohri. Transducer composition for context-dependent network expansion In Proceedings of the Eurospeech '97, Rhodes, Greece, volume to appear, 1997.

3. Mehryar Mohri and Michael Riley. Weighted determinization and minimization for large vocabulary recognition. In Proceedings of the Eurospeech '97, Rhodes, Greece, volume to appear, 1997.