Equivalence problem for finitely ambiguous finite automata over semigroups

DOI10.1007/BF01068891zbMath0455.68036OpenAlexW1964678066MaRDI QIDQ3904054

L. P. Lisovik

Publication date: 1979

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068891

zbMATH Keywords

algorithmic solvability

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

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

Cites Work

• A variant of a recursively unsolvable problem
• Unnamed Item

This page was built for publication: Equivalence problem for finitely ambiguous finite automata over semigroups