On calculating the Krohn-Rhodes decomposition of automata

DOI10.1006/aama.1997.0547zbMath0879.68074OpenAlexW2082199219MaRDI QIDQ1366274

Sunil Talwar

Publication date: 10 September 1997

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.1997.0547

zbMATH Keywords

building blocksKrohn-Rhodes prime decomposition theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

STABLE PAIRS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iteration of expansions. Unambiguous semigroups
• Arbitrary vs. regular semigroups
• Finite automata play the repeated prisoner's dilemma
• The synthesis theorem for finite regular semigroups, and its generalization
• On players with a bounded number of states
• Evolutionary stability in repeated games played by finite automata
• The complexity of economic decision rules
• Automata, repeated games and noise
• Subsemigroups and complexity via the presentation lemma
• Strong Morita equivalence and a generalisation of the Rees theorem
• Complexity of finite semigroups
• Finite Rationality and Interpersonal Complexity in Repeated Games
• The Structure of Nash Equilibrium in Repeated Games with Finite Automata
• STRONG MORITA EQUIVALENCE AND THE SYNTHESIS THEOREM
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines