Complexity of ideals in finite semigroups and finite-state machines

DOI10.1007/BF01692497MaRDI QIDQ5561972zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines
• Complexity of finite semigroups
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3223684 (Why is no real title available?)
• scientific article; zbMATH DE number 3248552 (Why is no real title available?)
• On the structure of semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• RESULTS ON FINITE SEMIGROUPS DERIVED FROM THE ALGEBRAIC THEORY OF MACHINES

Cited in

(4)

• 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

This page was built for publication: Complexity of ideals in finite semigroups and finite-state machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5561972)