Complexity of ideals in finite semigroups and finite-state machines

DOI10.1007/BF01692497zbMath0174.03001OpenAlexW2086722572MaRDI QIDQ5561972

K. Krohn, R. Mateosian, John L. Rhodes

Publication date: 1967

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

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

zbMATH Keywords

languages, automata, networks

Related Items

Decomposition theorems for finite sequential machines, Decomposition and complexity of finite semigroups, Lower bounds for complexity of finite semigroups, My Top 10 Graph Theory Conjectures and Open Problems

Cites Work

• Complexity of finite semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• On the structure of semigroups
• RESULTS ON FINITE SEMIGROUPS DERIVED FROM THE ALGEBRAIC THEORY OF MACHINES
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines
• Unnamed Item
• Unnamed Item
• Unnamed Item