On The Space Complexity Of Turn Bounded Pushdown Automata

DOI10.1080/0020716022000005564zbMath1036.68064OpenAlexW2043456730MaRDI QIDQ4709850

Etsuro Moriya, Takemaru Tada

Publication date: 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716022000005564

zbMATH Keywords

space complexitypushdown automatonturn head reversal

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Finite turns and the regular closure of linear context-free languages ⋮ Formal grammars for turn-bounded deterministic context-free languages

Cites Work

• Unnamed Item
• Unnamed Item
• A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages

This page was built for publication: On The Space Complexity Of Turn Bounded Pushdown Automata