Pages that link to "Item:Q1401239"
From MaRDI portal
The following pages link to Converting two-way nondeterministic unary automata into simpler automata. (Q1401239):
Displayed 27 items.
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Two-way automata versus logarithmic space (Q2254505) (← links)
- Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata (Q2298809) (← links)
- Two-way automata characterizations of L/poly versus NL (Q2354593) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- Two-Way Automata versus Logarithmic Space (Q3007639) (← links)
- Nondeterminism Is Essential in Small 2FAs with Few Reversals (Q3012920) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q3451094) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- Hyper-minimizing minimized deterministic finite state automata (Q3549289) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q4640037) (← links)
- SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA (Q5173291) (← 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)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
