Finite automata over a direct product of free semigroups and groups and languages

DOI10.1007/BF01068188zbMath0800.68576MaRDI QIDQ4007441

A. B. Stavrovskij, P. V. Gorshkov

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

finite automata; context-free languages; direct product of free semigroups; recursively enumarable languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

20M35: Semigroups in automata theory, linguistics, etc.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item