A practical simulation result for two-way pushdown automata
From MaRDI portal
Recommendations
Cites work
- A note on linear time simulation of deterministic two-way pushdown automata
- A simulation result for two-way pushdown automata
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Fast Pattern Matching in Strings
- Fast recognition of pushdown automaton and context-free languages
- scientific article; zbMATH DE number 4101166 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- scientific article; zbMATH DE number 3403734 (Why is no real title available?)
- Maximally-polyvariant partial evaluation in polynomial time
- Parsing Techniques
- Time and tape complexity of pushdown automaton languages
Cited in
(4)
This page was built for publication: A practical simulation result for two-way pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830212)