Regular expression for a language without empty word
Theoretical Computer Science
Handbook of formal languages, vol. 1
Characterization of Glushkov automata
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Information and Computation
Obtaining shorter regular expressions from finite-state automata
Theoretical Computer Science
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
Finite Automata, Digraph Connectivity, and Regular Expression Size
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A New Family of Regular Operators Fitting with the Position Automaton Computation
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Multi-tilde Operators and Their Glushkov Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Approximation to the smallest regular expression for a given regular language
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Random generation of deterministic acyclic automata using Markov chains
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Sampling different kinds of acyclic automata using Markov chains
Theoretical Computer Science
| Hi-index | 0.00 |
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 size 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 result is that any acyclic n -state automaton can be turned into an extended expression of size O (n ).