Pages that link to "Item:Q3125966"
From MaRDI portal
The following pages link to On decidability of the completeness problem for special systems of automaton functions (Q3125966):
Displaying 12 items.
- Completeness problem for the class of linear automata functions (Q314183) (← links)
- A criterion for the decidability of the \(A\)-completeness problem for definite automata (Q656372) (← links)
- Decidability of some problems related to the class of nondeterministic iterative \((k,m)\)-systems (Q1197580) (← links)
- On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (Q1594479) (← links)
- The completeness problem in the function algebra of linear integer-coefficient polynomials (Q2997863) (← links)
- Automatic Decidability and Combinability Revisited (Q3608782) (← links)
- SYSTEM FUNCTIONS AND THEIR DECISION PROBLEMS (Q3699682) (← links)
- (Q4236232) (← links)
- (Q4272118) (← links)
- AN ELEMENTARY SYSTEM AS AND ITS SEMI‐COMPLETENESS AND DECIDABILITY (Q4295211) (← links)
- The completeness criterion for systems which contain all one-place finite-automaton functions (Q4809508) (← links)
- The completeness criterion for some systems containing P-sets of automaton functions (Q5249793) (← links)
