Skip to search formSkip to main contentSkip to account menu

Deterministic context-free language

Known as: DCFL, Deterministic context free language, Deterministic context-free languages 
In formal language theory, deterministic context-free languages (DCFL) are a proper subset of context-free languages. They are the context-free… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Automata theoryCYK algorithmCanonical LR parserChomsky hierarchy

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Homomorphisms Preserving Deterministic Context-Free Languages
The paper characterizes the family of homomorphisms, under which the deterministic context-free languages, the LL context-free… 
2003
2003
Kolmogorov Complexity and Deterministic Context-Free Languages
  • Oliver Glier
  • SIAM journal on computing (Print)
  • 2003
  • Corpus ID: 207078484
We deal with a criterion for deterministic context-free languages that was originally formulated by Li and Vitanyi [SIAM J… 
1997
1997
Fabrication and characterization of an InAlAs/InGaAs/InP ring oscillator using integrated enhancement- and depletion-mode high-electron mobility transistors
The fabrication and characterization of an 11-stage ring oscillator utilizing integrated enhancement- and depletion-mode (E/D… 
1997
1997
Pushdown Automata with Bounded Nondeterminism and Bounded Ambiguity
1992
1992
Learning to construct pushdown automata for accepting deterministic context-free languages
Genetic algorithms (GAs) are a class of probabilistic optimization algorithms which utilize ideas from natural genetics. In this… 
Highly Cited
1992
Highly Cited
1992
Using Prior Knowledge in a {NNPDA} to Learn Context-Free Languages
Although considerable interest has been shown in language inference and automata induction using recurrent neural networks… 
1986
1986
Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract)
We identify and study a frequently occurring subclass of Concurrent-Read, Exclusive-Write Parallel Random Access Machines (CREW… 
Highly Cited
1982
Highly Cited
1982
TiW Silicide gate self-alignment technology for ultra-high-speed GaAs MESFET LSI/VLSI's
It has been found that TiW silicide film forms Schottky contacts on GaAs which are extremely stable even at temperatures of up to… 
Highly Cited
1980
Highly Cited
1980
Pebbling Moutain Ranges and its Application of DCFL-Recognition
Recently, S.A. Cook showed that DCFL's can be recognized in O((log n)2) space and polynomial time simultaneously. We study the… 
1974
1974
Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages
The equivalence problem for languages accepted by deterministic pushdown automata is shown to be decidable if and only if the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)