Language acceptors with a pushdown: characterizations and complexity
From MaRDI portal
Cites work
- A machine realization of the linear context-free languages
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Complete problems for deterministic polynomial time
- Finite-Turn Pushdown Automata
- Grammatical characterizations of NPDAs and VPDAs with counters
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 2038733 (Why is no real title available?)
- scientific article; zbMATH DE number 2040920 (Why is no real title available?)
- scientific article; zbMATH DE number 3428547 (Why is no real title available?)
- scientific article; zbMATH DE number 5593330 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Multi-tape and multi-head pushdown automata
- On store languages and applications
- On tape-bounded complexity classes and multihead finite automata
- On the complexity of decision problems for some classes of machines and applications
- On The Space Complexity Of Turn Bounded Pushdown Automata
- Pushdown automata with reversal-bounded counters
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Reversal-bounded multipushdown machines
- Sequential grammars and automata with valences
- The complexity of decision problems for finite-turn multicounter machines
- Time and tape complexity of pushdown automaton languages
- Unboundedness problems for machines with reversal-bounded counters
This page was built for publication: Language acceptors with a pushdown: characterizations and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6989494)
