Finiteness of the set of automaton Post bases with solvable completeness problem

DOI10.1515/DMA.1998.8.5.475zbMath0965.03053OpenAlexW1983008898MaRDI QIDQ4522760

Dmitriĭ Nikolaevich Babin

Publication date: 4 January 2001

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

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

zbMATH Keywords

Boolean functionscompleteness problemautomaton functionsPost class\(A\)-completeness problem

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

Unnamed Item ⋮ Dualizability of automatic algebras.

This page was built for publication: Finiteness of the set of automaton Post bases with solvable completeness problem