Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
From MaRDI portal
Publication:5526129
DOI10.2307/1994127zbMath0148.01002WikidataQ56334825 ScholiaQ56334825MaRDI QIDQ5526129
Publication date: 1965
Full work available at URL: https://doi.org/10.2307/1994127
Related Items
Unnamed Item, The geometry of profinite graphs with applications to free groups and finite monoids, Krohn-Rhodes complexity pseudovarieties are not finitely based, Feedback, trace and fixed-point semantics, The automata theory of semigroup embeddings, Yet another proof of the cascade decomposition theorem for finite automata, Auxiliary functions and constructive specification of general systems, Complexity of ideals in finite semigroups and finite-state machines, Remarks on algebraic decomposition of automata, Decomposition of linear sequential machines, The fundamental lemma of complexity for arbitrary finite semigroups, Decomposition of linear sequential machines. II, On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\), Semidirect products of monoids, Categories as algebra: An essential ingredient in the theory of monoids, A decomposition theorem for probabilistic transition systems, \(NC^ 1\): The automata-theoretic viewpoint, The kernel of monoid morphisms, Automaton semigroups, On the Cantor-Dedekind property of the Tilson order on categories and graphs, Monoides pointes, The complexity of social groups and social systems described by graph structures, The analysis of semigroups of multirelational systems, The metalogic of economic predictions, calculations and propositions, Decomposition theorems for finite sequential machines, Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups, The semigroup of an algebra automaton, A characterization of automata and a direct product decomposition, The group-theoretic complexity of subsemigroups of Boolean matrices, Semidirect products of pseudovarieties from the universal algebraist's point of view, Induced permutation automata and coverings of strongly connected automata, Monoids respecting \(n\)-chains of intervals, On calculating the Krohn-Rhodes decomposition of automata, Generalized algebraic structures for the representation of discrete systems, Genetic nets and dissipative structures: an algebraic approach, Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata., On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties., From cascade decompositions to bit-vector algorithms., A proof of the Krohn--Rhodes Decomposition Theorem, On complete systems of automata, On a decomposition of fuzzy automata, On the transformation semigroups of finite automata, Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras, Algebraic representations for finite-state machines. I. Monoid-ring formulation, On dynamic bit-probe complexity, The spectra of lamplighter groups and Cayley machines., On the state space theory of linear systems, On some properties of the free monoids with applications to automata theory, Some results on finite semigroups, Frequency of decomposability among machines with a large number of states, On the cohomology of finite semigroups, Algebraic principles for the analysis of the biochemical system, Linear positive machines, Algebraic structures in linear systems theory, Methods of the algebraic theory of machines. I: Decomposition theorem for generalized machines; properties preserved under series and parallel compositions of machines, Congruences et automorphismes des automates finis, Dot-depth of star-free events, Decomposition and complexity of finite semigroups, A survey of some recent results in linear multivariable feedback theory, Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups, Locally testable languages, Improved lower bounds for the complexity of finite semigroups, A structure theory of automata characterized by groups, Finite state automata: A geometric approach, Surjections and coverings, Décompositions en cascades des systèmes automatiques et feuilletages invariants, Automata in categories. The decomposition problem
Cites Work
