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
Published inLanguage and Automata Theory and Applications pp. 421 - 434
Main Authors Grune, Dick, Fokkink, Wan, Chatzikalymnios, Evangelos, Hond, Brinio, Rutgers, Peter
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Backward Procedure
Deterministic Pushdown Automata (DPDA)
Pushdown Automata (PDA)
Unreachable Transitions
Useless Transitions
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 state. An implementation of the algorithm is shown to exhibit a favorable performance.
ISBN:9783319537320
3319537326
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-53733-7_31