Detecting Useless Transitions in Pushdown Automata
Formal Languages and Automata Theory
2013-06-11 v1
Abstract
Pushdown automata may contain transitions that are never used in any accepting run of the automaton. We present an algorithm for detecting such useless transitions. A finite automaton that captures the possible stack content during runs of the pushdown automaton, is first constructed in a forward procedure to determine which transitions are reachable, and then employed in a backward procedure to determine which of these transitions can lead to a final stat
Keywords
Cite
@article{arxiv.1306.1947,
title = {Detecting Useless Transitions in Pushdown Automata},
author = {Wan Fokkink and Dick Grune and Brinio Hond and Peter Rutgers},
journal= {arXiv preprint arXiv:1306.1947},
year = {2013}
}