Conversion of regular expressions into realtime automata

@article{Geffert2006ConversionOR,
  title={Conversion of regular expressions into realtime automata},
  author={Viliam Geffert and Lubom{\'i}ra Istonov{\'a}},
  journal={RAIRO Theor. Informatics Appl.},
  year={2006},
  volume={40},
  pages={611-629}
}
We consider conversions of regular expressions into k -realtime finite state automata, i.e. , automata in which the number of consecutive uses of e -transitions, along any computation path, is bounded by a fixed constant  k . For 2 -realtime automata, i.e. , for automata that cannot change the state, without reading an input symbol, more than two times in a row, we show that the conversion of a regular expression into such an automaton produces only O(n) states, O(n log n ) e… 
1 Citations

Figures and Tables from this paper

Descriptional Complexity of Finite State Automata
TLDR
This thesis focuses mainly on the transition complexity of one-way nondeterministic automata produced originally from regular expressions and on the state complexity of two-way finite automata equipped with an additional “pebble” movable along the input tape.

References

SHOWING 1-10 OF 10 REFERENCES
Translation of binary regular expressions into nondeterministic ε-free automata with transitions
  • V. Geffert
  • Computer Science
    J. Comput. Syst. Sci.
  • 2003
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata
We prove that every regular expression of size n can be converted into an equivalent nondeterministic ?-free finite automaton (NFA) with O(n(logn)2) transitions in time O(n2logn). The best previously
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
It is proved that every regular expression of size n can be converted into an equivalent nondeterministic finite automaton (NFA) of size O(n(log n)2) in polynomial time. The best previous conversions
A lower bound on the size of ε-free NFA corresponding to a regular expression
Review of "Algebraic and automata-theoretic properties of formal languages" by Seymour Ginsburg. North Holland, 1975.
TLDR
Theoretical computer science presents to mathematicians a rather peculiar sight: various chunks that have a good deal of internal organization, e.g. finite automata, context free languages, Krohn-Rhodes theory and a few others, but without much contact with each other.
Introduction to Automata Theory, Languages and Computation
Complexity measures for regular expressions
TLDR
Several measures of complexity of a regular expression are defined and upper and lower estimates for the complexities of expressions for certain standard sets are derived.
Parsing Theory - Volume I: Languages and Parsing