The following pages link to Dmitriĭ Nikolaevich Babin (Q785977):
Displaying 20 items.
- The classes of automata embeddable to pre-complete classes (Q785978) (← links)
- (Q1594478) (redirect page) (← links)
- On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (Q1594479) (← links)
- Superpositions of bounded-deterministic functions (Q1813796) (← links)
- Verbal subautomata and the completeness problem (Q1819935) (← links)
- Precomplete classes of automata with the superposition operation (Q2319966) (← links)
- Solvability of the problem of completeness of automaton basis depending on its Boolean part (Q2319977) (← 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)
- (Q3219115) (← links)
- On completeness of the binary boundedly determined functions with respect to superposition (Q3352966) (← links)
- (Q3698321) (← links)
- (Q3783582) (← links)
- (Q4272118) (← links)
- (Q4446202) (← links)
- Finiteness of the set of automaton Post bases with solvable completeness problem (Q4522760) (← links)
- Efficient recognition of completeness of systems of automaton functions with complete Boolean part (Q4809609) (← links)
- (Q4841113) (← links)
- Undecidability of the completeness and A-completeness problems for some systems of automaton functions (Q4857009) (← links)
- (Q5753529) (← links)
