scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: The combination of coverage criteria with random testing is investigated to benefit from both approaches for evaluating the quality of the test suites, and the application of the random approach is illustrated within both structural and model‐based testing contexts.
Abstract: Developing efficient and automatic testing techniques is one of the major challenges faced by the software validation community. Recent work by A. Denise et al. shows how to draw traces uniformly at random for testing large systems modelled by finite automata. Because finite automata are strong abstractions of systems, many test cases generated following this approach may be unconcretizable, that is, they do not correspond to any concrete execution of the system under test. In this paper, this problem is tackled by extending the approach to pushdown systems that can encode either a stack data structure or the call stack. The method is based on context-free grammars and related algorithms, and relies on combinatorial techniques to guarantee the uniformity of generated traces. In addition, the combination of coverage criteria with random testing is investigated to benefit from both approaches for evaluating the quality of the test suites. The application of the random approach is illustrated within both structural and model-based testing contexts. Copyright © 2014 John Wiley & Sons, Ltd.

7 citations

Posted Content
TL;DR: In this paper, a pseudorandom generator for context-free languages is presented, which is made almost one-to-one, stretching $n$-bit seeds to $n+1$ bits.
Abstract: Pseudorandomness has played a central role in modern cryptography, finding theoretical and practical applications to various fields of computer science. A function that generates pseudorandom strings from shorter but truly random seeds is known as a pseudorandom generator. Our generators are designed to fool languages (or equivalently, Boolean-valued functions). In particular, our generator fools advised context-free languages, namely, context-free languages assisted by external information known as advice, and moreover our generator is made almost one-to-one, stretching $n$-bit seeds to $n+1$ bits. We explicitly construct such a pseudorandom generator, which is computed by a deterministic Turing machine using logarithmic space and also belongs to CFLMV(2)/n---a functional extension of the 2-conjunctive closure of CFL with the help of appropriate deterministic advice. In contrast, we show that there is no almost one-to-one pseudorandom generator against context-free languages if we demand that it should be computed by a nondeterministic pushdown automaton equipped with a write-only output tape. Our generator naturally extends known pseudorandom generators against advised regular languages. Our proof of the CFL/n-pseudorandomness of the generator is quite elementary, and in particular, one part of the proof utilizes a special feature of the behaviors of nondeterministic pushdown automata, called a swapping property, which is interesting in its own right, generalizing the swapping lemma for context-free languages.

7 citations

Proceedings ArticleDOI
11 May 1981
TL;DR: Since L is accepted by a two-way deterministic pushdown automaton, it is consequently shown that one pushdown stack is more powerful than one counter for deterministic two- way machines.
Abstract: We define a language L and show that is cannot be recognized by any two way deterministic counter machine. It is done by fooling any given such machine; i.e. showing that if it accepts L' ⊇ L, then L'-L ≠ φ. For this purpose, an argument stronger than the well known crossing sequence argument needs to be introduced. Since L is accepted by a two-way deterministic pushdown automaton, we consequently show that one pushdown stack is more powerful than one counter for deterministic two-way machines.

7 citations

Journal ArticleDOI
TL;DR: A theoretical analysis of extension of the finite automaton built on DNA introduced by the Shapiro team to an arbitrary number of states and symbols and gives arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.
Abstract: In the paper we present a theoretical analysis of extension of the finite automaton built on DNA introduced by the Shapiro team to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.

7 citations

Journal ArticleDOI
TL;DR: The direct branching algorithm of [25] is extended by providing a technique called ‘halting’ for dealing with nodes with unbounded degree in the comparison tree by allowing the algorithm to check equivalence of two deterministic pushdown automata when none of them are real-time, but in a certain condition that properly contains a case where one of them is real- time strict.

7 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
87% related
Finite-state machine
15.1K papers, 292.9K citations
86% related
Model checking
16.9K papers, 451.6K citations
84% related
Concurrency
13K papers, 347.1K citations
84% related
String (computer science)
19.4K papers, 333.2K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202314
202234
202129
202052
201947
201834