Pages that link to "Item:Q5592249"
From MaRDI portal
The following pages link to Note on tape reversal complexity of languages (Q5592249):
Displaying 9 items.
- On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals (Q917283) (← links)
- A characterization of reversal-bounded multipushdown machine languages (Q1058865) (← links)
- Comparison of the power between reversal-bounded ATMs and reversal- bounded NTMs (Q1094877) (← links)
- On reversal bounded alternating Turing machines (Q1102114) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Reversal-bounded multipushdown machines (Q1219160) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Pushdown automata with counters (Q2554231) (← links)
- (Q3793732) (← links)
