On the Computational Completeness of Equations over Sets of Natural Numbers

DOI10.1007/978-3-540-70583-3_6zbMath1155.03309MaRDI QIDQ3520304

Artur Jeż, Alexander Okhotin

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_6

Mathematics Subject Classification ID

68Q45: Formal languages and automata

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