Regular expressions into finite automata
Theoretical Computer Science
Regular expression for a language without empty word
Theoretical Computer Science
Handbook of formal languages, vol. 1
Characterization of Glushkov automata
Theoretical Computer Science
Translating regular expressions into small εe-free nondeterministic finite automata
Journal of Computer and System Sciences
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
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
Small Extended Expressions for Acyclic Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Acyclic automata and small expressions using multi-tilde-bar operators
Theoretical Computer Science
Simplifying regular expressions: a quantitative perspective
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
Classical algorithms convert arbitrary automata into regular expressions that have an exponential size in the size of the automaton. There exists a well-known family of automata, obtained by the Glushkov construction (of an automaton from an expression) and named Glushkov automata, for which the conversion is linear. Our aim is to extend the family of Glushkov automata. A first step for such an extension is to define a new family of regular operators and to check that the associated extended expressions have good properties: existence of normal forms, succinctness with respect to equivalent simple expressions, and compatibility with Glushkov functions. This paper addresses this first step and investigates the case of multi-tilde operators.