A Note on Star-Free Events

Authors:
Albert R. Meyer
Affiliations:
Carnegie-Mellon University, Department of Computer Science, Pittsburgh, Pennsylvania
Venue:
Journal of the ACM (JACM)
Year:
1969

Citing 1
Cited 7

Generalized Cascade Decompositions of Automata

Journal of the ACM (JACM)

A note on independence of a regularity-preserving operator

ACM SIGACT News
Dot-depth of star-free events

Journal of Computer and System Sciences
Classification of noncounting events

Journal of Computer and System Sciences
On the Krohn-Rhodes cascaded decomposition theorem

Time for verification
Theme and variations on the concatenation product

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Classifying regular languages via cascade products of automata

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
The Krohn-Rhodes Theorem and Local Divisors

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that a short proof of the equivalence of star-free and group-free regular events is possible if one is willing to appeal to the Krohn-Rhodes machine decomposition theorem.