Deterministic context-free language

Embed this Topic
A deterministic context-free language is a formal language which is defined by a deterministic context-free grammar. The set of deterministic context-free languages is called DCFL and is identical to the set of languages accepted by a deterministic pushdown automaton. The set of deterministic context-free languages are a proper subset of the set of context-free languages that possess an unambiguous context free grammar. For example, the language ... more
Read article at Wikipedia

Facts from the Community

From the Computer Science base

Automaton recognizing:

top ↑

Similar topics in Freebase

  • Regular language

    Regular language

    In theoretical computer science, a regular language is a formal language (i.e., a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties: The collection of regular languages over an alphabet Σ is defined recursively as follows...

These people have edited this topic:

  • tristan Metaweb Staff
  • pumpkin
Edit this topic
Edit and Show details

Add or delete facts, download data in JSON or RDF formats, and explore topic metadata.

Freebase Logo
What is Freebase?

Freebase is a huge collection of facts, built by people like you. Freebase connects facts in ways other sites can't, giving you new ways to explore millions of subjects.
You can help improve it!

Freebase Attribution

Freebase data is free for use under the CC-BY license.

The original description for Deterministic context-free language was automatically generated from Wikipedia.org licensed under the GNU Free Documentation License.
[1]
Learn more about Freebase licensing and attribution