Abstract
A regular expression with n occurrences of symbol can be converted into an equivalent automaton with ( n + 1 ) states, the so-called Glushkov automaton of the expression. Conversely, it is possible to decide whether a given ( n + 1 ) -state automaton is a Glushkov one and, if so, to convert it back to an equivalent regular expression of width n . Our goal is to extend the class of automata for which such a linear retranslation is possible. We define new regular operators, called multi-tilde-bars, allowing us to simultaneously apply a multi-tilde operator and a multi-bar one to a list of expressions. The main results are that a multi-tilde-bar expression of width n can be converted into an ( n + 1 ) -state position-like automaton and that any acyclic n -state automaton can be turned into an extended expression of width O ( n ) .
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.
