Abstract
We discuss the relationships between the minimal automaton, the universal automaton, the syntactic monoid and the syntactic semiring of a given regular language. We use certain completions and reductions of the transformation matrix of the minimal automaton to clarify those connections.
Supported by the Ministry of Education of the Czech Republic under the project MSM 143100009
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, Ltd., 1971
S. Lombardy, On the construction of reversible automata for reversible languages, ICALP, Springer Lecture Notes in Computer Science, Vol. 2380, pp. 170–182, 2002
S. Lombardy and J. Sakarovitch, On the star height of rational languages. A new presentation for two old results, Proc. 3rd Int. Col. on Words, Languages and Combinatorics, World Scientific, to appear
S. Lombardy and J. Sakarovitch, Star height of reversible languages and universal automata LATIN, Springer Lecture Notes in Computer Science, Vol. 2286, pp. 76–90, 2002
J.-E. Pin, Syntactic semigroups, Chapter 10 in Handbook of Formal Languages, G. Rozenberg and A. Salomaa eds, Springer, 1997
L. Polák, A classification of rational languages by semilattice-ordered monoids, submitted, see also http://www.math.muni.cz/~polak
L. Polák, Syntactic semiring of a language, Proc. Mathematical Foundations of Computer Science 2001, Springer Lecture Notes in Computer Science, Vol. 2136, 2001, pages 611–620
L. Polák, Syntactic Semiring and Language Equations, in Proc. of the Seventh International Conference on Implementation and Application of Automata, Tours 2002, Springer Lecture Notes in Computer Science, to appear
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Polák, L. (2003). Syntactic Semiring and Universal Automaton. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_33
Download citation
DOI: https://doi.org/10.1007/3-540-45007-6_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40434-7
Online ISBN: 978-3-540-45007-8
eBook Packages: Springer Book Archive