Information science: The loop complexity of regular events

Authors:
Robert Mcnaughton
Affiliations:
-
Venue:
Information Sciences: an International Journal
Year:
1969

Citing 1
Cited 7

On the star height of regular events

FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)

Finite Automata, Digraph Connectivity, and Regular Expression Size

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Succinctness of Regular Expressions with Interleaving, Intersection and Counting

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the equivalence, containment, and covering problems for the regular and context-free languages

Journal of Computer and System Sciences
Star height of certain families of regular events

Journal of Computer and System Sciences
General properties of star height of regular events

Journal of Computer and System Sciences
Succinctness of regular expressions with interleaving, intersection and counting

Theoretical Computer Science
The complexity of regular(-like) expressions

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Quantified Score

Hi-index	0.07

Visualization

Abstract

L. C. Eggan defined the ''star height'' of a regular expression in 1963. The present paper continues Eggan's investigation by showing how to reduce certain regular expressions to regular expressions representing the same set but with smaller star height, and also by showing that certain other regular expressions cannot be so reduced.