Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
In this paper, we report state-of-the-art high frequency performance of GaN-based high electron mobility transistors (HEMTs) and… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
The paper characterizes the family of homomorphisms, under which the deterministic context-free languages, the LL context-free… Expand
Is this relevant?
2003
2003
We deal with a criterion for deterministic context-free languages that was originally formulated by Li and Vitanyi [SIAM J… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Partial table of contents: Properties and Definitions of Digital ICS. Diodes. Bipolar Junction Transistors. Diode-Transistor… Expand
  • figure 10.4
  • figure 10.5
  • figure 10.7
  • figure 10.8
  • figure 10.10
Is this relevant?
1992
1992
Genetic algorithms (GAs) are a class of probabilistic optimization algorithms which utilize ideas from natural genetics. In this… Expand
Is this relevant?
1992
1992
Although considerable interest has been shown in language inference and automata induction using recurrent neural networks… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
1989
1989
  • S. Yu
  • Inf. Process. Lett.
  • 1989
  • Corpus ID: 10375023
Abstract In this paper, we introduce a new pumping lemma and a new iteration theorem for deterministic context-free languages… Expand
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Let DSPACE(L(n)) denote the family of languages recognized by deterministic L(n)-tape bounded Turmg machines The pnnopal result… Expand
Is this relevant?
1977
1977
The equivalence problem for deterministic context-free languages is shown to be decidable if and only if the strong equivalence… Expand
Is this relevant?
1974
1974
The equivalence problem for languages accepted by deterministic pushdown automata is shown to be decidable if and only if the… Expand
Is this relevant?