ویراساینس.
مقاله‌ی دسترسی آزاد

Detecting useless transitions in pushdown automata

EvangelosChatzikalymnios, WanFokkink, DickGrune, BrinioHond, PeterRutgers

چکیده

چکیده‌ای برای این سند ثبت نشده است.

اسناد مشابه

  • 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 thei

  • 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

  • On the Expressive Power of 2-Stack Visibly Pushdown Automata

    سند علمی۲۰۰۸Logical Methods in Computer ScienceBenedikt Bollig

    Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been considered recently by La

  • Infinite games recognized by 2-stack visibly pushdown automata

    سند علمی۲۰۱۵Wenjuan Li, Shohei Okisaka, Kazuyuki Tanaka

    Two-player infinite games have been extensively studied in Descriptive Set Theory in the past several decades, accompanied by a celebrated result due to Martin that all Gale-Stewart games with Borel winning conditions are determined. In this paper, we are interested in the follow

  • A Logical Characterization for Dense-Time Visibly Pushdown Automata

    سند علمی۲۰۱۶LATADevendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade

    Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (VPA) by Alur and Madhusudan and event-clock automata (ECA) by Alur, Fix and Henzinger. VPA and ECA—by

  • On Quantum Pushdown Automata

    سند علمی۱۹۶۳Marats Golovkins

    Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum