Generic -removal and input -normalization algorithms for weighted transducers

International Journal of Foundations of Computer Science

Volumn 13, Issue 1, 2002, Pages 129-143

  Mohri, Mehryar ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

removal; finite automata; finite state transducers; rational power series; semirings; shortest paths algorithms

Indexed keywords

EID: 84892889057     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054102000996     Document Type: Conference Paper

References (12)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, Principles, Techniques and Tools. Addison Wesley: Reading, MA, 1986.
2. C. Cortes and M. Mohri. Context-Free Recognition with Weighted Automata. Grammars, 3(2-3), 2000.
3. K. Culik II and J. Kari. Digital images and formal languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, pages 599-616. Springer, 1997.
4. R. W. Floyd. Algorithm 97 (shortest path). Communications of the ACM, 18, 1968.
5. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved optimalization problems. Communications of the ACM, 34, 1987.
6. W. Kuich and A. Salomaa. Semirings, Automata, Languages. Number 5 in EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin-New York, 1986.
7. M. Mohri. Finite-State Transducers in Language and Speech Processing. Computational Linguistics, 23:2, 1997.
8. M. Mohri. General Algebraic Frameworks and Algorithms for Shortest-Distance Problems. Technical Memorandum 981210-10TM, AT&T Labs-Research, 62 pages, 1998.
9. M. Mohri, F. C. N. Pereira, and M. Riley. The design principles of a weighted finite-state transducer library. Theoretical Computer Science, 231:17-32, January 2000.
10. K. Thompson. Regular expression search algorithm. Comm. ACM, 11, 1968.
11. G. van Noord. Treatment of epsilon moves in subset construction. Computational Linguistics, 26:1, 2000.
12. S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11-12, 1962.