Detecting Useless Transitions in Pushdown Automata

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 pr...

Full description

Saved in:
Bibliographic Details
Main Authors Fokkink, Wan, Grune, Dick, Hond, Brinio, Rutgers, Peter
Format Journal Article
LanguageEnglish
Published 08.06.2013
Subjects
Computer Science - Formal Languages and Automata Theory
Online AccessGet full text

Cover

More Information
Summary: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
DOI:10.48550/arxiv.1306.1947