Some modifications of auxiliary pushdown automata
From MaRDI portal
Recommendations
Cites work
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Classes of languages and linear-bounded automata
- scientific article; zbMATH DE number 3936518 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3471606 (Why is no real title available?)
- scientific article; zbMATH DE number 3530982 (Why is no real title available?)
- scientific article; zbMATH DE number 3560742 (Why is no real title available?)
- Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata
- Nondeterministic Space is Closed under Complementation
- On the Tape Complexity of Deterministic Context-Free Languages
- The complexity of theorem-proving procedures
- The method of forced enumeration for nondeterministic automata
Cited in
(3)
This page was built for publication: Some modifications of auxiliary pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485868)