On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata

DOI10.1007/S10958-010-9972-3zbMath1288.68146OpenAlexW2083828733MaRDI QIDQ2453381

Dmitriĭ Nikolaevich Babin

Publication date: 6 June 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-010-9972-3

Mathematics Subject Classification ID

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 (1)

Solvability of the problem of completeness of automaton basis depending on its Boolean part

Cites Work

• On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata