Abstract
A classical construction assigns to any language its (ordered) syntactic monoid. Recently the author defined the so-called syntactic semiring of a language. We show here that elements of the syntactic semiring of L can be identified with transformations of a certain modification of the minimal automaton for L.
The main issue here are the inequalities r(x 1, . . . , x m) ⊆ L and equations r(x 1, . . . , x m) = L where L is a given regular language over a finite alphabet A and r is a given regular expression over A in variables x 1, . . . , x m. We show that the search for maximal solutions can be translated into the (finite) syntactic semiring of the language L. In such a way we are able to decide the solvability and to find all maximal solutions effectively. In fact, the last questions were already solved by Conway using his factors. The first advantage of our method is the complexity and the second one is that we calculate in a transparent algebraic structure.
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
Choffrut, C. and Karhumäki, J.; On Fatou properties of rational languages, in C. Martin-Vide and V. Mitrana (eds), Where Mathematics, Computer Science, Linguistics and Biology Meet, Kluwer, Dordrecht, 2000, pages 227–235
Conway, J.H.; Regular Algebra and Finite Machines, Chapman and Hall, Ltd., 1971
Kari, L.; On insertion and deletion in formal languages, PhD thesis, University Turku, 1991
Polák, L.; A classification of rational languages by semilattice-ordered monoids, http://www.math.muni.cz/~polak
Polák, L.; Syntactic semiring of a language, Proc. Mathematical Foundations of Computer Science 2001, Springer Lecture Notes in Computer Science, Vol. 2136, 2001, pages 611–620
Salomaa, A. and Yu, S.; On the decomposition of finite languages, in Rozenberg, G. et al (eds), Developments in language theory. Poceedings of the 4th international conference, Aachen, Germany, July 6–9, 1999. World Scientific, 2000, pages 22–31
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 Language Equations. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_17
Download citation
DOI: https://doi.org/10.1007/3-540-44977-9_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40391-3
Online ISBN: 978-3-540-44977-5
eBook Packages: Springer Book Archive