Pushdown Automata Decision Problems
Pushdown Automata Decision Problems is a theoretical computer science construct that refers to a class of formal decision problems concerning the determination of properties—such as emptiness, finiteness, equivalence, or inclusion—associated with pushdown automata and the context-free languages they recognize.
8
Publications
364
Citations
18
Authors
11
Institutions
Publications per year
2017–2026
0
Parents
8
Seymour Ginsburg, Edwin H. Spanier · SIAM Journal on Control · 1966 · 175 citations
New Decidability Results Concerning Two-Way Counter Machines
Óscar H. Ibarra, Tao Jiang, Nicholas Trân et al. · SIAM Journal on Computing · 1995 · 54 citations
Properties of Finite and Pushdown Transducers
Christian Choffrut, Karel Čulík · SIAM Journal on Computing · 1983 · 26 citations
Decision problems for pushdown threads
J.A. Bergstra, I. Bethke, Alban Ponse · Acta Informatica · 2007 · 24 citations · Full text
1–5 of 8
18
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 18
11
Madrid Institute for Advanced Studies
Madrid, Spain
1 h-index
1 publications
22 citations
University of Insubria
Varese, Italy
1 h-index
1 publications
24 citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
1 h-index
1 publications
26 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
1 h-index
1 publications
26 citations
Université Paris-Saclay
Gif-sur-Yvette, France
1 h-index
1 publications
13 citations
Max Planck Society
Munich, Germany
1 h-index
1 publications
22 citations
Technical University of Munich
Munich, Germany
1 h-index
1 publications
22 citations
Utrecht University
Utrecht, The Netherlands
1 h-index
1 publications
24 citations
1–8 of 11
2 publications · 80 citations
2
h-index
1 publications · 175 citations
1
h-index
Repository · 1 publications · 13 citations
1
h-index
1 publications · 24 citations
1
h-index
Repository · 1 publications · 26 citations
1
h-index
1–5