On decidability of the completeness problem for special systems of automaton functions

DOI10.1515/dma.1996.6.5.491zbMath0870.03014OpenAlexW2094857677MaRDI QIDQ3125966

Dmitriĭ Nikolaevich Babin

Publication date: 23 March 1997

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

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

zbMATH Keywords

completeness problemalgorithmic decidabilityautomaton functionsPost class\(A\)-completeness problem

Mathematics Subject Classification ID

Related Items (1)

The completeness problem in the function algebra of linear integer-coefficient polynomials

This page was built for publication: On decidability of the completeness problem for special systems of automaton functions