On calculating the Krohn-Rhodes decomposition of automata
type: Item
instance of: scholarly article
title: On calculating the Krohn-Rhodes decomposition of automata
zbMATH Open document ID: 0879.68074
author: Sunil Talwar
published in: Advances in Applied Mathematics
publication date: 1997-09-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1059617
zbMATH Keywords: Krohn-Rhodes prime decomposition theorem
zbMATH Keywords: building blocks
MaRDI profile type: Publication
full work available at URL: aama.1997.0547
OpenAlex ID: W2082199219
cites work: The Structure of Nash Equilibrium in Repeated Games with Finite Automata
cites work: Q5570933
cites work: Evolutionary stability in repeated games played by finite automata
cites work: Q3956774
cites work: Iteration of expansions. Unambiguous semigroups
cites work: Arbitrary vs. regular semigroups
cites work: The synthesis theorem for finite regular semigroups, and its generalization
cites work: Q4132170
cites work: The complexity of economic decision rules
cites work: Q3882586
cites work: Finite Rationality and Interpersonal Complexity in Repeated Games
cites work: Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
cites work: Complexity of finite semigroups
cites work: Automata, repeated games and noise
cites work: On players with a bounded number of states
cites work: Q3769981
cites work: Subsemigroups and complexity via the presentation lemma
cites work: Finite automata play the repeated prisoner's dilemma
cites work: Strong Morita equivalence and a generalisation of the Rees theorem
cites work: STRONG MORITA EQUIVALENCE AND THE SYNTHESIS THEOREM
cites work: Cascade synthesis of finite-state machines
DOI: 10.1006/AAMA.1997.0547
description: scientific article; zbMATH DE number 1059617