Pages that link to "Item:Q3569021"
From MaRDI portal
The following pages link to Strong optimal lower bounds for Turing machines that accept nonregular languages (Q3569021):
Displaying 9 items.
- Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
- Space hierarchy theorem revised. (Q1401238) (← links)
- A variant of inductive counting (Q1566745) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- A Space Lower Bound for Acceptance by One-Way Π<sub>2</sub>-Alternating Machines (Q2720409) (← links)
- New Results on the Minimum Amount of Useful Space (Q2814840) (← links)
- Factoring and Testing Primes in Small Space (Q3599080) (← links)
- Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)
- Preface (Q5898759) (← links)
