Pages that link to "Item:Q4522760"
From MaRDI portal
The following pages link to Finiteness of the set of automaton Post bases with solvable completeness problem (Q4522760):
Displaying 9 items.
- On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (Q1594479) (← links)
- Dualizability of automatic algebras. (Q2436718) (← links)
- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata (Q2453381) (← links)
- On decidability of the completeness problem for special systems of automaton functions (Q3125966) (← links)
- (Q3365841) (← links)
- Computability by finite automata and pisot bases (Q4298373) (← links)
- On the completeness of systems of finite automata (Q4522746) (← links)
- The completeness criterion for some systems containing P-sets of automaton functions (Q5249793) (← links)
- (Q5508283) (← links)