Pages that link to "Item:Q414916"

The following pages link to Size complexity of rotating and sweeping automata (Q414916):

Displaying 14 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 the Size of Two-Way Reasonable Automata for the Liveness Problem (Q4640037) (← links)
• On Hadamard Series and Rotating Q-Automata (Q5005101) (← links)
• DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ (Q5495414) (← links)
• On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
• Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
• From Hadamard expressions to weighted rotating automata and back (Q5919578) (← links)
• From Hadamard expressions to weighted rotating automata and back (Q5920056) (← links)