Abstract
When synthesizing a Σ-automaton specified in the language LP, the problem arises of representing the set of left-infinite words given by a formula F(t) in the form of a –ω-regular expression. Construction of this expression is based on the correspondence between structural elements of formulas and –ω-regular expressions. To ensure this correspondence, two additional operations that correspond to the quantification operations in formulas are introduced over –ω-regular sets. Methods of representation of these operations in terms of the language of –ω-regular expressions are considered. The results obtained allow to construct –ω-regular expressions for a rather wide class of LP formulas of the form F(t).
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.
