Category: Theory of Computation.

Normal Forms of Context-Free Grammars

Deterministic Pushdown Automata

Difference between Pushdown Automata and Finite Automata

Pushdown Automata:A Pushdown automata (PDA) is a finite state machine with an added stack storage. Additional stack is used in…

Pushdown Automata Acceptance by Final State

We have discussed Pushdown Automata (PDA) and its acceptance by empty stack article. Now, in this article, we will discuss how PDA…

Construct Pushdown Automata for given languages

Prerequisite – Pushdown Automata, Pushdown Automata Acceptance by Final StateA push down automata is similar to deterministic finite automata except that it…

Introduction of Pushdown Automata

We have already discussed finite automata. But finite automata can be used to accept only regular languages.Pushdown Automata is a finite…

Ambiguity in Context-Free Grammars

If a context free grammar G has more than one derivation tree for some string w ∈ L(G), it is called an ambiguous grammar. There exist…

Context-Free Languages and Parse Trees

Example: CFG for {0 n1 n | n ≥ 1} CFG Formalism Productions Example: Formal CFG

Classification of Context Free Grammars

Context Free Grammars (CFG) can be classified on the basis of following two properties: 1) Based on number of strings it generates.…

Language Generated by a Grammar

The set of all strings that can be derived from a grammar is said to be the language generated from…

Introduction to Grammars

n the literary sense of the term, grammars denote syntactical rules for conversation in natural languages. Linguistics have attempted to…

Closure properties of Regular languages

Closure properties on regular languages are defined as certain operations on regular language which are guaranteed to produce regular language. Closure refers to…