The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata

@article{Leiss1981TheCO,
  title={The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata},
  author={Ernst L. Leiss},
  journal={J. Comput. Syst. Sci.},
  year={1981},
  volume={23},
  pages={348-354}
}
It is known that for every restricted regular expression of length n there exists a nondeterministic finite automaton with n + 1 states giving rise to the upper bound of 2” + 1 on the number of states of the corresponding reduced automaton. In this note we show that this bound can be attained for all n ) 2, i.e., the upper bound 2” + 1 is optimal. An observation is then made about the synthesis problem for nondeterministic finite automata. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

REGPACK, an Interactive Package for Regular Languages and Finite Automata, Research Report CS-77-32,

E. LEISS
1977

And J

A. V. AHO, J. E. HOPCROFT
D. ULLMAN, “The Design and Analysis of Computer Algorithms,” Addison-Wesley, Reading, Mass., • 1974
View 3 Excerpts

Automatic generation of efficient lexical processors using finite state techniques

J. PORTER W. JOHNSON, S. ACKLEY
Finite State Models for Logical Machines • 1968

Finite State Models for Logical Machines,

F. HENNIE
1968
View 1 Excerpt

MIRKIN, An algorithm for constructing a base in a language of regular expressions (in Russian), Izv. Akud

B G.
Nauk SSSR, Techn. Kibernet • 1966

Canonical regular expressions and minimal state graphs for definite events, in “Math

J. A. BRZOZOWSKI
Theory of Automata, New York, 1962,” Symposia Series 12, pp. 529-561, Polytechnic Institute of Brooklyn, Brooklyn, New York, • 1963
View 2 Excerpts

Similar Papers

Loading similar papers…