Theory of Computation

CFL Closure Property

Context-free languages are closed under − UnionConcatenationKleene Star operation Union Let L1 and L2 be two…

Taylor Emma

August 14, 2021

Normal Forms of Context-Free Grammars

Taylor Emma

August 14, 2021

Deterministic Pushdown Automata

Taylor Emma

August 14, 2021

Pushdown Automata Acceptance by Final State

We have discussed Pushdown Automata (PDA) and its acceptance by empty stack article. Now,…

Taylor Emma

August 14, 2021

Construct Pushdown Automata for given languages

Prerequisite – Pushdown Automata, Pushdown Automata Acceptance by Final StateA push down automata is…

Taylor Emma

August 14, 2021

Introduction of Pushdown Automata

We have already discussed finite automata. But finite automata can be used to…

Taylor Emma

August 14, 2021

Ambiguity in Context-Free Grammars

If a context free grammar G has more than one derivation tree for some…

Taylor Emma

August 14, 2021

Context-Free Languages and Parse Trees

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

Taylor Emma

August 14, 2021

Classification of Context Free Grammars

Context Free Grammars (CFG) can be classified on the basis of following two properties:…

Taylor Emma

August 14, 2021

Language Generated by a Grammar

The set of all strings that can be derived from a grammar…

Taylor Emma

August 14, 2021