Pages that link to "Item:Q2540551"
From MaRDI portal
The following pages link to The reduction of tape reversals for off-line one-tape Turing machines (Q2540551):
Displaying 12 items.
- On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals (Q917283) (← links)
- The difference between one tape and two tapes: With respect to reversal complexity (Q920983) (← 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)
- On the relationship between deterministic time and deterministic reversal (Q1209341) (← links)
- Reversal-bounded multipushdown machines (Q1219160) (← links)
- One way finite visit automata (Q1242687) (← links)
- Tape-reversal bounded Turing machine computations (Q2560051) (← links)
- (Q3793732) (← links)
- Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines (Q4630261) (← links)
