scientific article; zbMATH DE number 3917711
From MaRDI portal
Publication:3692869
Recommendations
- ${\text{ASPACE}}(o(\log \log n))$ is Regular
- New results on the minimum amount of useful space
- The Sublogarithmic Alternating Space World
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES
- Some observations concerning alternating Turing machines using small space
Cited in
(27)- Some observations concerning alternating Turing machines using small space
- Remarks on languages acceptable in log log n space
- Tradeoffs for language recognition on alternating machines
- A survey of space complexity
- Bridging across the (n) space frontier
- Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines
- A remark on middle space bounded alternating Turing machines
- Some notes on strong and weak log log n space complexity
- Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
- Two-way automata versus logarithmic space
- A space lower bound for acceptance by one-way _2-alternating machines
- New results on the minimum amount of useful space
- The minimum amount of useful space: new results and new directions
- Weak and strong one-way space complexity classes
- Two-Way Automata versus Logarithmic Space
- scientific article; zbMATH DE number 3868618 (Why is no real title available?)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE
- scientific article; zbMATH DE number 3984575 (Why is no real title available?)
- ${\text{ASPACE}}(o(\log \log n))$ is Regular
- Minimal Size of Counters for (Real-Time) Multicounter Automata
- Pushdown automata and constant height: decidability and bounds
- Pushdown and one-counter automata: constant and non-constant memory usage
- Passively mobile communicating machines that use restricted space
- Push complexity: optimal bounds and unary inputs
- Push complexity: optimal bounds and decidability
- Pushdown and one-counter automata: constant and non-constant memory usage
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692869)
