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â€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. Weâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Rajeev Alur, P. Madhusudan
- STOC
- 2004

We propose the class of <i>visibly pushdown languages</i> as embeddings of context-free languages that is rich enough to modelâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Javier Esparza, AntonÃn Kucera, Richard Mayr
- Proceedings of the 19th Annual IEEE Symposium onâ€¦
- 2004

We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in variousâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
- FoSSaCS
- 2002

We show that the monadic second-order theory of an infinite tree recognized by a higher-order pushdown automaton of any level isâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Javier Esparza, AntonÃn Kucera, Stefan Schwoon
- TACS
- 2001

Recent works have proposed pushdown systems as a tool for analyzing programs with (recursive) procedures, and the model-checkingâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Ahmed Bouajjani, Javier Esparza, Oded Maler
- CONCUR
- 1997

We apply the symbolic analysis principle to pushdown systems We represent possibly in nite sets of con gurations of such systemsâ€¦Â (More)

Is this relevant?

1997

1997

- Guo-Zheng Sun, C. Lee Giles, Hsing-Hen Chen
- Summer School on Neural Networks
- 1997

Recurrent neural networks are dynamical network structures which have the capabilities of processing and generating temporalâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Igor Walukiewicz
- CAV
- 1996

A pushdown game is a two player perfect information infinite game on a transition graph of a pushdown automaton. A winningâ€¦Â (More)

Is this relevant?

Highly Cited

1971

Highly Cited

1971

- Stephen A. Cook
- J. ACM
- 1971

A class of machines called auxiliary pushdown machines is introduced. Several types of pushdown automata, including stackâ€¦Â (More)

Is this relevant?

1968

1968

- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
- Information and Control
- 1968

A n algorithm is presented which will determine whether any string w in Z*, of length n, is contained in a language L C Zâ€¦Â (More)

Is this relevant?