Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
From MaRDI portal
Publication:5526129
DOI10.2307/1994127zbMath0148.01002OpenAlexW4235600519WikidataQ56334825 ScholiaQ56334825MaRDI QIDQ5526129
Publication date: 1965
Full work available at URL: https://doi.org/10.2307/1994127
Related Items
The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case, Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words, The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies, On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\), Semidirect products of monoids, Yet another proof of the cascade decomposition theorem for finite automata, Auxiliary functions and constructive specification of general systems, Feedback, trace and fixed-point semantics, Complexity of ideals in finite semigroups and finite-state machines, Remarks on algebraic decomposition of automata, On dynamic bit-probe complexity, Décompositions en cascades des systèmes automatiques et feuilletages invariants, Decomposition of linear sequential machines, On the Cantor-Dedekind property of the Tilson order on categories and graphs, Pointlike sets for varieties determined by groups, The fundamental lemma of complexity for arbitrary finite semigroups, Stratified petri nets, Monoids respecting \(n\)-chains of intervals, Decomposition of linear sequential machines. II, Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras, On calculating the Krohn-Rhodes decomposition of automata, A separation theorem for discrete-time interval temporal logic, Algebraic representations for finite-state machines. I. Monoid-ring formulation, Surjections and coverings, Generalized algebraic structures for the representation of discrete systems, Monoides pointes, Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview, Testing membership: Beyond permutation groups, Unnamed Item, Decompositions of semigroups, Genetic nets and dissipative structures: an algebraic approach, Double Categories of Open Dynamical Systems (Extended Abstract), Decomposition and factorization of chemical reaction transducers, Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata., The kernel of monoid morphisms, On κ-reducibility of pseudovarieties of the form V ∗D, On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties., Equational properties of fixed-point operations in cartesian categories: An overview, The complexity of social groups and social systems described by graph structures, The analysis of semigroups of multirelational systems, From cascade decompositions to bit-vector algorithms., Finite state automata: A geometric approach, The metalogic of economic predictions, calculations and propositions, An effective lower bound for group complexity of finite semigroups and automata, Philosophy of Computation, BIOMICS: a Theory of Interaction Computing, On the computational power of programs over \(\mathsf{BA}_2\) monoid, A decomposition theorem for probabilistic transition systems, Theory of reaction automata: a survey, \(NC^ 1\): The automata-theoretic viewpoint, The quiver of an algebra associated to the Mantaci-Reutenauer descent algebra and the homology of regular semigroups., A local structure theorem for stable, \(\mathcal{J}\)-simple semigroup biacts, On the Krohn-Rhodes Cascaded Decomposition Theorem, Decomposition theorems for finite sequential machines, On a decomposition of fuzzy automata, Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups, On the lattice of sub-pseudovarieties of DA., The semigroup of an algebra automaton, Star-free languages are Church-Rosser congruential, A characterization of automata and a direct product decomposition, Krohn-Rhodes complexity pseudovarieties are not finitely based, Unnamed Item, Unnamed Item, The spectra of lamplighter groups and Cayley machines., Categories as algebra: An essential ingredient in the theory of monoids, Infinitude of Primes Using Formal Languages, Unnamed Item, Pro-aperiodic monoids via saturated models, The Power of Diversity, The geometry of profinite graphs with applications to free groups and finite monoids, Prime languages, Abelian Networks I. Foundations and Examples, The group-theoretic complexity of subsemigroups of Boolean matrices, Cascade connections and triangular products of linear automata, On the state space theory of linear systems, On some properties of the free monoids with applications to automata theory, Semidirect products of pseudovarieties from the universal algebraist's point of view, 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, Automaton semigroups, Locally testable languages, Induced permutation automata and coverings of strongly connected automata, Varieties, Improved lower bounds for the complexity of finite semigroups, A structure theory of automata characterized by groups, A proof of the Krohn--Rhodes Decomposition Theorem, On complete systems of automata, On the transformation semigroups of finite automata, The Power of Programs over Monoids in DA, Down closed injectivity and essentialness, Automata in categories. The decomposition problem, Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes, Self-automaton semigroups., The automata theory of semigroup embeddings, The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)
Cites Work
