Alternating and empty alternating auxiliary stack automata.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4061160 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 3799016 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Alternating Pushdown and Stack Automata
- Alternation
- Alternation bounded auxiliary pushdown automata
- An Analysis of a Logical Machine Using Parenthesis-Free Notation
- Bounded Query Classes
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
- Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
- Checking automata and one-way stack languages
- Empty alternation
- Nondeterministic Space is Closed under Complementation
- Nonerasing stack automata
- On the Tape Complexity of Deterministic Context-Free Languages
- One-way stack automata
- Relationships between nondeterministic and deterministic tape complexities
- Relativization of questions about log space computability
- Space-bounded hierarchies and probabilistic computations
- The complexity of facets (and some facets of complexity)
- The method of forced enumeration for nondeterministic automata
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)
