Finiteness of the set of automaton Post bases with solvable completeness problem
From MaRDI portal
Recommendations
- 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 the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
- On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
- scientific article; zbMATH DE number 468641
Cited in
(10)- 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
- Dualizability of automatic algebras.
- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
- scientific article; zbMATH DE number 5005932 (Why is no real title available?)
- On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
- Computability by finite automata and pisot bases
- On the completeness of systems of finite automata
- The completeness criterion for some systems containing \(P\)-sets of automaton functions
- scientific article; zbMATH DE number 3219607 (Why is no real title available?)
This page was built for publication: Finiteness of the set of automaton Post bases with solvable completeness problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522760)
