Alternating and empty alternating auxiliary stack automata.
From MaRDI portal
Publication:1874397
DOI10.1016/S0304-3975(02)00326-2zbMATH Open1040.68054OpenAlexW2007370828MaRDI QIDQ1874397FDOQ1874397
Authors: Markus Holzer, Pierre McKenzie 
Publication date: 25 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00326-2
Recommendations
Cites Work
- Space-bounded hierarchies and probabilistic computations
- Relationships between nondeterministic and deterministic tape complexities
- Relativization of questions about log space computability
- Title not available (Why is that?)
- Nondeterministic Space is Closed under Complementation
- Alternation
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of facets (and some facets of complexity)
- The method of forced enumeration for nondeterministic automata
- Bounded Query Classes
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- On the Tape Complexity of Deterministic Context-Free Languages
- Alternating Pushdown and Stack Automata
- One-way stack automata
- Checking automata and one-way stack languages
- Title not available (Why is that?)
- An Analysis of a Logical Machine Using Parenthesis-Free Notation
- Nonerasing stack automata
- Alternation bounded auxiliary pushdown automata
- Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
- Empty alternation
Cited In (4)
This page was built for publication: Alternating and empty alternating auxiliary stack automata.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874397)
