Pages that link to "Item:Q414916"
From MaRDI portal
The following pages link to Size complexity of rotating and sweeping automata (Q414916):
Displaying 8 items.
- Descriptional complexity of limited automata (Q1706157) (← links)
- Simple picture processing based on finite automata and regular grammars (Q1747512) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- Infinite vs. finite size-bounded randomized computations (Q2637645) (← links)
- On Hadamard Series and Rotating Q-Automata (Q5005101) (← links)
