Pages that link to "Item:Q1594479"
From MaRDI portal
The following pages link to On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (Q1594479):
Displaying 4 items.
- Solvability of the problem of completeness of automaton basis depending on its Boolean part (Q2319977) (← 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)
- (Q3365841) (← links)
