Time complexity of loop-free two-way pushdown automata

DOI10.1016/0020-0190(83)90063-7zbMath0511.68053OpenAlexW2044199853MaRDI QIDQ1838833

Wojciech Rytter

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90063-7

zbMATH Keywords

simulationtime complexityalgorithm for the fast recognition of languages recognized by two-way nondeterministic pushdown automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective simulation of deterministic pushdown automata with many two- way and one-way heads
• A note on two-way nondeterministic pushdown automata
• General context-free recognition in less than cubic time
• Improving programs by the introduction of recursion
• Time and tape complexity of pushdown automaton languages

This page was built for publication: Time complexity of loop-free two-way pushdown automata