Topic
Pushdown automaton
About: Pushdown automaton is a research topic. Over the lifetime, 1868 publications have been published within this topic receiving 35399 citations.
Papers published on a yearly basis
Papers
More filters
24 Jun 2002
TL;DR: The SPKI/SDSI-to-PDS connection provides a framework for formalizing a variety of certificate-analysis problems and has computational significance: many analysis problems can be solved efficiently using existing algorithms for model checking pushdown systems.
Abstract: SPKI/SDSI is a framework for expressing naming and authorization issues that arise in a distributed-computing environment. We establish a connection between SPKI/SDSI and a formalism known as pushdown systems (PDSs). We show that the SPKI/SDSI-to-PDS connection provides a framework for formalizing a variety of certificate-analysis problems. Moreover, the connection has computational significance: many analysis problems can be solved efficiently (i.e., in time polynomial in the size of the certificate set) using existing algorithms for model checking pushdown systems.
42 citations
TL;DR: It is shown that Valiant's partial procedure for equivalence can be made constructive and the time complexity of the algorithm is bounded by a double exponential function of the size of the input.
42 citations
TL;DR: A linear boundedTransducer is a linear bounded automaton (pushdown automaton) with outputs that maps (a) L sub 1 onto L sub 2 or (b) LSub 1 into L sub2 nontrivially.
Abstract: : A linear bounded transducer (pushdown transducer) is a linear bounded automaton (pushdown automaton) with outputs Answers to the following two problems are derived: (1) If S is a linear bounded transducer or a pushdown transducer, and L is context sensitive, context free, or regular; is S(L) some well known type of set (2) Does there exist a decision procedure to determine for arbitrary sets L sub 1 and L sub 2, both context sensitive or both context free, whether there exists a linear bounded transducer (pushdown transducer) which maps (a) L sub 1 onto L sub 2 or (b) L sub 1 into L sub 2 nontrivially (Author)
42 citations
03 Sep 2007
TL;DR: This paper shows that pushdown module checking, which is by itself harder than pushdown model checking, becomes undecidable when the environment has imperfect information, and proves that with imperfect information about the control states, but a visible pushdown store, the problem is decidable.
Abstract: The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imperfect information about the system. Recently, the perfect information case has been extended to infinite-state systems (pushdown module checking). In this paper, we extend pushdown module checking to the imperfect information setting; i.e., the environment has only a partial view of the system's control states and pushdown store content. We study the complexity of this problem with respect to the branching-time temporal logic CTL, and show that pushdown module checking, which is by itself harder than pushdown model checking, becomes undecidable when the environment has imperfect information. We also show that undecidability relies on hiding information about the pushdown store. Indeed, we prove that with imperfect information about the control states, but a visible pushdown store, the problem is decidable and its complexity is the same as that of (perfect information) pushdown module checking.
41 citations
TL;DR: Properties of normalized stochastic languages are discussed and alternative procedures for constructing the Chomsky and Greibach normal forms for normalized Stochastic context-free grammar (nscfg) are presented.
41 citations