Pages that link to "Item:Q4128015"

The following pages link to Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015):

Displayed 11 items.

• Deterministic two-way one-head pushdown automata are very powerful (Q800088) ‎ (← links)
• Variations on the technique of Ďuriš and Galil (Q1064791) ‎ (← links)
• Hierarchies of one-way multihead automata languages (Q1099645) ‎ (← links)
• Alternating multihead finite automata (Q1116353) ‎ (← links)
• Time complexity of languages recognized by one-way multihead pushdown automata (Q1158973) ‎ (← links)
• A hardest language recognized by two-way nondeterministic pushdown automata (Q1158974) ‎ (← links)
• Fooling a two way automaton or one pushdown store is better than one counter for two way machines (Q1165027) ‎ (← links)
• Two-way deterministic multi-weak-counter machines (Q1165028) ‎ (← links)
• One-way simple multihead finite automata (Q1258608) ‎ (← links)
• Some properties of one-pebble Turing machines with sublogarithmic space (Q2566005) ‎ (← links)
• Language recognition by two-way deterministic pushdown automata (Q2571535) ‎ (← links)