Pages that link to "Item:Q2558752"
From MaRDI portal
The following pages link to Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata (Q2558752):
Displayed 19 items.
- Remarks on multihead pushdown automata and multihead stack automata (Q1052822) (← links)
- On efficient recognition of transductions and relations (Q1066679) (← links)
- Two-way automata with more than one storage medium (Q1083206) (← links)
- On pebble automata (Q1088408) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- Time complexity of languages recognized by one-way multihead pushdown automata (Q1158973) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Two-way nested stack automata are equivalent to two-way stack automata (Q1227452) (← links)
- Relating refined space complexity classes (Q1235980) (← links)
- Stack languages and log n space (Q1250712) (← links)
- A relation between space, return and dual return complexities (Q1259165) (← links)
- The power of two-way deterministic checking stack automata (Q1812540) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- On two-way multihead automata (Q2559145) (← links)
- (Q3657451) (← links)
- (Semi)alternating stack automata (Q3959454) (← links)
- On the complexity of finite, pushdown, and stack automata (Q4121398) (← links)
- (Q4146255) (← links)
