On the star height of regular events

Authors:
Rina Cohen;J. A. Brzozowski
Affiliations:
-;-
Venue:
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Year:
1967

Citing 0
Cited 4

Information science: The loop complexity of regular events

Information Sciences: an International Journal
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents some results concerning the star height of regular events. First we consider the behavior of star height under various operations on regular events and it is proved that star height is preserved under the derivative operation. The relation of star height of a regular event to the cycle rank of the reduced state graph of the corresponding finite automaton is studied. This investigation leads to sufficient conditions for the star height to be equal to the rank of the state graph. For example, this is true for events defined by permutation automata with a single output state. Families of regular events of arbitrary star height are exhibited. Finally, some open questions posed by Eggan regarding star height and rank are answered.