A proof of the Krohn--Rhodes Decomposition Theorem

DOI10.1016/S0304-3975(99)00315-1zbMath0944.68089OpenAlexW2089606312WikidataQ56334823 ScholiaQ56334823MaRDI QIDQ1575683

Zoltán Ésik

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00315-1

zbMATH Keywords

finite automatacascade composition

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

A separation theorem for discrete-time interval temporal logic ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Group axioms for iteration

Cites Work

• Results on homomorphic realization of automata by \(\alpha_ 0\)-products
• Group axioms for iteration
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A proof of the Krohn--Rhodes Decomposition Theorem