Pages that link to "Item:Q1165027"
From MaRDI portal
The following pages link to Fooling a two way automaton or one pushdown store is better than one counter for two way machines (Q1165027):
Displaying 16 items.
- Deterministic two-way one-head pushdown automata are very powerful (Q800088) (← links)
- Variations on the technique of Ďuriš and Galil (Q1064791) (← links)
- String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- Three one-way heads cannot do string matching (Q1318467) (← links)
- String matching with simple devices (Q2380036) (← links)
- Language recognition by two-way deterministic pushdown automata (Q2571535) (← links)
- A time-space tradeoff for language recognition (Q3316594) (← links)
- GENERALIZED COUNTERS AND REVERSAL COMPLEXITY (Q3606557) (← links)
- Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines (Q3748273) (← links)
- The equivalence of pebbles and sensing heads for finite automata (Q5055952) (← links)
- NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES (Q5704375) (← links)
- On pure space vs catalytic space (Q5918608) (← links)
- On pure space vs catalytic space (Q5970816) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
