Cascade synthesis of finite-state machines
From MaRDI portal
Publication:5549063
DOI10.1016/S0019-9958(67)90228-8zbMath0164.32301WikidataQ56334832 ScholiaQ56334832MaRDI QIDQ5549063
Publication date: 1967
Published in: Information and Control (Search for Journal in Brave)
Related Items (16)
Complexity of ideals in finite semigroups and finite-state machines ⋮ Complete classes of automata for the \(\alpha _ 0\)-product ⋮ The fundamental lemma of complexity for arbitrary finite semigroups ⋮ On calculating the Krohn-Rhodes decomposition of automata ⋮ Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions ⋮ From cascade decompositions to bit-vector algorithms. ⋮ BIOMICS: a Theory of Interaction Computing ⋮ Varieties of automata and transformation semigroups ⋮ On the Krohn-Rhodes Cascaded Decomposition Theorem ⋮ HOLONOMY EMBEDDING OF ARBITRARY STABLE SEMIGROUPS ⋮ The group-theoretic complexity of subsemigroups of Boolean matrices ⋮ Frequency of decomposability among machines with a large number of states ⋮ Pointlike sets: the finest aperiodic cover of a finite semigroup ⋮ Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups ⋮ Lower bounds for complexity of finite semigroups ⋮ Sequential machines realized by group representations
This page was built for publication: Cascade synthesis of finite-state machines
