ویراساینس.
سند علمی

Comparison of Two Algorithms for Detecting Useless Transitions in Pushdown Automata

Evangelos Chatzikalymnios, Wan Fokkink

چکیده

Context-free languages can be expressed by means of pushdown automata. Pushdown automata may contain transitions that are never used in any accepting run. Such transitions do not affect the languages the automata define, but they increase their memory requirements as well as their running time and thus it is desirable to remove them. The aim of this paper is to examine the performance of two different algorithms for detecting useless transitions in pushdown automata. We propose an optimization of the second algorithm with regard to performance and allowed input. Both versions of the second algorithm were implemented and their efficiency was compared to that of an existing implementation of the first algorithm. Performance testing shows that the first algorithm is more efficient than the second one and its optimized version.

اسناد مشابه

  • Detecting Useless Transitions in Pushdown Automata

    سند علمی۲۰۱۷LATADick Grune, Wan Fokkink, Evangelos Chatzikalymnios, Brinio Hond

    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 constru

  • Detecting useless transitions in pushdown automata

    مقاله‌ی دسترسی آزاد۲۰۲۰Information and ComputationEvangelosChatzikalymnios, WanFokkink, DickGrune, BrinioHond

  • Two decidability results for deterministic pushdown automata

    مقاله‌ی دسترسی آزاد۱۹۷۹Journal of Computer and System SciencesMattiLinna

  • A Genetic Algorithm for the Induction of Nondeterministic Pushdown Automata

    سند علمی۱۹۹۵Marc M. Lankhorst

    This paper presents a genetic algorithm used to infer pushdown automata from legal and illegal examples of a language. It gives an introduction into grammatical inference, and discusses related work in grammatical inference using genetic algorithms. The paper describes the type o

  • On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two

    سند علمی۲۰۱۲FSTTCSChristopher H. Broadbent, Stefan Göller

    We show that bisimulation equivalence of order-two pushdown automata is undecidable. Moreover, we study the lower order problem of higher-order pushdown automata, which asks, given an order-k pushdown automaton and some k′ < k, to determine if there exists a reachable configurati

  • Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals

    سند علمی۲۰۱۱Theor. Comput. Sci.Andreas Malcher, Carlo Mereghetti, Beatrice Palano

    Two-way nondeterministic pushdown automata (2PDA) are classical nondeterministic pushdown automata (PDA) enhanced with two-way motion of the input head. In this paper, the subclass of 2PDA accepting bounded languages and making at most a constant number of input head turns is stu