Abstract
We introduce the definition of language recognition with weighted automata, a generalization of the classical definition of recognition with unweighted acceptors. We show that, with our definition of recognition, weighted automata can be used to recognize a class of languages that strictly includes regular languages. The class of languages accepted depends on the weight set which has the algebraic structure of a semiring. We give a generic linear time algorithm for recognition with weighted automata and describe examples with various weight sets illustrating the recognition of several classes of context-free languages. We prove, in particular, that the class of languages equivalent to the language of palindromes can be recognized by weighted automata over the (+,ċ)-semiring, and that the class of languages equivalent to the Dyck language of first order D 1 '*can be recognized by weighted automata over the real tropical semiring. We also prove that weighted automata over the real tropical semiring can be used to recognize regular expressions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Aho, A.V., J.E. Hopcroft and J.D. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
Berstel, J. Transductions and Context-Free Languages, Teubner Studienbucher, Stuttgart, 1979.
Berstel, J. and C. Reutenauer. Rational Series and Their Languages, Springer, Berlin-New York, 1988.
Eilenberg, S. Automata, Languages and Machines, volume A-B, Academic Press, New York, 1974.
Kleene, S.C. Representation of events in nerve nets and finite automata. In Automata Studies, 1956.
Kuich, W. and A. Salomaa. Semirings, Automata, Languages. No. 5 in EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1986.
Mohri, M. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2): 1997.
Mohri, M. General algebraic frameworks and algorithms for shortest-distance problems. Technical Memorandum 981210-10TM, AT&T Labs-Research, 62 pages, 1998.
Mohri, M., 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.
Mohri, M., F.C.N. Pereira and M. Riley. The design principles of a weighted finite-state transducer library. Theoretical Computer Science, 231: 17–32, 2000. http://www.research.att.com/sw/tools/ fsm.
Rabin, M.O. Probabilistic automata. Information and Control, 6: 230–245, 1963.
Schützenberger, M.P. On the definition of a family of automata. Information and Control, 4: 1961.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cortes, C., Mohri, M. Context-Free Recognition with Weighted Automata. Grammars 3, 133–150 (2000). https://doi.org/10.1023/A:1009911903208
Issue Date:
DOI: https://doi.org/10.1023/A:1009911903208