On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
From MaRDI portal
Publication:3585192
Recommendations
- On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
- Finiteness of the set of automaton Post bases with solvable completeness problem
- On decidability of the completeness problem for special systems of automaton functions
- On the completeness of systems of finite automata
Cited in
(7)- 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
- On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
- Undecidability of the completeness and A-completeness problems for some systems of automaton functions
- Number of labelings of definite automata graphs
- Completeness of automaton mappings with respect to equivalence relations
- A criterion for the decidability of the \(A\)-completeness problem for definite automata
This page was built for publication: On the classification of Post automaton bases by the decidability of the \(A\)-completeness property for definite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585192)
