Complexity measures for regular expressions

Authors:
Andrzej Ehrenfeucht;Paul Zeiger
Affiliations:
-;-
Venue:
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Year:
1974

Citing 0
Cited 5

Some Exact Complexity Results for Straight-Line Computations over Semirings

Journal of the ACM (JACM)
Minimal Union-Free Decompositions of Regular Languages

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Query translation from XPath to SQL in the presence of recursive DTDs

The VLDB Journal — The International Journal on Very Large Data Bases
Chrobak normal form revisited, with applications

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
The safety simple subset

HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several measures of complexity of a regular expression are defined. (Star height and number of alphabetical symbols are two of them.) Upper and lower estimates for the complexities of expressions for certain standard sets (e.g. the set of all paths on a complete graph) are derived.