Undecidability of the completeness and A-completeness problems for some systems of automaton functions

DOI10.1515/dma.1995.5.1.31zbMath0851.03009OpenAlexW2042385098MaRDI QIDQ4857009

Dmitriĭ Nikolaevich Babin

Publication date: 15 January 1996

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1995.5.1.31

zbMATH Keywords

completeness problemalgorithmic undecidability\(A\)-completeness problemautomaton function

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05)

Related Items (1)

Automata algebras

This page was built for publication: Undecidability of the completeness and A-completeness problems for some systems of automaton functions