Results 11  20
of
207
Indexing Trees by Pushdown Automata for Nonlinear Tree Pattern Matching
"... Abstract—A new kind of an acyclic pushdown automaton for an ordered tree is presented.The nonlinear tree pattern pushdown automaton represents a complete index of the tree for nonlinear tree patterns and accepts all nonlinear tree patterns which match the tree. Given a tree with n nodes, the number ..."
Abstract
 Add to MetaCart
Abstract—A new kind of an acyclic pushdown automaton for an ordered tree is presented.The nonlinear tree pattern pushdown automaton represents a complete index of the tree for nonlinear tree patterns and accepts all nonlinear tree patterns which match the tree. Given a tree with n nodes, the number
Regularity Problems for Visibly Pushdown
 STACS 2006
, 2006
"... Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automaton tha ..."
Abstract
 Add to MetaCart
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automaton
Pushdown games with unboundedness and regular conditions
 In FSTTCS 2003: Proceedings of the 23rd International Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science
"... Abstract. We consider infinitary twoplayer perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning conditions are Boolean combinations of a Büchi condition and a new condition that we call unboundedness. An infinite play ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
Abstract. We consider infinitary twoplayer perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning conditions are Boolean combinations of a Büchi condition and a new condition that we call unboundedness. An infinite play
Quantitative analysis of probabilistic pushdown automata: . . .
, 2005
"... Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic programs with rcursive procedure calls. Previous works considered the decidability and complexity of the modelchecking problem for pPDA and various probabilistic temporal logics. In this paper we concen ..."
Abstract

Cited by 41 (14 self)
 Add to MetaCart
concentrate on computing the expected values and variances of various random variables defined over runs of a given probabilistic pushdown automaton. In particular, we show how to compute the expected accumulated reward and the expected gain for certain classes of reward functions. Using these results, we
Detecting Useless Transitions in Pushdown Automata
"... 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 ..."
Abstract
 Add to MetaCart
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
Regularity problems for visibly pushdown languages
 STACS 2006
, 2006
"... Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automat ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i
Regularity and related problems for deterministic pushdown automata
 Journal of the ACM
, 1975
"... ABSTRACT. It ~S shown that to decide whether the language accepted by an arbitrary deterministic pushdown automaton is LL (k), or whether ~t m accepted by some onecounter or finiteturn pushdown machine, must be at least as difficult as to decide whether it is regular. The regularity problem itself ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
ABSTRACT. It ~S shown that to decide whether the language accepted by an arbitrary deterministic pushdown automaton is LL (k), or whether ~t m accepted by some onecounter or finiteturn pushdown machine, must be at least as difficult as to decide whether it is regular. The regularity problem
THEORY OF COMPUTING www.theoryofcomputing.org Symmetry Coincides with Nondeterminism for TimeBounded Auxiliary Pushdown Automata∗
, 2013
"... Abstract: We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time. 1 ..."
Abstract
 Add to MetaCart
Abstract: We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time. 1
On Bisimilarity of HigherOrder Pushdown Automata: Undecidability at Order Two
"... We show that bisimulation equivalence of ordertwo pushdown automata is undecidable. Moreover, we study the lower order problem of higherorder pushdown automata, which asks, given an orderk pushdown automaton and some k ′ < k, to determine if there exists a reachable configuration that is bisim ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We show that bisimulation equivalence of ordertwo pushdown automata is undecidable. Moreover, we study the lower order problem of higherorder pushdown automata, which asks, given an orderk pushdown automaton and some k ′ < k, to determine if there exists a reachable configuration
Regularity Problems for Visibly Pushdown Languages
"... Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automat ..."
Abstract
 Add to MetaCart
Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i
Results 11  20
of
207