Theory of Computation 1 min read
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…
THE ARTICLE LIBRARY
All stories.
Ideas and explainers from across SenseCentral.
Theory of Computation 1 min read
Context-Free Languages and Parse Trees
Example: CFG for {0 n1 n | n ≥ 1} CFG Formalism Productions Example: Formal CFG
Theory of Computation 2 min read
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.…
Theory of Computation 3 min read
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…
Theory of Computation 3 min read
Introduction to Grammars
n the literary sense of the term, grammars denote syntactical rules for conversation in natural languages. Linguistics have attempted to…
Theory of Computation 5 min read
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…
Theory of Computation 1 min read
Proving Languages not to be Regular
The pumping lemma for regular languages
Theory of Computation 3 min read
Designing Finite Automata from Regular Expression (Set 1)
In this article, we will see some popular regular expressions and how we can convert them to finite automata. · Even…
Theory of Computation 3 min read
Regular Sets
Any set that represents the value of the Regular Expression is called a Regular Set. Properties of Regular Sets Property 1. The…
Theory of Computation 4 min read
Moore and Mealy Machines
Finite automata may have outputs corresponding to each transition. There are two types of finite state machines that generate output…