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.Keywordssyntactic semiringlanguage equations
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
