On complete systems of automata

DOI10.1016/S0304-3975(99)00274-1zbMath0946.68071OpenAlexW2037167632MaRDI QIDQ1575734

Pál Dömösi, Chrystopher L. Nehaniv

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00274-1

zbMATH Keywords

finite automataprimitive product

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

From relation to emulation: The covering lemma for transformation semigroups, ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK, On \(\alpha _{2} - \nu _{2}\)-products of automata

Cites Work

• On \(\alpha{}_ 0-\nu{}_ 1\)-products of automata
• Subsemigroups and complexity via the presentation lemma
• From relation to emulation: The covering lemma for transformation semigroups
• THE ABSTRACT THEORY OF AUTOMATA
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item