Finitely subsequential transducers

International Journal of Foundations of Computer Science

Volumn 14, Issue 6, 2003, Pages 983-994

  Allauzen, Cyril ^a   Mohri, Mehryar ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 9544224403     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103002126     Document Type: Conference Paper

References (21)

1. C. Allauzen and M. Mohri. Efficient Algorithms for Testing the Twins Property. Journal of Automata, Languages and Combinatorics, 8(2), 2003.
2. M.-P. Beal,O. Carton, C. Prieur, and J. Sakarovitch. Squaring transducers: An efficient procedure for deciding functionality and sequentiality. Theoretical Computer Science, 292:45-63, 2003.
3. J. Berstel. Transductions and Context-Free Languages. Teubner Studienbucher: Stuttgart, 1979.
4. T. Chan and O. H. Ibarra. On the finite-valuedness problem for sequential machines. Theoretical Computer Science, 23:95-101, 1983.
5. C. Choffrut. Une caracterisation des fonctions sequentielles et des fonctions soussequentielles en tant que relations rationnelles. Theoretical Computer Science, 5:325-338, 1977.
6. C. Choffrut. Contributions a I'etude de quelques families remarquables de fonctions rationnelles. PhD thesis, (these de doctorat d'Etat), Universite Paris 7, LITP: Paris, France, 1978.
7. K. Culik II and J. Kari. Digital Images and Formal Languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 599-616. Springer, 1997.
8. C. Frougny. Conversion between Two Multiplicatively Dependent Linear Numeration Systems. In Proceedings of Theoretical Informatics, 5th Latin American Symposium (LATIN 2002), pages 64-75, Cancun, Mexico, 2002.
9. M. Gross and D. Perrin, editors. Electronic Dictionnaries and Automata in Computational Linguistics, volume 377 of Lecture Notes in Computer Science. Springer Verlag, 1989.
10. E. M. Gurari and O. H. Ibarra. A note on finite-valued and finitely ambiguous transducers. Mathematical Systems Theory, 16(l):61-66, 1983.
11. R. M. Kaplan and M. Kay. Regular Models of Phonological Rule Systems. Computational Linguistics, 20(3):331-378, 1994.
12. L. Karttunen. The Replace Operator. In 33rd Annual Meeting of the Association for Computational Linguistics, pages 16-23. Association for Computational Linguistics, 1995. Distributed by Morgan Kaufmann Publishers, San Francisco, California.
13. M. Mohri. On some Applications of Finite-State Automata Theory to Natural Language Processing. Journal of Natural Language Engineering, 2:1-20, 1996.
14. M. Mohri. Finite-State Transducers in Language and Speech Processing. Computational Linguistics, 23(2), 1997.
15. M. Mohri. Minimization Algorithms for Sequential Transducers. Theoretical Computer Science, 234:177-201, 2000.
16. M. Mohri, F. C. N. Pereira, and M. Riley. Weighted Automata in Text and Speech Processing. In Proceedings of the 12th biennial European Conference on Artificial Intelligence (ECAI-96), Workshop on Extended finite state models of language, Budapest, Hungary, 1996. ECAI.
17. M. Mohri, F. C. N. Pereira, and M. Riley. General-Purpose Finite-State Machine Software Tools, http://www.research.att.com/sw/tools/fsm, AT&T Labs-Research, 1997.
18. M. Mohri, F. C. N. Pereira, and M. Riley. Weighted Finite-State Transducers in Speech Recognition. Computer Speech and Language, 16(l):69-88, 2002.
19. D. Perrin. Words. In M. Lothaire, editor, Combinatorics on words, Cambridge Mathematical Library. Cambridge University Press, 1997.
20. M. P. Schiitzenberger. Sur une variante des fonctions sequentielles. Theoretical Computer Science, 4(l):47-57, 1977.
21. A. Weber and ft. Klemm. Economy of Description for Single-Valued Transducers. Information and Computation, 118(2):327-340, 1995.