Posted inFeatured Programming & Data Structures
Posted inTheory of Computation
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…
Posted inTheory of Computation
Context-Free Languages and Parse Trees
Example: CFG for {0 n1 n | n ≥ 1} CFG Formalism Productions Example: Formal…
Posted inTheory of Computation
Classification of Context Free Grammars
Context Free Grammars (CFG) can be classified on the basis of following two properties: 1) Based on…
Posted inTheory of Computation
Language Generated by a Grammar
The set of all strings that can be derived from a grammar is said to…
Posted inTheory of Computation
Introduction to Grammars
n the literary sense of the term, grammars denote syntactical rules for conversation in natural…
Posted inTheory of Computation
Closure properties of Regular languages
Closure properties on regular languages are defined as certain operations on regular language which are guaranteed to produce…
Posted inTheory of Computation
Proving Languages not to be Regular
The pumping lemma for regular languages
Posted inTheory of Computation
Designing Finite Automata from Regular Expression (Set 1)
In this article, we will see some popular regular expressions and how we can convert…
Posted inTheory of Computation
Regular Sets
Any set that represents the value of the Regular Expression is called a Regular Set. Properties…
Posted inTheory of Computation
Moore and Mealy Machines
Finite automata may have outputs corresponding to each transition. There are two types of finite…