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

DOI10.1007/S10958-010-9972-3MaRDI QIDQ2453381zbMATH OpenOpenAlexFDO

Authors 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

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
• On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
• On the classification of automaton bases.
• Computability by finite automata and pisot bases
• A criterion for the decidability of the A-completeness problem for definite automata
• scientific article; zbMATH DE number 2032360
• Solvability of the problem of completeness of automaton basis depending on its Boolean part
• Finiteness of the set of automaton Post bases with solvable completeness problem
• scientific article; zbMATH DE number 3898772
• On a class ofPautomata

Cites work

• scientific article; zbMATH DE number 23015 (Why is no real title available?)
• scientific article; zbMATH DE number 468641 (Why is no real title available?)
• scientific article; zbMATH DE number 3273206 (Why is no real title available?)
• On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems

Cited in

(8)

• On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
• Solvability of the problem of completeness of automaton basis depending on its Boolean part
• On decidability of the completeness problem for special systems of automaton functions
• On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
• scientific article; zbMATH DE number 17027 (Why is no real title available?)
• Finiteness of the set of automaton Post bases with solvable completeness problem
• On Slupecki classes for automaton functions
• Undecidability of the completeness and A-completeness problems for some systems of automaton functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453381)