×
Ehrenfeucht, Andrzej; Zeiger, Paul

Complexity measures for regular expressions. (English) Zbl 0329.94024

J. Comput. Syst. Sci. 12, 134-146 (1976).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 Show Scanned Page
scan of Zbl 0329.94024

Cited in 37 Documents

MSC:

68Q45 Formal languages and automata
68Q25 Analysis of algorithms and problem complexity
68W99 Algorithms in computer science
Cite Review PDF
Full Text: DOI

References:

[1] Cohen, R. S., Star height of certain families of regular events, J. Comput. System Sci., 4, 281-297 (1970) · Zbl 0245.94039
[2] Hopcroft, J. E.; Ullman, J. D., (Formal Languages and Their Relation to Automata (1969), Addison-Wesley: Addison-Wesley Reading, Mass.), 39 · Zbl 0196.01701
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.