Equivalence problem for finitely ambiguous finite automata over semigroups

DOI10.1007/BF01068891zbMath0455.68036MaRDI QIDQ3904054

L. P. Lisovik

Publication date: 1979

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

algorithmic solvability

Mathematics Subject Classification ID

03D05: Automata and formal grammars in connection with logical questions

68Q70: Algebraic theory of languages and automata

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

Related Items

Regular algebra of functionals of labeled trees, Recursive-determinate abstract automata

Cites Work

• A variant of a recursively unsolvable problem
• Unnamed Item