Pages that link to "Item:Q5582355"
From MaRDI portal
The following pages link to Some Results on Tape-Bounded Turing Machines (Q5582355):
Displaying 45 items.
- Infinite games with finite knowledge gaps (Q528188) (← links)
- A note on alternating on-line Turing machines (Q789181) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Two-way non-uniform finite automata (Q832933) (← links)
- A space-hierarchy result on two-dimensional alternating Turing machines with only universal states (Q1057650) (← links)
- The recursion-theoretic structure of complexity classes (Q1064320) (← links)
- Some observations concerning alternating Turing machines using small space (Q1097697) (← links)
- Three-dimensional alternating Turing machines with only universal states (Q1129412) (← links)
- Halting space-bounded computations (Q1134515) (← links)
- Multiple equality sets and Post machines (Q1148696) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- A survey of space complexity (Q1193412) (← links)
- A hierarchy result for 2-dimensional TM's operating in small space (Q1193691) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- Minimum-complexity pairing functions (Q1201876) (← links)
- A very hard log-space counting class (Q1208403) (← links)
- Space bounds for processing contentless inputs (Q1218269) (← links)
- Remarks on the complexity of nondeterministic counter languages (Q1228202) (← links)
- Nonexistence of program optimizers in several abstract settings (Q1231391) (← links)
- On tape bounds for single letter alphabet language processing (Q1235507) (← links)
- Techniques for separating space complexity classes (Q1235979) (← links)
- Relating refined space complexity classes (Q1235980) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← links)
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- An optimal lower bound for nonregular languages (Q1330656) (← links)
- A remark on middle space bounded alternating Turing machines (Q1350303) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- Amplification of slight probabilistic advantage at absolutely no cost in space (Q1607005) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- For completeness, sublogarithmic space is no space. (Q1853022) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Two-way automata versus logarithmic space (Q2254505) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Time- and tape-bounded Turing acceptors and AFLs (Q2542726) (← links)
- On the computational power of pushdown automata (Q2542990) (← links)
- Some properties of one-pebble Turing machines with sublogarithmic space (Q2566005) (← links)
- A space lower bound for acceptance by one-way \(\Pi_2\)-alternating machines (Q2720409) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- Two-Way Automata versus Logarithmic Space (Q3007639) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)
- Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)
- Two-Way Non-Uniform Finite Automata (Q6169962) (← links)
- Push complexity: optimal bounds and unary inputs (Q6666805) (← links)
