Methods of the algebraic theory of machines. I: Decomposition theorem for generalized machines; properties preserved under series and parallel compositions of machines

DOI10.1016/S0022-0000(67)80007-2zbMath0207.31502OpenAlexW1994374691MaRDI QIDQ2543193

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

Publication date: 1967

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(67)80007-2

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (6)

Unnamed Item ⋮ Turing machines and bimachines ⋮ WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY ⋮ Locally testable languages ⋮ Lower bounds for complexity of finite semigroups ⋮ Down closed injectivity and essentialness

Cites Work

• Unnamed Item
• Solvability of groups of odd order
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines

This page was built for publication: Methods of the algebraic theory of machines. I: Decomposition theorem for generalized machines; properties preserved under series and parallel compositions of machines