On the Krohn-Rhodes cascaded decomposition theorem

Authors:
Oded Maler
Affiliations:
CNRS-VERIMAG, Gières, France
Venue:
Time for verification
Year:
2010

Citing 8
Cited 0

A Note on Star-Free Events

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Varieties Of Formal Languages

Varieties Of Formal Languages
The Glory of the Past

Proceedings of the Conference on Logic of Programs
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
Tight bounds on the complexity of cascaded decomposition of automata

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Krohn-Rhodes theorem states that any deterministic automaton is a homomorphic image of a cascade of very simple automata which realize either resets or permutations. Moreover, if the automaton is counter-free, only reset automata are needed. In this paper we give a very constructive proof of a variant of this theorem due to Eilenberg.