Deterministic Context-free Languages
Deterministic Context-Free Language is a formal language that can be recognized by a deterministic pushdown automaton and is strictly contained within the class of context-free languages, distinguished by the property that no two distinct transitions exist for the same state, input symbol, and stack symbol combination.
58
Publications
2.5K
Citations
77
Authors
58
Institutions
Publications per year
2017–2026
2
Variants
DcflsDeterministic Context-free Language
58
From regular expressions to deterministic automata
Gérard Berry, Ravi Sethi · Theoretical Computer Science · 1986 · 264 citations · Full text
On the Tape Complexity of Deterministic Context-Free Languages
I. Hal Sudborough · Journal of the ACM · 1978 · 227 citations · Full text
An observation on time-storage trade off
Stephen Cook · Journal of Computer and System Sciences · 1974 · 202 citations
1–5 of 58
77
University of California, Los Angeles, United States
3 publications · 293 citations
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 77
58
University of Maryland, College Park
College Park, United States
2 h-index
3 publications
67 citations

University of Milan
Milan, Italy
2 h-index
4 publications
104 citations

Harvard University Press
Cambridge, United States
2 h-index
2 publications
261 citations

University of Debrecen
Debrecen, Hungary
2 h-index
2 publications
42 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
275 citations

York University
Toronto, Canada
2 h-index
2 publications
37 citations

Justus-Liebig-Universität Gießen
Giessen, Germany
2 h-index
6 publications
81 citations
Université Paris Cité
Paris, France
2 h-index
2 publications
58 citations
1–8 of 58
9 publications · 266 citations
9
h-index
JACM · 5 publications · 309 citations
5
h-index
4 publications · 348 citations
4
h-index
IJFCS · 3 publications · 65 citations
3
h-index
2 publications · 247 citations
2
h-index
1–5