Keyword

pushdown automata

Description: Pushdown automata are computational models with finite control and a stack, used to recognize context-free languages in formal language theory.

Primary topic: semigroups and automata theory (72%)

Wikidata ID: wiki/Q751443

OpenAlex ID: keywords/pushdown-automata

Introduction to automata theory, languages and computation

1981 · Mathematics and Computers in Simulation · 10,700

Introduction to automata theory, languages, and computation

1980 · Computer Languages · 6,824

Formal Languages and Their Relation to Automata

1969 · John E. Hopcroft, Jeffrey D. Ullman · CERN Document Server (European Organization for Nuclear Research) · 1,360

The mathematical theory of context free languages

1966 · Seymour Ginsburg · 959

The mathematical theory of context-free languages

1967 · H.P. Edmundson · Information Processing & Management · 728

Reachability analysis of pushdown automata: Application to model-checking

1997 · Ahmed Bouajjani, Javier Esparza, et al. · Lecture notes in computer science · 653

Quantum automata and quantum grammars

2000 · Cristopher Moore, James P. Crutchfield · Theoretical Computer Science · 407

PDF

MOPS

2002 · Hao Chen, David Wagner · Proceedings of the ACM Conference on Computer and Communications Security · 381

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

1971 · Stephen A. Cook · Journal of the ACM · 360

PDF

An Introduction to Formal Languages and Automata

1990 · Peter Linz · 344

The theory of ends, pushdown automata, and second-order logic

1985 · David E. Muller, Paul E. Schupp · Theoretical Computer Science · 318

Fuzzy Automata and Languages: Theory and Applications

2002 · John N. Mordeson, Davender S. Malik · Thammasat University Digital Collections · 292

Stream processing of XPath queries with predicates

2003 · Ashish Kumar Gupta, Dan Suciu · Proceedings - ACM-SIGMOD International Conference on Management of Data · 280

Theory of computation

1986 · Derick Wood · Medical Entomology and Zoology · 277

Context-Free Languages and Pushdown Automata

1997 · Jean-Michel Autebert, Jean Berstel, et al. · Springer eBooks · 250

Deterministic context free languages

1966 · Seymour Ginsburg, Sheila Greibach · Information and Control · 248

Verification on Infinite Structures

2001 · Olaf Burkart, Didier Caucal, et al. · Elsevier eBooks · 188

Pushdown Processes: Games and Model-Checking

2001 · Igor Walukiewicz · Information and Computation · 188

PDF

On context-free languages and push-down automata

1963 · M.P. Schützenberger · Information and Control · 183

Brain embodiment of syntax and grammar: Discrete combinatorial mechanisms spelt out in neuronal circuits

2010 · Friedemann Pulvermüller · Brain and Language · 182

Finite-Turn Pushdown Automata

1966 · Seymour Ginsburg, Edwin H. Spanier · SIAM Journal on Control · 173

Model checking LTL with regular valuations for pushdown systems

2003 · Javier Esparza, Antonı́n Kučera, et al. · Information and Computation · 170

PDF

On the regular structure of prefix rewriting

1992 · Didier Caucal · Theoretical Computer Science · 161

PDF

Formalizing sensitivity in static analysis for intrusion detection

2004 · Henry Hanping Feng, J.T. Giffin, et al. · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · 159

A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)

1997 · Alain Finkel, Bernard Willems, et al. · Electronic Notes in Theoretical Computer Science · 150

Works count: 1,910

Citation count: 36,320