On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
From MaRDI portal
Publication:1594479
zbMath0958.03026MaRDI QIDQ1594479
Publication date: 28 January 2001
Published in: Doklady Mathematics (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (2)
On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata ⋮ Solvability of the problem of completeness of automaton basis depending on its Boolean part
This page was built for publication: On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
