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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2017
051019682017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance… (More)
Is this relevant?
2008
2008
High end network security applications demand high speed operation and large rule set support. Packet classification is the core… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
2003
2003
We deal with a criterion for deterministic context-free languages that was originally formulated by Li and Vitányi [SIAM J… (More)
Is this relevant?
1997
1997
We identify and study a natural and frequently occurring sub-class of Concurrent-Read, Exclusive-Write Parallel Random Access… (More)
Is this relevant?
1986
1986
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… (More)
Is this relevant?
1978
1978
There are several interesting observations to be made concerning the tape complexity of context-free languages. An early result… (More)
Is this relevant?
1978
1978
Deterministic pushdown machines working on w-tapes are studied; the o-languages recognized by such machines are called o-DCFL’s… (More)
Is this relevant?
1977
1977
In this paper we consider how certain properties of monadic recursion schemes are related to those of cteterministic context-free… (More)
Is this relevant?
1976
1976
A deterministic context-free language L<subscrpt>0</subscrpt> is described which is log(n)-complete for the family of languages… (More)
Is this relevant?