Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars
From MaRDI portal
Publication:4910483
DOI10.1007/978-3-642-37064-9_39zbMath1377.68117OpenAlexW151701081MaRDI QIDQ4910483
Katsuhiko Nakamura, Keita Imada
Publication date: 18 March 2013
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-37064-9_39
grammatical inferencepushdown automatonPDAbottom-up parsingLIGmildly context-sensitive languagestack symbol
This page was built for publication: Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars