Yet another proof of the cascade decomposition theorem for finite automata

DOI10.1007/BF01703821zbMath0164.32302OpenAlexW2055549480MaRDI QIDQ5549064

Paul Zeiger

Publication date: 1967

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01703821

zbMATH Keywords

languages, automata, networks

Related Items (7)

Remarks on algebraic decomposition of automata ⋮ Pointlike sets for varieties determined by groups ⋮ On the Wilson monoid of a pairwise balanced design ⋮ On the accepting state complexity of operations on permutation automata ⋮ Unnamed Item ⋮ On the Krohn-Rhodes Cascaded Decomposition Theorem ⋮ Some results on finite semigroups

Cites Work

• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Unnamed Item
• Unnamed Item

This page was built for publication: Yet another proof of the cascade decomposition theorem for finite automata