On the classification of Post automaton bases according to the decidability of the completeness and A-completeness problems
From MaRDI portal
Publication:1594479
zbMATH Open0958.03026MaRDI QIDQ1594479FDOQ1594479
Authors: Dmitriĭ Nikolaevich Babin 
Publication date: 28 January 2001
Published in: Doklady Mathematics (Search for Journal in Brave)
Recommendations
- On the classification of Post automaton bases by the decidability of the \(A\)-completeness property for definite automata
- Finiteness of the set of automaton Post bases with solvable completeness problem
- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
- scientific article; zbMATH DE number 2032360
- On decidability of the completeness problem for special systems of automaton functions
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Cited In (7)
- Solvability of the problem of completeness of automaton basis depending on its Boolean part
- On the classification of Post automaton bases by the decidability of the \(A\)-completeness property for definite automata
- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
- Dualizability of automatic algebras.
- Finiteness of the set of automaton Post bases with solvable completeness problem
- A criterion for the decidability of the \(A\)-completeness problem for definite automata
- Title not available (Why is that?)
This page was built for publication: On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594479)
