Detecting Useless Transitions in Pushdown Automata

DOI10.1007/978-3-319-53733-7_31zbMath1485.68142OpenAlexW1498955885MaRDI QIDQ5739015

Dick Grune, Brinio Hond, Evangelos Chatzikalymnios, Peter Rutgers, W. J. Fokkink

Publication date: 1 June 2017

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-319-53733-7_31

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Detecting useless transitions in pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pushdown automaton or a context-free grammar - which is more economical?
• Regular Closure of Deterministic Languages
• Linear-time suffix parsing for deterministic languages
• A Note on Deciding Controllability in Pushdown Systems
• Parsing Techniques

This page was built for publication: Detecting Useless Transitions in Pushdown Automata