Pages that link to "Item:Q2453381"
From MaRDI portal
The following pages link to On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata (Q2453381):
Displaying 6 items.
- On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (Q1594479) (← links)
- Solvability of the problem of completeness of automaton basis depending on its Boolean part (Q2319977) (← links)
- On decidability of the completeness problem for special systems of automaton functions (Q3125966) (← links)
- On existence of non-recursive bases in the class of initial Rödding automata (Q3973716) (← links)
- Finiteness of the set of automaton Post bases with solvable completeness problem (Q4522760) (← links)
- On Slupecki classes for automaton functions (Q4522781) (← links)