Skip to search formSkip to main contentSkip to account menu

Pushdown automaton

Known as: Push-Down Automaton, Nondeterministic pushdown automaton, Pushdown autonoma 
In computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown automata are used in theories about what can be… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested… 
2011
2011
In this work we establish that the language MIX = { w ∈ { a ; b ; c } ∗ || w | a = | w | b = | w | c } and the language O 2 = { w… 
2007
2007
This paper presents a control-flow-based program behavior extended model EMPDA(extended model based on push down automaton)by… 
2006
2006
According to the method of finite automation diagram description,the diagram description of normal form of pushdown automata,the… 
2005
2005
Model-based intrusion detectors restrict program executi on to a previously computed model of expected behavior. We consider two… 
1997
1997
New application areas for databases demand the possibility of managing not only the traditional atomic but also structured data… 
1994
1994
The Logic Push-Down Automaton (LPDA) is introduced as an abstract operational model for the evaluation of logic programs. The… 
Review
1993
Review
1993
Distributed Action Systems.- Lectures on: Classical Proofs as Programs.- Linear Logic: A Survey.- Some Proof-Theoretic Aspects of… 
1976
1976
Embedding is the extension of a programming language without altering the processor for that language, and preferably using only…