Module 1:

Introduction to Languages and Automata

Dr. A K Yadav, Assistant Professor,

Department of Computer Science & Engineering

Amity School of Engineering and Technology

Amity University Uttar Pradesh, Noida

January 7, 2022
 Learning Objectives and Outcomes
Sub-topic Learning Objective Learning Outcomes
Formal Grammars To understand the basics of Familarity with basics of
grammar and Formal Language Grammar
Chomsky Hierarchy To understand Chomsky To be familiar with type of
clssification of grammar grammar
Regular Expression To understand the concept of To become familar with regular
regular expression expression
Deterministic and To understand the idea behind To understand the basic idea of
Non-deterministic DFA and NDFA DFA and NDFA and their
Finite Automata difference.
Regular Expression To understand the concept of To become familar with usage
regular expression and relevance of regular
expressions
Two way Finite To understand the relevance To understand the logic behind
Automata of 2 way finite automata and importance of 2 way finite
automata
Finite Automata To understand the machine To get familiar with Mealy and
with output with output Moore machine.
Properties of To understand the properties To understand properties of
regular sets of regular set regular set
Pumping lemma To understand the idea and To understand the idea behind
for regular sets relevance of pumping lemma pumping lemma for regular sets
My-Hill-Nerode To understand My-Hill-Nerode To understand relevance of the
Theorem Theorem theroem
Department of CSE Module 1 January 7, 2022 2/120
 Outline

1 Introduction

2 Deterministic and Non Deterministic Finite Automata

3 Finite Automata with Output

4 Formal Grammar

5 Chomsky Hierarchy

6 Regular Expression

7 Two way finite automata

8 Pumping Lemma for Regular Sets

9 My-Hill-NeroArdede Theorem

Department of CSE Module 1 January 7, 2022 3/120

 Introduction

Theory of Computation: Introduction

Theory of Computation is the branch of Computer Science
which deals with how efficiently problems can be solved on
model of computation using an algorithm
The domain is further classified into 3 sub-domains:
Automata theory and languages
Computability theory
Complexity theory

Department of CSE Module 1 January 7, 2022 4/120

 Introduction

Preliminaries
Propositions (or Statements)

Department of CSE Module 1 January 7, 2022 5/120

 Introduction

Preliminaries
Propositions (or Statements)
Connectives (Propositional connectives or Logical connectives)

Department of CSE Module 1 January 7, 2022 5/120

 Introduction

Preliminaries
Propositions (or Statements)
Connectives (Propositional connectives or Logical connectives)
NOT (Negation)¬P
AND (Conjunction) P ∧ Q
OR (Disjunction) P ∨ Q
If.. Then... (Implication)
If and only If

Department of CSE Module 1 January 7, 2022 5/120

 Introduction

Preliminaries
Propositions (or Statements)
Connectives (Propositional connectives or Logical connectives)
NOT (Negation)¬P
AND (Conjunction) P ∧ Q
OR (Disjunction) P ∨ Q
If.. Then... (Implication)
If and only If
Tautology- A tautology or a universally true formula is a well
defined formula whose truth value is T for all possible
assignments of truth values to the propositional variables.

Department of CSE Module 1 January 7, 2022 5/120

 Introduction

Preliminaries
Propositions (or Statements)
Connectives (Propositional connectives or Logical connectives)
NOT (Negation)¬P
AND (Conjunction) P ∧ Q
OR (Disjunction) P ∨ Q
If.. Then... (Implication)
If and only If
Tautology- A tautology or a universally true formula is a well
defined formula whose truth value is T for all possible
assignments of truth values to the propositional variables.
Example-P ∨ ¬P

Department of CSE Module 1 January 7, 2022 5/120

 Introduction

Preliminaries
Propositions (or Statements)
Connectives (Propositional connectives or Logical connectives)
NOT (Negation)¬P
AND (Conjunction) P ∧ Q
OR (Disjunction) P ∨ Q
If.. Then... (Implication)
If and only If
Tautology- A tautology or a universally true formula is a well
defined formula whose truth value is T for all possible
assignments of truth values to the propositional variables.
Example-P ∨ ¬P
Contradiction- A contradiction (or absurdity) is well formed
formula whose truth value is F for all possible assignments of
truth values to propostion variables.

Department of CSE Module 1 January 7, 2022 5/120

 Introduction

Preliminaries
Propositions (or Statements)
Connectives (Propositional connectives or Logical connectives)
NOT (Negation)¬P
AND (Conjunction) P ∧ Q
OR (Disjunction) P ∨ Q
If.. Then... (Implication)
If and only If
Tautology- A tautology or a universally true formula is a well
defined formula whose truth value is T for all possible
assignments of truth values to the propositional variables.
Example-P ∨ ¬P
Contradiction- A contradiction (or absurdity) is well formed
formula whose truth value is F for all possible assignments of
truth values to propostion variables.
Example-P ∧ ¬P

Department of CSE Module 1 January 7, 2022 5/120

 Introduction

Preliminaries
Propositions (or Statements)
Connectives (Propositional connectives or Logical connectives)
NOT (Negation)¬P
AND (Conjunction) P ∧ Q
OR (Disjunction) P ∨ Q
If.. Then... (Implication)
If and only If
Tautology- A tautology or a universally true formula is a well
defined formula whose truth value is T for all possible
assignments of truth values to the propositional variables.
Example-P ∨ ¬P
Contradiction- A contradiction (or absurdity) is well formed
formula whose truth value is F for all possible assignments of
truth values to propostion variables.
Example-P ∧ ¬P
Equivalence
Department of CSE Module 1 January 7, 2022 5/120
 Introduction

Preliminaries

Equivalence- Two well formed α and β in propositional

variables P1 , P2 , ....Pn are equivalent (or logically equivalent)
if the formula α ↔ β is a tautology.

Department of CSE Module 1 January 7, 2022 6/120

 Introduction

Preliminaries

Equivalence- Two well formed α and β in propositional

variables P1 , P2 , ....Pn are equivalent (or logically equivalent)
if the formula α ↔ β is a tautology.
Example
(P =⇒ (Q ∨ R)) ≡ ((P =⇒ Q) ∨ (P =⇒ R))

Department of CSE Module 1 January 7, 2022 6/120

 Introduction

Preliminaries

Logical Identities

Department of CSE Module 1 January 7, 2022 7/120

 Introduction

Preliminaries

Logical Identities
Idempotent laws- P ∨ P ≡ P, P ∧ P ≡ P

Department of CSE Module 1 January 7, 2022 7/120

 Introduction

Preliminaries

Logical Identities
Idempotent laws- P ∨ P ≡ P, P ∧ P ≡ P
Commutative laws- P ∨ Q ≡ Q ∨ P, P ∧ Q ≡ Q ∧ P

Department of CSE Module 1 January 7, 2022 7/120

 Introduction

Preliminaries

Logical Identities
Idempotent laws- P ∨ P ≡ P, P ∧ P ≡ P
Commutative laws- P ∨ Q ≡ Q ∨ P, P ∧ Q ≡ Q ∧ P
Associative laws- P ∨ (Q ∨ R) ≡ (P ∨ Q) ∨ R
P ∧ (Q ∧ R) ≡ (P ∧ Q) ∧ R

Department of CSE Module 1 January 7, 2022 7/120

 Introduction

Preliminaries

Logical Identities
Idempotent laws- P ∨ P ≡ P, P ∧ P ≡ P
Commutative laws- P ∨ Q ≡ Q ∨ P, P ∧ Q ≡ Q ∧ P
Associative laws- P ∨ (Q ∨ R) ≡ (P ∨ Q) ∨ R
P ∧ (Q ∧ R) ≡ (P ∧ Q) ∧ R
Distributive laws- P ∨ (Q ∧ R) ≡ (P ∨ Q) ∧ (P ∨ R)
P ∧ (Q ∨ R) ≡ (P ∧ Q) ∨ (P ∧ R)

Department of CSE Module 1 January 7, 2022 7/120

 Introduction

Preliminaries

Logical Identities
Idempotent laws- P ∨ P ≡ P, P ∧ P ≡ P
Commutative laws- P ∨ Q ≡ Q ∨ P, P ∧ Q ≡ Q ∧ P
Associative laws- P ∨ (Q ∨ R) ≡ (P ∨ Q) ∨ R
P ∧ (Q ∧ R) ≡ (P ∧ Q) ∧ R
Distributive laws- P ∨ (Q ∧ R) ≡ (P ∨ Q) ∧ (P ∨ R)
P ∧ (Q ∨ R) ≡ (P ∧ Q) ∨ (P ∧ R)
Absorption laws- P ∧ (P ∨ Q) ≡ P
P ∨ (P ∧ Q) ≡ P

Department of CSE Module 1 January 7, 2022 7/120

 Introduction

Preliminaries

Logical Identities
Idempotent laws- P ∨ P ≡ P, P ∧ P ≡ P
Commutative laws- P ∨ Q ≡ Q ∨ P, P ∧ Q ≡ Q ∧ P
Associative laws- P ∨ (Q ∨ R) ≡ (P ∨ Q) ∨ R
P ∧ (Q ∧ R) ≡ (P ∧ Q) ∧ R
Distributive laws- P ∨ (Q ∧ R) ≡ (P ∨ Q) ∧ (P ∨ R)
P ∧ (Q ∨ R) ≡ (P ∧ Q) ∨ (P ∧ R)
Absorption laws- P ∧ (P ∨ Q) ≡ P
P ∨ (P ∧ Q) ≡ P
De-morgan’s Laws- ¬(P ∨ Q) ≡ ¬P ∧ ¬Q
¬(P ∧ Q) ≡ ¬P ∨ ¬Q

Department of CSE Module 1 January 7, 2022 7/120

 Introduction

Preliminaries

Logical Identities
Idempotent laws- P ∨ P ≡ P, P ∧ P ≡ P
Commutative laws- P ∨ Q ≡ Q ∨ P, P ∧ Q ≡ Q ∧ P
Associative laws- P ∨ (Q ∨ R) ≡ (P ∨ Q) ∨ R
P ∧ (Q ∧ R) ≡ (P ∧ Q) ∧ R
Distributive laws- P ∨ (Q ∧ R) ≡ (P ∨ Q) ∧ (P ∨ R)
P ∧ (Q ∨ R) ≡ (P ∧ Q) ∨ (P ∧ R)
Absorption laws- P ∧ (P ∨ Q) ≡ P
P ∨ (P ∧ Q) ≡ P
De-morgan’s Laws- ¬(P ∨ Q) ≡ ¬P ∧ ¬Q
¬(P ∧ Q) ≡ ¬P ∨ ¬Q
Contrapositive- P ⇒ Q ≡ ¬Q ⇒ ¬P
P ⇒ Q ≡ ¬P ∨ Q

Department of CSE Module 1 January 7, 2022 7/120

 Introduction

Preliminaries

Logical Identities
Idempotent laws- P ∨ P ≡ P, P ∧ P ≡ P
Commutative laws- P ∨ Q ≡ Q ∨ P, P ∧ Q ≡ Q ∧ P
Associative laws- P ∨ (Q ∨ R) ≡ (P ∨ Q) ∨ R
P ∧ (Q ∧ R) ≡ (P ∧ Q) ∧ R
Distributive laws- P ∨ (Q ∧ R) ≡ (P ∨ Q) ∧ (P ∨ R)
P ∧ (Q ∨ R) ≡ (P ∧ Q) ∨ (P ∧ R)
Absorption laws- P ∧ (P ∨ Q) ≡ P
P ∨ (P ∧ Q) ≡ P
De-morgan’s Laws- ¬(P ∨ Q) ≡ ¬P ∧ ¬Q
¬(P ∧ Q) ≡ ¬P ∨ ¬Q
Contrapositive- P ⇒ Q ≡ ¬Q ⇒ ¬P
P ⇒ Q ≡ ¬P ∨ Q
Double negation- P ≡ ¬(¬P)

Department of CSE Module 1 January 7, 2022 7/120

 Introduction

Questions
Show that:
(P ∧ Q) ∨ (P ∧ ¬Q) ≡ P

Department of CSE Module 1 January 7, 2022 8/120

 Introduction

Questions
Show that:
(P ∧ Q) ∨ (P ∧ ¬Q) ≡ P
Show that:
(P =⇒ Q) ∧ (R =⇒ Q) ≡ (P ∨ R) =⇒ Q

Department of CSE Module 1 January 7, 2022 8/120

 Introduction

Mathematical Preliminaries
Set:
A set is well defined collection of objects.
Example-Set of all students in ASET,
Collection of all books in library.
Individual objects are called Members or Elements of the
set.
Capital letter usually represent Set such as A,B,C,...
Small letters represent Elements of any set such as a,b,c,....
If a is an element of set A =⇒ a ∈ A

Department of CSE Module 1 January 7, 2022 9/120

 Introduction

Mathematical Preliminaries
Set:
A set is well defined collection of objects.
Example-Set of all students in ASET,
Collection of all books in library.
Individual objects are called Members or Elements of the
set.
Capital letter usually represent Set such as A,B,C,...
Small letters represent Elements of any set such as a,b,c,....
If a is an element of set A =⇒ a ∈ A
Ways of describing set
Listing its element with no repetition
Example: {15, 30, 45, 60, 75, 90}

Department of CSE Module 1 January 7, 2022 9/120

 Introduction

Mathematical Preliminaries
Set:
A set is well defined collection of objects.
Example-Set of all students in ASET,
Collection of all books in library.
Individual objects are called Members or Elements of the
set.
Capital letter usually represent Set such as A,B,C,...
Small letters represent Elements of any set such as a,b,c,....
If a is an element of set A =⇒ a ∈ A
Ways of describing set
Listing its element with no repetition
Example: {15, 30, 45, 60, 75, 90}
Describing properties of elements of set
Example: {n | nisapositiveintegerdivisibleby 15andlessthan100}

Department of CSE Module 1 January 7, 2022 9/120

 Introduction

Mathematical Preliminaries
Set:
A set is well defined collection of objects.
Example-Set of all students in ASET,
Collection of all books in library.
Individual objects are called Members or Elements of the
set.
Capital letter usually represent Set such as A,B,C,...
Small letters represent Elements of any set such as a,b,c,....
If a is an element of set A =⇒ a ∈ A
Ways of describing set
Listing its element with no repetition
Example: {15, 30, 45, 60, 75, 90}
Describing properties of elements of set
Example: {n | nisapositiveintegerdivisibleby 15andlessthan100}
By recursion
Example: Set of all natural numers leaving remainder 1 when
divided by 3 can be written as
{an | a0 = 1, an+1 = an + 3}
Department of CSE Module 1 January 7, 2022 9/120
 Introduction

Mathematical Preliminaries

Subsets and Operations on Sets

A set A is said to be subset of B i.e. (A ⊆ B), if every
element of A is also an element of B.
If two sets A and B are equal i.e. (A = B)
=⇒ A ⊆ B and B ⊆ A.

Department of CSE Module 1 January 7, 2022 10/120

 Introduction

Mathematical Preliminaries

Subsets and Operations on Sets

A set A is said to be subset of B i.e. (A ⊆ B), if every
element of A is also an element of B.
If two sets A and B are equal i.e. (A = B)
=⇒ A ⊆ B and B ⊆ A.
Empty set: A set with no elements.

Department of CSE Module 1 January 7, 2022 10/120

 Introduction

Mathematical Preliminaries

Subsets and Operations on Sets

A set A is said to be subset of B i.e. (A ⊆ B), if every
element of A is also an element of B.
If two sets A and B are equal i.e. (A = B)
=⇒ A ⊆ B and B ⊆ A.
Empty set: A set with no elements.
Operations on sets:
A ∪ B: {x | x ∈ A or x ∈ B} called union of A and B.
A ∩ B: {x | x ∈ A and x ∈ B} called intersection of A and B.
A − B: {x | x ∈ A and x ∈/ B} called complement of B in A.

Department of CSE Module 1 January 7, 2022 10/120

 Introduction

Mathematical Preliminaries
Graph
A graph (or undirected graph) consists of:
a non-empty set V of vertices
a set E called set of edges.
a map φ which assigns to every edge a unique unordered pair of
vertices.
A directed graph or (digraph) consists of
a non-empty set V of vertices
a set E called set of edges
a map φ which assigns to every edge a unique ordered pair of
vertices.

Department of CSE Module 1 January 7, 2022 11/120

 Introduction

Mathematical Preliminaries

Tree
A graph is called a tree if it is connected and has no circuits

Department of CSE Module 1 January 7, 2022 12/120

 Introduction

Mathematical Preliminaries

Tree
A graph is called a tree if it is connected and has no circuits

Properties of tree:
A tree is connected graph with no circuits or loops

Department of CSE Module 1 January 7, 2022 12/120

 Introduction

Mathematical Preliminaries

Tree
A graph is called a tree if it is connected and has no circuits

Properties of tree:
A tree is connected graph with no circuits or loops
there is one and only one path between every pair of vertices.

Department of CSE Module 1 January 7, 2022 12/120

 Introduction

Mathematical Preliminaries

Tree
A graph is called a tree if it is connected and has no circuits

Properties of tree:
A tree is connected graph with no circuits or loops
there is one and only one path between every pair of vertices.
if a connected graph has n vertices =⇒ has n − 1 edges, implies
a tree

Department of CSE Module 1 January 7, 2022 12/120

 Introduction

Automata

Automata is defined as a system where energy, material and

information are transformed, transmitted and used for
performing some function without direct human participation.
Example: Automatic machine tools, automatic packing
machines, automatic photoprinting machines

Figure 2: Automatic photoprinting

Figure 1: Automatic machine tools
machine

Department of CSE Module 1 January 7, 2022 13/120

 Introduction

Discrete Automata
Model of discrete automaton:

Figure 3: Model of a discrete automaton

Characteristics of Automata
Input-At a discrete instant of time t1 , t2 , .....tm , input values
I1 , I2 ....Ip take finite number of fixed values from input alphabet Σ
are applied as input to model.

Department of CSE Module 1 January 7, 2022 14/120

 Introduction

Discrete Automata
Model of discrete automaton:

Figure 3: Model of a discrete automaton

Characteristics of Automata
Input-At a discrete instant of time t1 , t2 , .....tm , input values
I1 , I2 ....Ip take finite number of fixed values from input alphabet Σ
are applied as input to model.
Output- O1 , O2 , ...Oq are output of model, each of which can take
finite number of fixed values from an Output.

Department of CSE Module 1 January 7, 2022 14/120

 Introduction

Discrete Automata
Model of discrete automaton:

Figure 3: Model of a discrete automaton

Characteristics of Automata
Input-At a discrete instant of time t1 , t2 , .....tm , input values
I1 , I2 ....Ip take finite number of fixed values from input alphabet Σ
are applied as input to model.
Output- O1 , O2 , ...Oq are output of model, each of which can take
finite number of fixed values from an Output.
States- At any instant of time, the automaton can be in one of the
states q1 , q2 , ...qn

Department of CSE Module 1 January 7, 2022 14/120

 Introduction

Discrete Automata
Model of discrete automaton:

Figure 3: Model of a discrete automaton

Characteristics of Automata
Input-At a discrete instant of time t1 , t2 , .....tm , input values
I1 , I2 ....Ip take finite number of fixed values from input alphabet Σ
are applied as input to model.
Output- O1 , O2 , ...Oq are output of model, each of which can take
finite number of fixed values from an Output.
States- At any instant of time, the automaton can be in one of the
states q1 , q2 , ...qn
State relation- The next state of an automaton at any instant of
time is determined by present state and present input.

Department of CSE Module 1 January 7, 2022 14/120

 Introduction

Discrete Automata
Model of discrete automaton:

Figure 3: Model of a discrete automaton

Characteristics of Automata
Input-At a discrete instant of time t1 , t2 , .....tm , input values
I1 , I2 ....Ip take finite number of fixed values from input alphabet Σ
are applied as input to model.
Output- O1 , O2 , ...Oq are output of model, each of which can take
finite number of fixed values from an Output.
States- At any instant of time, the automaton can be in one of the
states q1 , q2 , ...qn
State relation- The next state of an automaton at any instant of
time is determined by present state and present input.
Output relation- On reading an input symbol, automaton moves to
next state which is given by state relation.
Department of CSE Module 1 January 7, 2022 14/120
 Introduction

Discrete Automata

Automaton without Memory:An automata in which the

output depends only on input.
Automaton with finite Memory: An automaton in which the
output depends on states as well as input.

Department of CSE Module 1 January 7, 2022 15/120

 Introduction

Discrete Automata

Automaton without Memory:An automata in which the

output depends only on input.
Automaton with finite Memory: An automaton in which the
output depends on states as well as input.
Moore Machine: An automaton in which the output depends only
on states of machine.
Mealy Machine: An automaton in which output depends on the
state as well as on the input at any instant of time.

Department of CSE Module 1 January 7, 2022 15/120

 Introduction

Discrete Automata
Any sequential machine behaviour can be represented by an
automaton.
Example: Consider a 4-bit serial shift register as a finite state
machine.

Department of CSE Module 1 January 7, 2022 16/120

 Introduction

Discrete Automata
Any sequential machine behaviour can be represented by an
automaton.
Example: Consider a 4-bit serial shift register as a finite state
machine.

24 = 16 states (0000, 0001, ...., 1111)

1 serial Input and 1 serial output
Input alphabet, Σ = {0,1}
Can be represented as

Here, output depends on both Input and state ∴ Mealy machine.

Department of CSE Module 1 January 7, 2022 16/120
 Introduction

Finite Automaton

A finite automaton can be represented by a finite 5-tuple

(Q, Σ, δ, q0 , F ), where:
Q is a finite non-empty set of states.
Σ is a finite non-empty set of inputs called Input alphabet.
δ is a function which maps Q × Σ → Q called Direct transition
function
It describes change of states during transition.
It is represented by transition table \ diagram.
q0 ∈ Q is Initial state
F ⊆ Q is the set of Final states
The transition function which maps Q × Σ∗ into Q is called
Indirect transition function.

Department of CSE Module 1 January 7, 2022 17/120

 Introduction

Finite Automata

Figure 4: Block diagram of Finite Automata

Department of CSE Module 1 January 7, 2022 18/120

 Introduction

Finite Automata

Figure 4: Block diagram of Finite Automata

Input tape: Each square contains a single symbol from input

alphabet Σ.
{ and $ are end markers of Tape
Absence of end markers indicates that the tape is of infinite length

Department of CSE Module 1 January 7, 2022 18/120

 Introduction

Finite Automata

Figure 4: Block diagram of Finite Automata

Input tape: Each square contains a single symbol from input

alphabet Σ.
{ and $ are end markers of Tape
Absence of end markers indicates that the tape is of infinite length
Reading Head: Examines only 1  at a time
can move from Left → Right or Right → Left

Department of CSE Module 1 January 7, 2022 18/120

 Introduction

Finite Automata

Figure 4: Block diagram of Finite Automata

Input tape: Each square contains a single symbol from input

alphabet Σ.
{ and $ are end markers of Tape
Absence of end markers indicates that the tape is of infinite length
Reading Head: Examines only 1  at a time
can move from Left → Right or Right → Left
Finite Control: Input to a finite control will usually be a
symbol under read head.
Following Outputs:
A motion to R-head along the tape on next 
Next state of the finite state machine given by δ(q, a)
Department of CSE Module 1 January 7, 2022 18/120
 Introduction

Transition Systems
A transition system or transition graph is finite directed
labelled graph in which each vertex (node) is represented by a
state and edges are labelled with input\output.

Department of CSE Module 1 January 7, 2022 19/120

 Introduction

Transition Systems
A transition system or transition graph is finite directed
labelled graph in which each vertex (node) is represented by a
state and edges are labelled with input\output.

A transition system is a 5-tuple (Q,Σ, δ, Q0 , F )

where:
Q, Σ, F are finite non-empty set of states, input alphabet and set
of final states respectively.
Q0 ⊆ Q and is non-empty
δ is a finite subset of Q × Σ∗ × Q

Department of CSE Module 1 January 7, 2022 19/120

 Introduction

Transition system
A transition system accepts a string w in Σ∗ if:
There exists a path which originates from some initial state, goes
along the arrows and terminates at some final state, and
The path value obtained by concatenation of all edge-labels of the
path is equal to w

Department of CSE Module 1 January 7, 2022 20/120

 Introduction

Transition system
A transition system accepts a string w in Σ∗ if:
There exists a path which originates from some initial state, goes
along the arrows and terminates at some final state, and
The path value obtained by concatenation of all edge-labels of the
path is equal to w

Example
Consider the given transition system:

Determine the initial states, final states and acceptability of 101011, 111010.

Department of CSE Module 1 January 7, 2022 20/120

 Introduction

Transition system
A transition system accepts a string w in Σ∗ if:
There exists a path which originates from some initial state, goes
along the arrows and terminates at some final state, and
The path value obtained by concatenation of all edge-labels of the
path is equal to w

Example
Consider the given transition system:

Determine the initial states, final states and acceptability of 101011, 111010.
Initial states:q0 and q1 ; Final State:q3
Path value q0 q0 q2 q3 for 101011 =⇒ accepted by system
But, 111010 not accepted
Department of CSE Module 1 January 7, 2022 20/120
 Introduction

Transition function
Every finite automaton (Q, Σ, δ, q0 , F) can be viewd as a
transition system (Q, Σ, δ’,q0 ,F) if we take Q0 = {q0 } and
δ 0 ={(q,w,δ(q,w))| q ∈ Q, w ∈ Σ∗ }
But, a transition system need not be a finite automaton.
Example: A transition system may contain more than one
initial state.

Department of CSE Module 1 January 7, 2022 21/120

 Introduction

Transition function
Every finite automaton (Q, Σ, δ, q0 , F) can be viewd as a
transition system (Q, Σ, δ’,q0 ,F) if we take Q0 = {q0 } and
δ 0 ={(q,w,δ(q,w))| q ∈ Q, w ∈ Σ∗ }
But, a transition system need not be a finite automaton.
Example: A transition system may contain more than one
initial state.
Properties of Transition Functions:
1 δ(q, ∧) = q is a finite automaton
=⇒ State of the system can be changed only by an input symbol.
2 For all strings w and input symbol a:
δ(q, aw )= δ(δ(q, a), w )
δ(q, wa)= δ(δ(q, w ), a)

Department of CSE Module 1 January 7, 2022 21/120

 Introduction

Transition function
Every finite automaton (Q, Σ, δ, q0 , F) can be viewd as a
transition system (Q, Σ, δ’,q0 ,F) if we take Q0 = {q0 } and
δ 0 ={(q,w,δ(q,w))| q ∈ Q, w ∈ Σ∗ }
But, a transition system need not be a finite automaton.
Example: A transition system may contain more than one
initial state.
Properties of Transition Functions:
1 δ(q, ∧) = q is a finite automaton
=⇒ State of the system can be changed only by an input symbol.
2 For all strings w and input symbol a:
δ(q, aw )= δ(δ(q, a), w )
δ(q, wa)= δ(δ(q, w ), a)

Exercise:
Prove that for any transition function δ and for any two input
string x and y
δ(q, xy )=δ(δ(q, x), y )
Department of CSE Module 1 January 7, 2022 21/120
 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Department of CSE Module 1 January 7, 2022 22/120

 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Example
Consider the finite state machine whose transition function δ is given below in form of
a transition table. Here, Q={q0 , q1 , q2 , q3 }, Σ = {0, 1}, F = {q0 }.
Give the entire sequence of states for the input string 110101.

Input

O
State 0 1
→q0 q2 q1
q1 q3 q0
q2 q0 q3
q3 q1 q2

Department of CSE Module 1 January 7, 2022 22/120

 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Example
Consider the finite state machine whose transition function δ is given below in form of
a transition table. Here, Q={q0 , q1 , q2 , q3 }, Σ = {0, 1}, F = {q0 }.
Give the entire sequence of states for the input string 110101.

Input

O
State 0 1
→q0 q2 q1
q1 q3 q0
q2 q0 q3
q3 q1 q2

Answer: δ(q0 , 110101)= δ(q1 , 10101)

Department of CSE Module 1 January 7, 2022 22/120

 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Example
Consider the finite state machine whose transition function δ is given below in form of
a transition table. Here, Q={q0 , q1 , q2 , q3 }, Σ = {0, 1}, F = {q0 }.
Give the entire sequence of states for the input string 110101.

Input

O
State 0 1
→q0 q2 q1
q1 q3 q0
q2 q0 q3
q3 q1 q2

Answer: δ(q0 , 110101)= δ(q1 , 10101)

= δ(q0 , 0101)

Department of CSE Module 1 January 7, 2022 22/120

 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Example
Consider the finite state machine whose transition function δ is given below in form of
a transition table. Here, Q={q0 , q1 , q2 , q3 }, Σ = {0, 1}, F = {q0 }.
Give the entire sequence of states for the input string 110101.

Input

O
State 0 1
→q0 q2 q1
q1 q3 q0
q2 q0 q3
q3 q1 q2

Answer: δ(q0 , 110101)= δ(q1 , 10101)

= δ(q0 , 0101)
= δ(q2 , 101)

Department of CSE Module 1 January 7, 2022 22/120

 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Example
Consider the finite state machine whose transition function δ is given below in form of
a transition table. Here, Q={q0 , q1 , q2 , q3 }, Σ = {0, 1}, F = {q0 }.
Give the entire sequence of states for the input string 110101.

Input

O
State 0 1
→q0 q2 q1
q1 q3 q0
q2 q0 q3
q3 q1 q2

Answer: δ(q0 , 110101)= δ(q1 , 10101)

= δ(q0 , 0101)
= δ(q2 , 101)
= δ(q3 , 01)

Department of CSE Module 1 January 7, 2022 22/120

 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Example
Consider the finite state machine whose transition function δ is given below in form of
a transition table. Here, Q={q0 , q1 , q2 , q3 }, Σ = {0, 1}, F = {q0 }.
Give the entire sequence of states for the input string 110101.

Input

O
State 0 1
→q0 q2 q1
q1 q3 q0
q2 q0 q3
q3 q1 q2

Answer: δ(q0 , 110101)= δ(q1 , 10101)

= δ(q0 , 0101)
= δ(q2 , 101)
= δ(q3 , 01)
= δ(q1 , 1)

Department of CSE Module 1 January 7, 2022 22/120

 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Example
Consider the finite state machine whose transition function δ is given below in form of
a transition table. Here, Q={q0 , q1 , q2 , q3 }, Σ = {0, 1}, F = {q0 }.
Give the entire sequence of states for the input string 110101.

Input

O
State 0 1
→q0 q2 q1
q1 q3 q0
q2 q0 q3
q3 q1 q2

Answer: δ(q0 , 110101)= δ(q1 , 10101)

= δ(q0 , 0101)
= δ(q2 , 101)
= δ(q3 , 01)
= δ(q1 , 1)
= δ(q0 , ∧)

Department of CSE Module 1 January 7, 2022 22/120

 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Example
Consider the finite state machine whose transition function δ is given below in form of
a transition table. Here, Q={q0 , q1 , q2 , q3 }, Σ = {0, 1}, F = {q0 }.
Give the entire sequence of states for the input string 110101.

Input

O
State 0 1
→q0 q2 q1
q1 q3 q0
q2 q0 q3
q3 q1 q2

Answer: δ(q0 , 110101)= δ(q1 , 10101)

= δ(q0 , 0101)
= δ(q2 , 101)
= δ(q3 , 01)
= δ(q1 , 1)
= δ(q0 , ∧)
=q0

Department of CSE Module 1 January 7, 2022 22/120

 Introduction

Acceptability of a String by a finite automaton

A string ’x’ is accepted by a finite automaton M = (Q, Σ, δ, q0 , F )
if δ(q0 , x)= q for some q ∈ F

Example
Consider the finite state machine whose transition function δ is given below in form of
a transition table. Here, Q={q0 , q1 , q2 , q3 }, Σ = {0, 1}, F = {q0 }.
Give the entire sequence of states for the input string 110101.

Input

O
State 0 1
→q0 q2 q1
q1 q3 q0
q2 q0 q3
q3 q1 q2

Answer: δ(q0 , 110101)= δ(q1 , 10101)

= δ(q0 , 0101)
= δ(q2 , 101)
= δ(q3 , 01)
= δ(q1 , 1)
= δ(q0 , ∧)
=q0
1 1 0 1 0 1
Hence, q0 −
→ q1 −
→ q0 −
→ q2 −
→ q3 −
→ q1 −
→ q0 Accepted
Department of CSE Module 1 January 7, 2022 22/120
Deterministic and Non Deterministic Finite Automata

Non-Deterministic Finite State Machines

Department of CSE Module 1 January 7, 2022 23/120

Deterministic and Non Deterministic Finite Automata

Non-Deterministic Finite State Machines

A non-deterministic finite automaton (NDFA) is a 5-tuple

(Q, Σ, δ, q0 , F ) where
Q is a finite non-empty set of states
Σ is a finite non-empty set of inputs
δ is a transition function mapping from Q × Σ into 2Q which
is power set of Q, the set of all subsets of Q
q0 ∈ Q is the initial state
F ⊆ Q is the set of final states.
Department of CSE Module 1 January 7, 2022 23/120
Deterministic and Non Deterministic Finite Automata

Non-Deterministic Finite State Machines

Consider a Non-deterministic automaton as under:

Determine the sequence of states for input string 0100

Department of CSE Module 1 January 7, 2022 24/120

Deterministic and Non Deterministic Finite Automata

Non-Deterministic Finite State Machines

Consider a Non-deterministic automaton as under:

Determine the sequence of states for input string 0100

Department of CSE Module 1 January 7, 2022 24/120

Deterministic and Non Deterministic Finite Automata

Non-Deterministic Finite State Machines

Consider a Non-deterministic automaton as under:

Determine the sequence of states for input string 0100

δ(q0 , 0100)= {q0 , q3 , q4 }

Since q4 is the final state. ∴ input string 0100 is accepted by the system.

Department of CSE Module 1 January 7, 2022 24/120

Deterministic and Non Deterministic Finite Automata

Non-Deterministic Finite State Machines

Consider a Non-deterministic automaton as under:

Determine the sequence of states for input string 0100

δ(q0 , 0100)= {q0 , q3 , q4 }

Since q4 is the final state. ∴ input string 0100 is accepted by the system.
A string w ∈ Σ∗ is accepted by NDFA ”M”. If δ(q0 , w ) contains some final
state.

Department of CSE Module 1 January 7, 2022 24/120

Deterministic and Non Deterministic Finite Automata

Equivalence of DFA and NDFA

A DFA can simulate the behaviour of NDFA by increasing the
number of states
DFA (Q, Σ, δ, q0 , F) can be viewed as NDFA (Q, Σ, δ 0 , q0 , F)
Any NDFA is a more general machine without being more
powerful.
=⇒ For every NDFA, there exists a DFA which simulates the
behaviour of NDFA.

Department of CSE Module 1 January 7, 2022 25/120

Deterministic and Non Deterministic Finite Automata

Equivalence of DFA and NDFA

A DFA can simulate the behaviour of NDFA by increasing the
number of states
DFA (Q, Σ, δ, q0 , F) can be viewed as NDFA (Q, Σ, δ 0 , q0 , F)
Any NDFA is a more general machine without being more
powerful.
=⇒ For every NDFA, there exists a DFA which simulates the
behaviour of NDFA.Alternatively, if L is a set accepted by
NDFA, then there exists a DFA which also accepts L.
Example
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:
State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Department of CSE Module 1 January 7, 2022 25/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ] [q0 ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ] [q0 ] [q1 ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ] [q0 ] [q1 ]
[q1 ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ] [q0 ] [q1 ]
[q1 ] [q1 ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ] [q0 ] [q1 ]
[q1 ] [q1 ] [q0 ,q1 ]

Department of CSE Module 1 January 7, 2022 26/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ] [q0 ] [q1 ]
[q1 ] [q1 ] [q0 ,q1 ]
[qo ,q1 ]
Department of CSE Module 1 January 7, 2022 26/120
Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ] [q0 ] [q1 ]
[q1 ] [q1 ] [q0 ,q1 ]
[qo ,q1 ] [qo ,q1 ]
Department of CSE Module 1 January 7, 2022 26/120
Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ] [q0 ] [q1 ]
[q1 ] [q1 ] [q0 ,q1 ]
[qo ,q1 ] [qo ,q1 ] [qo ,q1 ]
Department of CSE Module 1 January 7, 2022 26/120
Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 1
Contruct a deterministic automaton equivalent to M=({q0 , q1 }, {0, 1}, δ, q0 , {q0 })
where δ is defined as under:

State Input

O
0 1
→q0 q0 q1
q1 q1 q0 ,q1

Solution: For the deterministic automaton M1 :

The states are subsets of {q0 ,q1 }
=⇒ φ, [q0 ], [q1 ], [q0 , q1 ]
[q0 ] is initial state.
[q0 ] and [q0 , q1 ] are final states as these are the only states containing q0
δ is defined by state table as under:
State Input
0 1
[φ] [φ] [φ]
[q0 ] [q0 ] [q1 ]
[q1 ] [q1 ] [q0 ,q1 ]
[qo ,q1 ] [qo ,q1 ] [qo ,q1 ]
Department of CSE Module 1 January 7, 2022 26/120
Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]
[q2 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]
[q2 ] φ

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]
[q2 ] φ [q0 , q1 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]
[q2 ] φ [q0 , q1 ]
[q0 , q1 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]
[q2 ] φ [q0 , q1 ]
[q0 , q1 ] [q0 , q1 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]
[q2 ] φ [q0 , q1 ]
[q0 , q1 ] [q0 , q1 ] [q1 , q2 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]
[q2 ] φ [q0 , q1 ]
[q0 , q1 ] [q0 , q1 ] [q1 , q2 ]
[q1 , q2 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]
[q2 ] φ [q0 , q1 ]
[q0 , q1 ] [q0 , q1 ] [q1 , q2 ]
[q1 , q2 ] [q0 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 2
Find a deterministic acceptor equivalent to:
M= ({q0 ,q1 ,q2 },{a,b}, δ, q0 , {q2 })
where δ is given by

State Input
a b
→ q0 q0 , q1 q2

O
q1 q0 q1
q2 φ q0 , q1

Solution: The deterministic automaton M1 equivalent to M is defined as follows:

M1 =(2Q ,{a,b}, δ, [q0 ], F’)
where, F’= {[q2 ],[q0 , q2 ],[q1 , q2 ],[q0 , q1 , q2 ]}

State Input
a b
[q0 ] [q0 , q1 ] [q2 ]
[q2 ] φ [q0 , q1 ]
[q0 , q1 ] [q0 , q1 ] [q1 , q2 ]
[q1 , q2 ] [q0 ] [q0 , q1 ]

Department of CSE Module 1 January 7, 2022 27/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ] [q0 , q1 , q2 , q3 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q3 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q3 ]
[q0 , q1 , q3 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q3 ]
[q0 , q1 , q3 ] [q0 , q1 , q2 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q3 ]
[q0 , q1 , q3 ] [q0 , q1 , q2 ] [q0 , q1 , q2 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q3 ]
[q0 , q1 , q3 ] [q0 , q1 , q2 ] [q0 , q1 , q2 ]
[q0 , q1 , q2 , q3 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q3 ]
[q0 , q1 , q3 ] [q0 , q1 , q2 ] [q0 , q1 , q2 ]
[q0 , q1 , q2 , q3 ] [q0 , q1 , q2 , q3 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q3 ]
[q0 , q1 , q3 ] [q0 , q1 , q2 ] [q0 , q1 , q2 ]
[q0 , q1 , q2 , q3 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q2 , q3 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
Example 3
Construct a deterministic finite automaton equivalent to
M=({q0 , q1 , q2 , q3 },{a,b},δ,q0 ,{q3 })
where δ is as under:
State Input
a b
→ q0 q0 , q1 q0
q1 q2 q1

O
q2
q3
q3 q3
q2

Solution: Let Q = {q0 , q1 , q2 , q3 }, then the deterministic automaton M1 equivalent to

M is given by M1 =(2Q ,{a,b},δ,[q0 ],F)
where, F consists of:
{[q3 ],[q0 , q3 ],[q1 , q3 ],[q2 , q3 ],[q0 , q1 , q3 ],[q0 , q2 , q3 ],[q1 , q2 , q3 ],[q0 , q1 , q2 , q3 ]}
and δ is defined by state table as under:

State Input
a b
[q0 ] [qo , q1 ] [q0 ]
[q0 , q1 ] [q0 , q1 , q2 ] [q0 , q1 ]
[q0 , q1 , q2 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q3 ]
[q0 , q1 , q3 ] [q0 , q1 , q2 ] [q0 , q1 , q2 ]
[q0 , q1 , q2 , q3 ] [q0 , q1 , q2 , q3 ] [q0 , q1 , q2 , q3 ]

Department of CSE Module 1 January 7, 2022 28/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
1 Construct a DFA equivalent to NDFA ’M’ whose transition
diagram is given as:

Department of CSE Module 1 January 7, 2022 29/120

Deterministic and Non Deterministic Finite Automata

NDFA → DFA
1 Construct a DFA equivalent to NDFA ’M’ whose transition
diagram is given as:

2 Construct a DFA equivalent to NDFA with initial state q0

whose transition table is defined as

Department of CSE Module 1 January 7, 2022 29/120

Deterministic and Non Deterministic Finite Automata

Constructing required DFA

Example 1
Construct a DFA accepting all strings ’w ’ over {0,1} such that the
number of 1’s in ’w ’ is 3mod4.

Department of CSE Module 1 January 7, 2022 30/120

Deterministic and Non Deterministic Finite Automata

Constructing required DFA

Example 1
Construct a DFA accepting all strings ’w ’ over {0,1} such that the
number of 1’s in ’w ’ is 3mod4.
Solution: Let the required NDFA, as the condition on strings of
T(M) doesn’t at all involve 0,
=⇒ M doesnot change the state on input 0.

Department of CSE Module 1 January 7, 2022 30/120

Deterministic and Non Deterministic Finite Automata

Constructing required DFA

Example 1
Construct a DFA accepting all strings ’w ’ over {0,1} such that the
number of 1’s in ’w ’ is 3mod4.
Solution: Let the required NDFA, as the condition on strings of
T(M) doesn’t at all involve 0,
=⇒ M doesnot change the state on input 0.
If 1 appears in w (4k+3) times, M can come back to initial state,
after reading 4 1’s and to a final state after reading 3 1’s.

Department of CSE Module 1 January 7, 2022 30/120

Deterministic and Non Deterministic Finite Automata

Constructing required DFA

Example 1
Construct a DFA accepting all strings ’w ’ over {0,1} such that the
number of 1’s in ’w ’ is 3mod4.
Solution: Let the required NDFA, as the condition on strings of
T(M) doesn’t at all involve 0,
=⇒ M doesnot change the state on input 0.
If 1 appears in w (4k+3) times, M can come back to initial state,
after reading 4 1’s and to a final state after reading 3 1’s.
The required DFA:

Department of CSE Module 1 January 7, 2022 30/120

Deterministic and Non Deterministic Finite Automata

Constructing required DFA

Example 1
Construct a DFA accepting all strings ’w ’ over {0,1} such that the
number of 1’s in ’w ’ is 3mod4.
Solution: Let the required NDFA, as the condition on strings of
T(M) doesn’t at all involve 0,
=⇒ M doesnot change the state on input 0.
If 1 appears in w (4k+3) times, M can come back to initial state,
after reading 4 1’s and to a final state after reading 3 1’s.
The required DFA:

Department of CSE Module 1 January 7, 2022 30/120

Deterministic and Non Deterministic Finite Automata

Constructing required DFA

1 Construct a DFA accepting all strings over {a,b} ending in ab.

Department of CSE Module 1 January 7, 2022 31/120

Deterministic and Non Deterministic Finite Automata

Constructing required DFA

1 Construct a DFA accepting all strings over {a,b} ending in ab.

Department of CSE Module 1 January 7, 2022 31/120

Deterministic and Non Deterministic Finite Automata

Constructing required DFA

1 Construct a DFA accepting all strings over {a,b} ending in ab.

2 Construct a DFA equivalent to NDFA for:

State Input
0 1 ∧
→ q0 q0 , q3 q0 , q1
q1 q2
q2 q2 q2 q4

O
q3 q4
q4 q4 q4
Department of CSE Module 1 January 7, 2022 31/120
Deterministic and Non Deterministic Finite Automata

Constructing required DFA

1 M=({q1 , q2 , q3 },{0,1}, δ,q1 ,{q3 }) is a NDFA where δ is given

by:
δ(q1 , 0)={q2 , q3 }
δ(q1 , 1)={q1 }
δ(q2 , 0)={q1 , q2 }
δ(q2 , 1)=φ
δ(q3 , 0)={q2 }
δ(q3 , 1)={q1 , q2 }
Construct equivalent DFA.

Department of CSE Module 1 January 7, 2022 32/120

 Finite Automata with Output

Finite Automata with Outputs

Moore Machine is a 6-tuple (Q,Σ, ∆, δ, λ, q0 )
where Q is a finite set of states
Σ is the input alphabet
∆ is the output alphabet
δ is the transition function Q × Σ into Q
λ is the output function Q into ∆
q0 is the initial state

Department of CSE Module 1 January 7, 2022 33/120

 Finite Automata with Output

Finite Automata with Outputs

Moore Machine is a 6-tuple (Q,Σ, ∆, δ, λ, q0 )
where Q is a finite set of states
Σ is the input alphabet
∆ is the output alphabet
δ is the transition function Q × Σ into Q
λ is the output function Q into ∆
q0 is the initial state

Example:
Initial state q0 is marked with an arrow. The table defines δ and λ:

Present Next State Output

O
State a=0 a=1 λ
→ q0 q3 q1 0
q1 q1 q2 1
q2 q2 q3 0
q3 q3 q0 0

Determine transition states and output string for input string 0111.

Department of CSE Module 1 January 7, 2022 33/120

 Finite Automata with Output

Finite Automata with Outputs

Moore Machine is a 6-tuple (Q,Σ, ∆, δ, λ, q0 )
where Q is a finite set of states
Σ is the input alphabet
∆ is the output alphabet
δ is the transition function Q × Σ into Q
λ is the output function Q into ∆
q0 is the initial state

Example:
Initial state q0 is marked with an arrow. The table defines δ and λ:

Present Next State Output

O
State a=0 a=1 λ
→ q0 q3 q1 0
q1 q1 q2 1
q2 q2 q3 0
q3 q3 q0 0

Determine transition states and output string for input string 0111.
Solution: Transition states:
0\0 1\0 1\0 1\1
q0 −−→ q3 −−→ q0 −−→ q1 −−→ q2 0
OutputString: 00010

Department of CSE Module 1 January 7, 2022 33/120

 Finite Automata with Output

Finite Automata with Outputs

Mealy Machine is a 6-tuple (Q,Σ, ∆, δ, λ, q0 )
where Q is a finite set of states
Σ is the input alphabet
∆ is the output alphabet
δ is the transition function Q × Σ into Q
λ is the output function mapping Q ×Σ into ∆
q0 is the initial state

Department of CSE Module 1 January 7, 2022 34/120

 Finite Automata with Output

Finite Automata with Outputs

Mealy Machine is a 6-tuple (Q,Σ, ∆, δ, λ, q0 )
where Q is a finite set of states
Σ is the input alphabet
∆ is the output alphabet
δ is the transition function Q × Σ into Q
λ is the output function mapping Q ×Σ into ∆
q0 is the initial state

Example:
Consider a mealy machine for q1 as initial state.

Present a=0 a=1

State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

Determine the transition of states and corresponding output string for input string
0011.

Department of CSE Module 1 January 7, 2022 34/120

 Finite Automata with Output

Finite Automata with Outputs

Mealy Machine is a 6-tuple (Q,Σ, ∆, δ, λ, q0 )
where Q is a finite set of states
Σ is the input alphabet
∆ is the output alphabet
δ is the transition function Q × Σ into Q
λ is the output function mapping Q ×Σ into ∆
q0 is the initial state

Example:
Consider a mealy machine for q1 as initial state.

Present a=0 a=1

State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

Determine the transition of states and corresponding output string for input string
0011.
0\0 0\1 1\0 1\0
Solution: q1 −−→ q3 −−→ q2 −−→ q4 −−→ q3
Output String: 0100

Department of CSE Module 1 January 7, 2022 34/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

Department of CSE Module 1 January 7, 2022 35/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:

Department of CSE Module 1 January 7, 2022 35/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1
q20
q21
q3
q40
q41
Department of CSE Module 1 January 7, 2022 35/120
 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1 1
q40

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1 1
q40 q41

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1 1
q40 q41 1

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1 1
q40 q41 1 q3

Department of CSE Module 1 January 7, 2022 36/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1 1
q40 q41 1 q3 0
q41
Department of CSE Module 1 January 7, 2022 36/120
 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1 1
q40 q41 1 q3 0
q41 q41
Department of CSE Module 1 January 7, 2022 36/120
 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1 1
q40 q41 1 q3 0
q41 q41 1
Department of CSE Module 1 January 7, 2022 36/120
 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1 1
q40 q41 1 q3 0
q41 q41 1 q3
Department of CSE Module 1 January 7, 2022 36/120
 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q20 0
q20 q1 1 q40 0
q21 q1 1 q40 0
q3 q21 1 q1 1
q40 q41 1 q3 0
q41 q41 1 q3 0
Department of CSE Module 1 January 7, 2022 36/120
 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a

moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1 Output
q1 q3 q20
q20 q1 q40
q21 q1 q40
q3 q21 q1
q40 q41 q3
q41 q41 q3

Department of CSE Module 1 January 7, 2022 37/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a

moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1 Output
q1 q3 q20 1
q20 q1 q40
q21 q1 q40
q3 q21 q1
q40 q41 q3
q41 q41 q3

Department of CSE Module 1 January 7, 2022 38/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a

moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1 Output
q1 q3 q20 1
q20 q1 q40 0
q21 q1 q40
q3 q21 q1
q40 q41 q3
q41 q41 q3

Department of CSE Module 1 January 7, 2022 39/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a

moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1 Output
q1 q3 q20 1
q20 q1 q40 0
q21 q1 q40 1
q3 q21 q1
q40 q41 q3
q41 q41 q3

Department of CSE Module 1 January 7, 2022 40/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a

moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1 Output
q1 q3 q20 1
q20 q1 q40 0
q21 q1 q40 1
q3 q21 q1 0
q40 q41 q3
q41 q41 q3

Department of CSE Module 1 January 7, 2022 41/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a

moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1 Output
q1 q3 q20 1
q20 q1 q40 0
q21 q1 q40 1
q3 q21 q1 0
q40 q41 q3 0
q41 q41 q3

Department of CSE Module 1 January 7, 2022 42/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a

moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1 Output
q1 q3 q20 1
q20 q1 q40 0
q21 q1 q40 1
q3 q21 q1 0
q40 q41 q3 0
q41 q41 q3 1

Department of CSE Module 1 January 7, 2022 43/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Consider the mealy machie described by given transition table. Construct a
moore machine which is equivalent to given mealy machine.
Present a=0 a=1
State State Output State Output
→ q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0

q20 q40

q2 q4

q21 q41
Solution:
Present a=0 a=1 Output
→ q0 q3 q20 0
q1 q3 q20 1
q20 q1 q40 0
q21 q1 q40 1
q3 q21 q1 0
q40 q41 q3 0
q41 q41 q3 1
Department of CSE Module 1 January 7, 2022 44/120
 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Convert the given mealy machine into equivalent moore machine

Department of CSE Module 1 January 7, 2022 45/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Convert the given mealy machine into equivalent moore machine

Department of CSE Module 1 January 7, 2022 45/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Convert the given mealy machine into equivalent moore machine

Department of CSE Module 1 January 7, 2022 45/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Convert the given mealy machine into equivalent moore machine

Department of CSE Module 1 January 7, 2022 45/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Present a=0 a=1

State state Output State Output
→ q1 q2 Z1 q3 Z1
q2 q2 Z2 q3 Z1
q3 q2 Z1 q3 Z2

Department of CSE Module 1 January 7, 2022 46/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Present a=0 a=1

State state Output State Output
→ q1 q2 Z1 q3 Z1
q2 q2 Z2 q3 Z1
q3 q2 Z1 q3 Z2

q21 q31
q2 q3
q22 q32

Department of CSE Module 1 January 7, 2022 46/120

 Finite Automata with Output

Procedure of transforming Mealy machine into Moore machine

Present a=0 a=1

State state Output State Output
→ q1 q2 Z1 q3 Z1
q2 q2 Z2 q3 Z1
q3 q2 Z1 q3 Z2

Present a=0 a=1

q21 q31 State state Output State Output
q1 q21 Z1 q31 Z1
q2 q3 q21 q22 Z2 q31 Z1
q22 q22 Z2 q31 Z1
q22 q32 q31 q21 Z1 q32 Z2
q32 q21 Z1 q32 Z2

Department of CSE Module 1 January 7, 2022 46/120

 Finite Automata with Output

Procedure of transforming Mealy machine into

Moore machine
Present Next State Output
State a=0 a=1
q1 q21 q31
q21 q22 q31 Z1
q22 q22 q31 Z2
q31 q21 q32 Z1
q32 q21 q32 Z2

Department of CSE Module 1 January 7, 2022 47/120

 Finite Automata with Output

Procedure of transforming Moore machine into Mealy machine

Consider the moore machine described by the transition table given:

Present Next State Output
State a=0 a=1
→ q1 q1 q2 0
q2 q1 q3 0
q3 q1 q3 1
Construct the corresponding mealy machine.

Department of CSE Module 1 January 7, 2022 48/120

 Finite Automata with Output

Procedure of transforming Moore machine into Mealy machine

Consider the moore machine described by the transition table given:

Present Next State Output
State a=0 a=1
→ q1 q1 q2 0
q2 q1 q3 0
q3 q1 q3 1
Construct the corresponding mealy machine.
Solution:
Present a=0 a=1
State state Output State Output
→ q1 q1 0 q2 0
q2 q1 0 q3 1
q3 q1 0 q3 1

Department of CSE Module 1 January 7, 2022 48/120

 Finite Automata with Output

Procedure of transforming Moore machine into Mealy machine

Consider the moore machine described by the transition table given:

Present Next State Output
State a=0 a=1
→ q1 q1 q2 0
q2 q1 q3 0
q3 q1 q3 1
Construct the corresponding mealy machine.
Solution:
Present a=0 a=1
State state Output State Output
→ q1 q1 0 q2 0
q2 q1 0 q3 1
q3 q1 0 q3 1
Now, Find identical rows and remove one of them

Department of CSE Module 1 January 7, 2022 48/120

 Finite Automata with Output

Procedure of transforming Moore machine into Mealy machine

Consider the moore machine described by the transition table given:

Present Next State Output
State a=0 a=1
→ q1 q1 q2 0
q2 q1 q3 0
q3 q1 q3 1
Construct the corresponding mealy machine.
Solution:
Present a=0 a=1
State state Output State Output
→ q1 q1 0 q2 0
q2 q1 0 q3 1
q3 q1 0 q3 1
Now, Find identical rows and remove one of them
Present a=0 a=1
State state Output State Output
→ q1 q1 0 q2 0
q2 q1 0 q2 1

Department of CSE Module 1 January 7, 2022 48/120

 Formal Grammar

Language: Introduction
Language

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction
Language
Formal (Syntactic Languages)
Informal (Semantic Languages)

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction
Language
Formal (Syntactic Languages)
Informal (Semantic Languages)
Alphabet

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction
Language
Formal (Syntactic Languages)
Informal (Semantic Languages)
Alphabet
String

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction
Language
Formal (Syntactic Languages)
Informal (Semantic Languages)
Alphabet
String A concatenation of finite symbols from the alphabet is called
a string.

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction
Language
Formal (Syntactic Languages)
Informal (Semantic Languages)
Alphabet
String A concatenation of finite symbols from the alphabet is called
a string.
Example: If Σ={a,b} then a, abab, aaabb,
abababababaaaaaaabaab, etc.

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction
Language
Formal (Syntactic Languages)
Informal (Semantic Languages)
Alphabet
String A concatenation of finite symbols from the alphabet is called
a string.
Example: If Σ={a,b} then a, abab, aaabb,
abababababaaaaaaabaab, etc.
Empty String or Null String

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction
Language
Formal (Syntactic Languages)
Informal (Semantic Languages)
Alphabet
String A concatenation of finite symbols from the alphabet is called
a string.
Example: If Σ={a,b} then a, abab, aaabb,
abababababaaaaaaabaab, etc.
Empty String or Null String∧ or λ or φ
=⇒ A string with no symbols
Words

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction
Language
Formal (Syntactic Languages)
Informal (Semantic Languages)
Alphabet
String A concatenation of finite symbols from the alphabet is called
a string.
Example: If Σ={a,b} then a, abab, aaabb,
abababababaaaaaaabaab, etc.
Empty String or Null String∧ or λ or φ
=⇒ A string with no symbols
Words =⇒ strings belonging to some language
Example: If Σ={x} then a language L can be defined as
L={x n :n=1,2,3,....} or
L={x,xx,xxx,....}
Here, x, xx, xxx ,.... are the words of L.

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction
Language
Formal (Syntactic Languages)
Informal (Semantic Languages)
Alphabet
String A concatenation of finite symbols from the alphabet is called
a string.
Example: If Σ={a,b} then a, abab, aaabb,
abababababaaaaaaabaab, etc.
Empty String or Null String∧ or λ or φ
=⇒ A string with no symbols
Words =⇒ strings belonging to some language
Example: If Σ={x} then a language L can be defined as
L={x n :n=1,2,3,....} or
L={x,xx,xxx,....}
Here, x, xx, xxx ,.... are the words of L.
All words are strings but not all strings are words.

Department of CSE Module 1 January 7, 2022 49/120

 Formal Grammar

Language: Introduction

Length of String: |S| =⇒ number of letters in the string.

Example: Σ={a,b}
If S= ababa, then |S|=5
Reverse of String: S r =⇒ Obtained by writing letters of ’S’
in reverse order.

Department of CSE Module 1 January 7, 2022 50/120

 Formal Grammar

Language: Introduction

Length of String: |S| =⇒ number of letters in the string.

Example: Σ={a,b}
If S= ababa, then |S|=5
Reverse of String: S r =⇒ Obtained by writing letters of ’S’
in reverse order.
Example:
If s=abc over Σ={a,b,c}
Then, Rev(s) or s r =cba

Department of CSE Module 1 January 7, 2022 50/120

 Formal Grammar

Language: Introduction

Length of String: |S| =⇒ number of letters in the string.

Example: Σ={a,b}
If S= ababa, then |S|=5
Reverse of String: S r =⇒ Obtained by writing letters of ’S’
in reverse order.
Example:
If s=abc over Σ={a,b,c}
Then, Rev(s) or s r =cba
Σ={B,aB,bab,d}
s=BaBbabBd
s r =dBbabaBB

Department of CSE Module 1 January 7, 2022 50/120

 Formal Grammar

Language: Definition

Descriptive Definition
Recursive Definition
Using Regular Expression
Using Finite Automata, etc.

Department of CSE Module 1 January 7, 2022 51/120

 Formal Grammar

Language: Definition

Descriptive Definition
Recursive Definition
Using Regular Expression
Using Finite Automata, etc.

Department of CSE Module 1 January 7, 2022 51/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.

Department of CSE Module 1 January 7, 2022 52/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.
Example:
1 The language L of strings of odd length, defined over Σ={a}
=⇒ L={a, aaa,aaaaa, ....}

Department of CSE Module 1 January 7, 2022 52/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.
Example:
1 The language L of strings of odd length, defined over Σ={a}
=⇒ L={a, aaa,aaaaa, ....}
2 The language L of strings that doesnot start with ’a’ defined over Σ={a,b,c}
=⇒ L={b,c,ba, bb,bc,ca,cb,cc}

Department of CSE Module 1 January 7, 2022 52/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.
Example:
1 The language L of strings of odd length, defined over Σ={a}
=⇒ L={a, aaa,aaaaa, ....}
2 The language L of strings that doesnot start with ’a’ defined over Σ={a,b,c}
=⇒ L={b,c,ba, bb,bc,ca,cb,cc}
3 The language L of strings of length 2 over Σ={0,1,2}
=⇒ L={00,01,02,10,22,12,...}

Department of CSE Module 1 January 7, 2022 52/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.
Example:
1 The language L of strings of odd length, defined over Σ={a}
=⇒ L={a, aaa,aaaaa, ....}
2 The language L of strings that doesnot start with ’a’ defined over Σ={a,b,c}
=⇒ L={b,c,ba, bb,bc,ca,cb,cc}
3 The language L of strings of length 2 over Σ={0,1,2}
=⇒ L={00,01,02,10,22,12,...}
4 The language L of strings ending in 0 over Σ={0,1}
L={0,00,10,000,010,100,...}

Department of CSE Module 1 January 7, 2022 52/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.
Example:
1 The language L of strings of odd length, defined over Σ={a}
=⇒ L={a, aaa,aaaaa, ....}
2 The language L of strings that doesnot start with ’a’ defined over Σ={a,b,c}
=⇒ L={b,c,ba, bb,bc,ca,cb,cc}
3 The language L of strings of length 2 over Σ={0,1,2}
=⇒ L={00,01,02,10,22,12,...}
4 The language L of strings ending in 0 over Σ={0,1}
L={0,00,10,000,010,100,...}
5 The language L of Strings with number of ”a”(s) equal to number of ”b”(s)
over Σ={a,b}
L={∧, ab,aabb,abab,baba,abba,....}

Department of CSE Module 1 January 7, 2022 52/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.
Example:
1 The language L of strings of odd length, defined over Σ={a}
=⇒ L={a, aaa,aaaaa, ....}
2 The language L of strings that doesnot start with ’a’ defined over Σ={a,b,c}
=⇒ L={b,c,ba, bb,bc,ca,cb,cc}
3 The language L of strings of length 2 over Σ={0,1,2}
=⇒ L={00,01,02,10,22,12,...}
4 The language L of strings ending in 0 over Σ={0,1}
L={0,00,10,000,010,100,...}
5 The language L of Strings with number of ”a”(s) equal to number of ”b”(s)
over Σ={a,b}
L={∧, ab,aabb,abab,baba,abba,....}
6 Language Even-Even of string with even number of a(s) and even number of
b(s) over Σ={a,b}
L={∧, aa,bb,aaaa,aabb,abab,...}

Department of CSE Module 1 January 7, 2022 52/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.
Example:
1 The language L of strings of odd length, defined over Σ={a}
=⇒ L={a, aaa,aaaaa, ....}
2 The language L of strings that doesnot start with ’a’ defined over Σ={a,b,c}
=⇒ L={b,c,ba, bb,bc,ca,cb,cc}
3 The language L of strings of length 2 over Σ={0,1,2}
=⇒ L={00,01,02,10,22,12,...}
4 The language L of strings ending in 0 over Σ={0,1}
L={0,00,10,000,010,100,...}
5 The language L of Strings with number of ”a”(s) equal to number of ”b”(s)
over Σ={a,b}
L={∧, ab,aabb,abab,baba,abba,....}
6 Language Even-Even of string with even number of a(s) and even number of
b(s) over Σ={a,b}
L={∧, aa,bb,aaaa,aabb,abab,...}
7 Language Integer of strings over Σ=-,0,1,2,3,4,5,6,7,8,9
L={......, -2,-1,0,1,2,....}

Department of CSE Module 1 January 7, 2022 52/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.
Example:
1 The language L of strings of odd length, defined over Σ={a}
=⇒ L={a, aaa,aaaaa, ....}
2 The language L of strings that doesnot start with ’a’ defined over Σ={a,b,c}
=⇒ L={b,c,ba, bb,bc,ca,cb,cc}
3 The language L of strings of length 2 over Σ={0,1,2}
=⇒ L={00,01,02,10,22,12,...}
4 The language L of strings ending in 0 over Σ={0,1}
L={0,00,10,000,010,100,...}
5 The language L of Strings with number of ”a”(s) equal to number of ”b”(s)
over Σ={a,b}
L={∧, ab,aabb,abab,baba,abba,....}
6 Language Even-Even of string with even number of a(s) and even number of
b(s) over Σ={a,b}
L={∧, aa,bb,aaaa,aabb,abab,...}
7 Language Integer of strings over Σ=-,0,1,2,3,4,5,6,7,8,9
L={......, -2,-1,0,1,2,....}
8 Language {an b n } over Σ={a,b} or {an b n :n=1,2,3,....}
L={ab,aabb,aaabbb, ....}

Department of CSE Module 1 January 7, 2022 52/120

 Formal Grammar

Descriptive definition of Language

The language is defined describing the conditions imposed on its words.
Example:
1 The language L of strings of odd length, defined over Σ={a}
=⇒ L={a, aaa,aaaaa, ....}
2 The language L of strings that doesnot start with ’a’ defined over Σ={a,b,c}
=⇒ L={b,c,ba, bb,bc,ca,cb,cc}
3 The language L of strings of length 2 over Σ={0,1,2}
=⇒ L={00,01,02,10,22,12,...}
4 The language L of strings ending in 0 over Σ={0,1}
L={0,00,10,000,010,100,...}
5 The language L of Strings with number of ”a”(s) equal to number of ”b”(s)
over Σ={a,b}
L={∧, ab,aabb,abab,baba,abba,....}
6 Language Even-Even of string with even number of a(s) and even number of
b(s) over Σ={a,b}
L={∧, aa,bb,aaaa,aabb,abab,...}
7 Language Integer of strings over Σ=-,0,1,2,3,4,5,6,7,8,9
L={......, -2,-1,0,1,2,....}
8 Language {an b n } over Σ={a,b} or {an b n :n=1,2,3,....}
L={ab,aabb,aaabbb, ....}
9 Palindrome over Σ={a,b}
L={∧, a,b, aa,bb, aaa,aba,bab,bbb,....}
Department of CSE Module 1 January 7, 2022 52/120
 Formal Grammar

Minimization of Finite Automata

Equivalence: Two states q1 and q2 are equivalent(denoted by
q1 ≡ q2 ), if both δ(q1 , x) and δ(q2 , x) are final states or both
of them are non-final states for all x ∈ Σ∗.

Department of CSE Module 1 January 7, 2022 53/120

 Formal Grammar

Minimization of Finite Automata

Equivalence: Two states q1 and q2 are equivalent(denoted by
q1 ≡ q2 ), if both δ(q1 , x) and δ(q2 , x) are final states or both
of them are non-final states for all x ∈ Σ∗.
Precisely, Two states q1 and q2 are k-equivalent (k ≥ 0), if
both δ(q1 , x) and δ(q2 , x) are final states or both non-final
states for all string x of length K or less.

Department of CSE Module 1 January 7, 2022 53/120

 Formal Grammar

Minimization of Finite Automata

Equivalence: Two states q1 and q2 are equivalent(denoted by
q1 ≡ q2 ), if both δ(q1 , x) and δ(q2 , x) are final states or both
of them are non-final states for all x ∈ Σ∗.
Precisely, Two states q1 and q2 are k-equivalent (k ≥ 0), if
both δ(q1 , x) and δ(q2 , x) are final states or both non-final
states for all string x of length K or less.
If δ(q1 , w ) and δ(q2 , w ) are equivalent then
for |w |= 0, the states are 0-equivalent.
for |w |= 1, the states are 1-equivalent.
for |w |= 2, the states are 2-equivalent.
.
..
for |w |= n, the states are n-equivalent.

Department of CSE Module 1 January 7, 2022 53/120

 Formal Grammar

Minimization of Finite Automata

Equivalence: Two states q1 and q2 are equivalent(denoted by
q1 ≡ q2 ), if both δ(q1 , x) and δ(q2 , x) are final states or both
of them are non-final states for all x ∈ Σ∗.
Precisely, Two states q1 and q2 are k-equivalent (k ≥ 0), if
both δ(q1 , x) and δ(q2 , x) are final states or both non-final
states for all string x of length K or less.
If δ(q1 , w ) and δ(q2 , w ) are equivalent then
for |w |= 0, the states are 0-equivalent.
for |w |= 1, the states are 1-equivalent.
for |w |= 2, the states are 2-equivalent.
.
..
for |w |= n, the states are n-equivalent.
Properties of Equivalence relations:
If a relation is equivalence or k-equivalence, then they are reflexive,
symmetric and transitive.
If q1 and q2 are k-equivalent for all k ≥ 0, then they are equivalent.
If q1 and q2 are (k+1)-equivalent, then they are k-equivalent.
πn =πN+1 for some n
Department of CSE Module 1 January 7, 2022 53/120
 Formal Grammar

Minimization of Finite Automata I

Construct a minimum state automaton equivalent to the given
finite automaton

Solution:
1 Delete all non-reachable states.
2 Draw transition table
State \Σ 0 1
→ q0 q1 q5

O
q1 q6 q2
q2 q0 q2
q3 q2 q6
q4 q7 q5
q5 q2 q6
q6 q6 q4
q7 q6 q2

Department of CSE Module 1 January 7, 2022 54/120

 Formal Grammar

Minimization of Finite Automata II

3 Find 0-equivalent set
π0 =[q0 , q1 , q3 , q4 , q5 , q6 , q7 ][q2 ]
4 Find 1-equivalent set
π1 =[q0 , q6 , q4 ][q1 , q7 ][q5 , q3 ][q2 ]
5 find 2-equivalent set
π2 =[q0 , q4 ][q6 ][q2 ][q1 , q7 ][q3 , q5 ]
6 find 3-equivalent set
π3 =[q0 , q4 ][q6 ][q2 ][q1 , q7 ][q3 , q5 ]
Therefore, M’=(Q’,0,1,δ,q00 ,F’)
where Q’={[q2 ],[q0 , q4 ],[q6 ],[q1 , q7 ],[q3 , q5 ]}
q00 =[q0 , q4 ], F’=[q2 ]
State \Σ 0 1
[q0 , q4 ] [q1 , q7 ] [q3 , q5 ]
[q1 , q7 ] [q6 ] [q2 ]
[q2 ] [q0 , q4 ] [q2 ]
[q3 , q5 ] [q2 ] [q6 ]
[q6 ] [q6 ] [q0 , q4 ]
Department of CSE Module 1 January 7, 2022 55/120
 Formal Grammar

Minimization of Finite Automata I

Construct a minimum state automaton equivalent to the given
finite automaton

Solution:
State \Σ a b
→ q0 q1 q0
q1 q0 q2

O
q2 q3 q1
q3 q3 q0
q4 q3 q5
q5 q6 q4
q6 q5 q6
q7 q6 q3

Department of CSE Module 1 January 7, 2022 56/120

 Formal Grammar

Minimization of Finite Automata II

π0 ={{q3 }{q0 , q1 , q2 , q4 , q5 , q6 , q7 }}
π1 ={{q3 }{q0 , q1 , q5 , q6 }{q2 , q4 },{q7 }}
π2 ={{q3 }{q0 , q6 }{q1 , q5 }{q2 , q4 }{q7 }}
π3 ={{q3 }{q0 , q6 }{q1 , q5 }{q2 , q4 }{q7 }}
∴ Q’= {{q3 }{q0 , q6 }{q1 , q5 }{q2 , q4 }{q7 }}
q00 ={q0 , q6 }
F’={q3 }
Now, make δ 0 and transition diagram.

Department of CSE Module 1 January 7, 2022 57/120

 Formal Grammar

Minimization of Finite Automata

Construct minimum state automaton equivalent to given

automata M:
State \Σ a b
→ q0 q0 q3
q1 q2 q5
q2 q3 q4
q3 q0 q5
q4 q0 q6

O
q5 q1 q4
q6 q1 q3

Department of CSE Module 1 January 7, 2022 58/120

 Formal Grammar

GRAMMAR
A grammar is (VN ,Σ, P,S)
where VN is a non-empty set whose elements are called
variables.
Σ finite non-empty set whose elements are called terminals.
S is aspecial symbol called Start Symbol.
P are set of Production rules.
VN ∩ Σ 6= 0

Department of CSE Module 1 January 7, 2022 59/120

 Formal Grammar

GRAMMAR
A grammar is (VN ,Σ, P,S)
where VN is a non-empty set whose elements are called
variables.
Σ finite non-empty set whose elements are called terminals.
S is aspecial symbol called Start Symbol.
P are set of Production rules.
VN ∩ Σ 6= 0
Example
G={VN , Σ, P, S} is a Grammar, where
VN ={<sentence>, <noun>, <verb>, <adverb>}, Σ={Ram,Sam,ran,sang,fast},
S=<sentence>
P consists of following productions:
<sentence>→<noun>, <verb>
<sentence>→<noun>, <verb>, <adverb>
<noun>→ Ram
<noun>→ Sam
<verb>→ ran
<verb>→ sang
<adverb>→ fast

Department of CSE Module 1 January 7, 2022 59/120

 Formal Grammar

Grammar
If G=({S},{0,1},{S→ 0S1,S→ ∧},S). Find L(G).

Department of CSE Module 1 January 7, 2022 60/120

 Formal Grammar

Grammar
If G=({S},{0,1},{S→ 0S1,S→ ∧},S). Find L(G).
Solution: S→0S1 → 00S11 → 000S111.....0n S1n
0n ∧1n = 0n 1n ∈ L(G) for n ≥ 0
∴ L(G)={0n 1n |n ≥ 0}

Department of CSE Module 1 January 7, 2022 60/120

 Formal Grammar

Grammar
If G=({S},{0,1},{S→ 0S1,S→ ∧},S). Find L(G).
Solution: S→0S1 → 00S11 → 000S111.....0n S1n
0n ∧1n = 0n 1n ∈ L(G) for n ≥ 0
∴ L(G)={0n 1n |n ≥ 0}
If G=({S},{a},{S → SS},S), Find the language generated by
G.

Department of CSE Module 1 January 7, 2022 60/120

 Formal Grammar

Grammar
If G=({S},{0,1},{S→ 0S1,S→ ∧},S). Find L(G).
Solution: S→0S1 → 00S11 → 000S111.....0n S1n
0n ∧1n = 0n 1n ∈ L(G) for n ≥ 0
∴ L(G)={0n 1n |n ≥ 0}
If G=({S},{a},{S → SS},S), Find the language generated by
G.
Solution: L(G)=φ

Department of CSE Module 1 January 7, 2022 60/120

 Formal Grammar

Grammar
If G=({S},{0,1},{S→ 0S1,S→ ∧},S). Find L(G).
Solution: S→0S1 → 00S11 → 000S111.....0n S1n
0n ∧1n = 0n 1n ∈ L(G) for n ≥ 0
∴ L(G)={0n 1n |n ≥ 0}
If G=({S},{a},{S → SS},S), Find the language generated by
G.
Solution: L(G)=φ
Let G=({S,C},{a,b},P,S), where P consists of S
→ aCa, C → aCa |b. Find L(G).

Department of CSE Module 1 January 7, 2022 60/120

 Formal Grammar

Grammar
If G=({S},{0,1},{S→ 0S1,S→ ∧},S). Find L(G).
Solution: S→0S1 → 00S11 → 000S111.....0n S1n
0n ∧1n = 0n 1n ∈ L(G) for n ≥ 0
∴ L(G)={0n 1n |n ≥ 0}
If G=({S},{a},{S → SS},S), Find the language generated by
G.
Solution: L(G)=φ
Let G=({S,C},{a,b},P,S), where P consists of S
→ aCa, C → aCa |b. Find L(G).
Solution: S =⇒ aCa =⇒ aba . So, aba ∈ L(G)

Department of CSE Module 1 January 7, 2022 60/120

 Formal Grammar

Grammar
If G=({S},{0,1},{S→ 0S1,S→ ∧},S). Find L(G).
Solution: S→0S1 → 00S11 → 000S111.....0n S1n
0n ∧1n = 0n 1n ∈ L(G) for n ≥ 0
∴ L(G)={0n 1n |n ≥ 0}
If G=({S},{a},{S → SS},S), Find the language generated by
G.
Solution: L(G)=φ
Let G=({S,C},{a,b},P,S), where P consists of S
→ aCa, C → aCa |b. Find L(G).
Solution: S =⇒ aCa =⇒ aba . So, aba ∈ L(G)
S =⇒ aCa (using S→ aCa)
n
=⇒ a Ca n (using S→ aCa (n-1) times)

Department of CSE Module 1 January 7, 2022 60/120

 Formal Grammar

Grammar
If G=({S},{0,1},{S→ 0S1,S→ ∧},S). Find L(G).
Solution: S→0S1 → 00S11 → 000S111.....0n S1n
0n ∧1n = 0n 1n ∈ L(G) for n ≥ 0
∴ L(G)={0n 1n |n ≥ 0}
If G=({S},{a},{S → SS},S), Find the language generated by
G.
Solution: L(G)=φ
Let G=({S,C},{a,b},P,S), where P consists of S
→ aCa, C → aCa |b. Find L(G).
Solution: S =⇒ aCa =⇒ aba . So, aba ∈ L(G)
S =⇒ aCa (using S→ aCa)
n
=⇒ a Ca n (using S→ aCa (n-1) times)
=⇒ an ban (using C → b)
Hence, an ban ∈ L(G), where n≥ 1
∴ L(G)={an ban |n ≥ 1}

Department of CSE Module 1 January 7, 2022 60/120

 Formal Grammar

Grammar
Exercise
Construct a grammar G so that L(G) = {an bam |n, m ≥ 1}

Department of CSE Module 1 January 7, 2022 61/120

 Formal Grammar

Grammar
Exercise
Construct a grammar G so that L(G) = {an bam |n, m ≥ 1}

If G is S → aS |bS |a |b, Find L(G).

Department of CSE Module 1 January 7, 2022 61/120

 Formal Grammar

Grammar
Exercise
Construct a grammar G so that L(G) = {an bam |n, m ≥ 1}

If G is S → aS |bS |a |b, Find L(G).

Solution: L(G)={a, b}+

Department of CSE Module 1 January 7, 2022 61/120

 Formal Grammar

Grammar
Exercise
Construct a grammar G so that L(G) = {an bam |n, m ≥ 1}

If G is S → aS |bS |a |b, Find L(G).

Solution: L(G)={a, b}+
Exercise 1
If G is S → aS |a, then show that L(G)={a}+

Department of CSE Module 1 January 7, 2022 61/120

 Formal Grammar

Grammar
Exercise
Construct a grammar G so that L(G) = {an bam |n, m ≥ 1}

If G is S → aS |bS |a |b, Find L(G).

Solution: L(G)={a, b}+
Exercise 1
If G is S → aS |a, then show that L(G)={a}+

Let L be the set of all palindromes over {a,b}. Construct a

grammar G generating L.

Department of CSE Module 1 January 7, 2022 61/120

 Formal Grammar

Grammar
Exercise
Construct a grammar G so that L(G) = {an bam |n, m ≥ 1}

If G is S → aS |bS |a |b, Find L(G).

Solution: L(G)={a, b}+
Exercise 1
If G is S → aS |a, then show that L(G)={a}+

Let L be the set of all palindromes over {a,b}. Construct a

grammar G generating L.
Solution: ∧, a, b, or axa and bxb are palindromes.

Department of CSE Module 1 January 7, 2022 61/120

 Formal Grammar

Grammar
Exercise
Construct a grammar G so that L(G) = {an bam |n, m ≥ 1}

If G is S → aS |bS |a |b, Find L(G).

Solution: L(G)={a, b}+
Exercise 1
If G is S → aS |a, then show that L(G)={a}+

Let L be the set of all palindromes over {a,b}. Construct a

grammar G generating L.
Solution: ∧, a, b, or axa and bxb are palindromes.
∴ P consists of
S→∧
S → a, S → b
S → aSa, S → bSb
Thus, G=({S},{a,b},P,S)
Department of CSE Module 1 January 7, 2022 61/120
 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Solution: Let G=({S},{a,b,c},P,S)
where P is defined as
S → aSa |bSb |c

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Solution: Let G=({S},{a,b,c},P,S)
where P is defined as
S → aSa |bSb |c
Find a grammar generating L={an b n c i |n ≥ 1, i ≥ 0}

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Solution: Let G=({S},{a,b,c},P,S)
where P is defined as
S → aSa |bSb |c
Find a grammar generating L={an b n c i |n ≥ 1, i ≥ 0}
Solution: L=L1 ∪ L2 , L1 ={an bn |n ≥ 1}

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Solution: Let G=({S},{a,b,c},P,S)
where P is defined as
S → aSa |bSb |c
Find a grammar generating L={an b n c i |n ≥ 1, i ≥ 0}
Solution: L=L1 ∪ L2 , L1 ={an bn |n ≥ 1}
L2 ={an b n c i |n ≥ 1, i ≥ 1}

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Solution: Let G=({S},{a,b,c},P,S)
where P is defined as
S → aSa |bSb |c
Find a grammar generating L={an b n c i |n ≥ 1, i ≥ 0}
Solution: L=L1 ∪ L2 , L1 ={an bn |n ≥ 1}
L2 ={an b n c i |n ≥ 1, i ≥ 1}
Let ”P” be as follows:
S→A
A → ab |aAb

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Solution: Let G=({S},{a,b,c},P,S)
where P is defined as
S → aSa |bSb |c
Find a grammar generating L={an b n c i |n ≥ 1, i ≥ 0}
Solution: L=L1 ∪ L2 , L1 ={an bn |n ≥ 1}
L2 ={an b n c i |n ≥ 1, i ≥ 1}
Let ”P” be as follows:
S→A
A → ab |aAb
S → Sc

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Solution: Let G=({S},{a,b,c},P,S)
where P is defined as
S → aSa |bSb |c
Find a grammar generating L={an b n c i |n ≥ 1, i ≥ 0}
Solution: L=L1 ∪ L2 , L1 ={an bn |n ≥ 1}
L2 ={an b n c i |n ≥ 1, i ≥ 1}
Let ”P” be as follows:
S→A
A → ab |aAb
S → Sc
Let G=({S,A}, {a,b,c}, P,S) for n ≥ 1, i ≥ 0

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Solution: Let G=({S},{a,b,c},P,S)
where P is defined as
S → aSa |bSb |c
Find a grammar generating L={an b n c i |n ≥ 1, i ≥ 0}
Solution: L=L1 ∪ L2 , L1 ={an bn |n ≥ 1}
L2 ={an b n c i |n ≥ 1, i ≥ 1}
Let ”P” be as follows:
S→A
A → ab |aAb
S → Sc
Let G=({S,A}, {a,b,c}, P,S) for n ≥ 1, i ≥ 0
∗
S→− Sc i → Ac i → an−1 Ab n−1 c i → an−1 abb n−1 c i = an b n c i

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar

Construct a Grammar generating L={wcw T |w ∈ {a, b}∗ }

Solution: Let G=({S},{a,b,c},P,S)
where P is defined as
S → aSa |bSb |c
Find a grammar generating L={an b n c i |n ≥ 1, i ≥ 0}
Solution: L=L1 ∪ L2 , L1 ={an bn |n ≥ 1}
L2 ={an b n c i |n ≥ 1, i ≥ 1}
Let ”P” be as follows:
S→A
A → ab |aAb
S → Sc
Let G=({S,A}, {a,b,c}, P,S) for n ≥ 1, i ≥ 0
∗
S→− Sc i → Ac i → an−1 Ab n−1 c i → an−1 abb n−1 c i = an b n c i
L(G)={an b n c i |n ≥ 1, i ≥ 0}

Department of CSE Module 1 January 7, 2022 62/120

 Formal Grammar

Grammar
Find a grammar generating
{aj b n c n |n ≥ 1, j ≥ 0 }

Department of CSE Module 1 January 7, 2022 63/120

 Formal Grammar

Grammar
Find a grammar generating
{aj b n c n |n ≥ 1, j ≥ 0 }
Solution: Let G=({S,A},{a,b,c},P,S)
where ”P” consists of:
S → aS |A
A → bAc |bc

Department of CSE Module 1 January 7, 2022 63/120

 Formal Grammar

Grammar
Find a grammar generating
{aj b n c n |n ≥ 1, j ≥ 0 }
Solution: Let G=({S,A},{a,b,c},P,S)
where ”P” consists of:
S → aS |A
A → bAc |bc
Let G =({S,A},{0,1,2},P,S) where P consists of
S → 0SA2 |S → 012
2A → A2
1A → 11. Show that L(G)={0n 1n 2n |n ≥ 1}
∗
− 0n−1 S(A2)n−1 by applying S → 0SA2 (n-1)
Solution: S →
times

Department of CSE Module 1 January 7, 2022 63/120

 Formal Grammar

Grammar
Find a grammar generating
{aj b n c n |n ≥ 1, j ≥ 0 }
Solution: Let G=({S,A},{a,b,c},P,S)
where ”P” consists of:
S → aS |A
A → bAc |bc
Let G =({S,A},{0,1,2},P,S) where P consists of
S → 0SA2 |S → 012
2A → A2
1A → 11. Show that L(G)={0n 1n 2n |n ≥ 1}
∗
− 0n−1 S(A2)n−1 by applying S → 0SA2 (n-1)
Solution: S →
times
→ 0n 12(A2)n−1 by applying S → 012

Department of CSE Module 1 January 7, 2022 63/120

 Formal Grammar

Grammar
Find a grammar generating
{aj b n c n |n ≥ 1, j ≥ 0 }
Solution: Let G=({S,A},{a,b,c},P,S)
where ”P” consists of:
S → aS |A
A → bAc |bc
Let G =({S,A},{0,1,2},P,S) where P consists of
S → 0SA2 |S → 012
2A → A2
1A → 11. Show that L(G)={0n 1n 2n |n ≥ 1}
∗
− 0n−1 S(A2)n−1 by applying S → 0SA2 (n-1)
Solution: S →
times
→ 0n 12(A2)n−1 by applying S → 012
∗
− 0n 1An−1 2n by applying 2A → A2 several times
→

Department of CSE Module 1 January 7, 2022 63/120

 Formal Grammar

Grammar
Find a grammar generating
{aj b n c n |n ≥ 1, j ≥ 0 }
Solution: Let G=({S,A},{a,b,c},P,S)
where ”P” consists of:
S → aS |A
A → bAc |bc
Let G =({S,A},{0,1,2},P,S) where P consists of
S → 0SA2 |S → 012
2A → A2
1A → 11. Show that L(G)={0n 1n 2n |n ≥ 1}
∗
Solution: S →− 0n−1 S(A2)n−1 by applying S → 0SA2 (n-1)
times
→ 0n 12(A2)n−1 by applying S → 012
∗
− 0n 1An−1 2n by applying 2A → A2 several times
→
∗
− 0n 1n 2n by applying 1A → 11 (n-1 times)
→

Department of CSE Module 1 January 7, 2022 63/120

 Formal Grammar

Grammar
Find a grammar generating
{aj b n c n |n ≥ 1, j ≥ 0 }
Solution: Let G=({S,A},{a,b,c},P,S)
where ”P” consists of:
S → aS |A
A → bAc |bc
Let G =({S,A},{0,1,2},P,S) where P consists of
S → 0SA2 |S → 012
2A → A2
1A → 11. Show that L(G)={0n 1n 2n |n ≥ 1}
∗
Solution: S → − 0n−1 S(A2)n−1 by applying S → 0SA2 (n-1)
times
→ 0n 12(A2)n−1 by applying S → 012
∗
− 0n 1An−1 2n by applying 2A → A2 several times
→
∗
− 0n 1n 2n by applying 1A → 11 (n-1 times)
→
∴ 0n 1n 2n ∈ L(G) for all n ≥ 1
Department of CSE Module 1 January 7, 2022 63/120
 Formal Grammar

Grammar

Construct grammar G generating {an b n c n |n ≥ 1}

Department of CSE Module 1 January 7, 2022 64/120

 Formal Grammar

Grammar

Construct grammar G generating {an b n c n |n ≥ 1}

Solution: G=({S,B,C},{a,b,c},P,S)
where P consists of: S → aSBC |aBC, CB → BC, aB → ab,
bB → bb, bC → bc, cC → cc
S =⇒ aBC =⇒ abC =⇒ abc

Department of CSE Module 1 January 7, 2022 64/120

 Formal Grammar

Grammar

Construct grammar G generating {an b n c n |n ≥ 1}

Solution: G=({S,B,C},{a,b,c},P,S)
where P consists of: S → aSBC |aBC, CB → BC, aB → ab,
bB → bb, bC → bc, cC → cc
S =⇒ aBC =⇒ abC =⇒ abc
Construct a grammar G generating {xx |x ∈ {a, b}∗ }

Department of CSE Module 1 January 7, 2022 64/120

 Formal Grammar

Grammar

Construct grammar G generating {an b n c n |n ≥ 1}

Solution: G=({S,B,C},{a,b,c},P,S)
where P consists of: S → aSBC |aBC, CB → BC, aB → ab,
bB → bb, bC → bc, cC → cc
S =⇒ aBC =⇒ abC =⇒ abc
Construct a grammar G generating {xx |x ∈ {a, b}∗ }
Solution: Let G is as follows: G=({S,D,E,F,A,B},{a,b},P,S)
where P consists of :
S → DEF
DE → aDA, DE → bDB
AF → EaF, BF → EbF
Aa → aA, Ab → bA, Ba → aB, Bb→bB
aE → Ea, bE→ Eb
DE → ∧, F → ∧

Department of CSE Module 1 January 7, 2022 64/120

 Formal Grammar

Grammar
Let G=({S,A,B},{a,b},P,S) where P consists of
S → aABa, A → baABb, B → Aab, aA → baa, bBb → abab.
Test whether w = baabbabaaabbaba is in L(G).

Department of CSE Module 1 January 7, 2022 65/120

 Formal Grammar

Grammar
Let G=({S,A,B},{a,b},P,S) where P consists of
S → aABa, A → baABb, B → Aab, aA → baa, bBb → abab.
Test whether w = baabbabaaabbaba is in L(G).
Solution: S→ aABa
=⇒ baaBa
=⇒ baaAaba
=⇒ baabaABbaba
=⇒ baabbaaBbaba
=⇒ baabbaaAabbaba
=⇒ baabbabaaabbaba=w
∴ w ∈ L(G)

Department of CSE Module 1 January 7, 2022 65/120

 Formal Grammar

Grammar
Let G=({S,A,B},{a,b},P,S) where P consists of
S → aABa, A → baABb, B → Aab, aA → baa, bBb → abab.
Test whether w = baabbabaaabbaba is in L(G).
Solution: S→ aABa
=⇒ baaBa
=⇒ baaAaba
=⇒ baabaABbaba
=⇒ baabbaaBbaba
=⇒ baabbaaAabbaba
=⇒ baabbabaaabbaba=w
∴ w ∈ L(G)
If the grammar G is given by the productions S → aSa |bSb
|aa |bb |∧, show that:
L(G) has no strings of odd length
Any string in L(G) is of length 2n, n ≥ 0
the number of strings of length 2n is 2n

Department of CSE Module 1 January 7, 2022 65/120

 Chomsky Hierarchy

Chomsky Classification of Languages

Chomsky classified grammar into 4 types i.e. (type 0-3)

A type 0 grammar is any phrase structure grammar without
any restrictions
=⇒ All grammar we have considered till now are type 0
grammar
In a production of form φA ψ → φαψ
Example:
In abAbcd → ab ABbcd
AC → A
α =⇒ ∧
C→∧
α =⇒ ∧

Department of CSE Module 1 January 7, 2022 66/120

 Chomsky Hierarchy

Chomsky Classification of Languages

A production of the form φA ψ → φαψ is called Type-1
production or Context-sensitive Language, if α 6= ∧
=⇒ In type-1 production erasing ’A’ is not allowed

Department of CSE Module 1 January 7, 2022 67/120

 Chomsky Hierarchy

Chomsky Classification of Languages

A production of the form φA ψ → φαψ is called Type-1
production or Context-sensitive Language, if α 6= ∧
=⇒ In type-1 production erasing ’A’ is not allowed
Example:
aAbCD → abcDbcD is a type 1 production.
A is replaced by bcD 6= ∧
AB → AbBc is a type 1 production.
A → abA is a type 1 production.
A grammar is called type 1 or Context sensitive or
Context-dependent if all its productions are type 1
productions.

Department of CSE Module 1 January 7, 2022 67/120

 Chomsky Hierarchy

Chomsky Classification of Languages

A production of the form φA ψ → φαψ is called Type-1
production or Context-sensitive Language, if α 6= ∧
=⇒ In type-1 production erasing ’A’ is not allowed
Example:
aAbCD → abcDbcD is a type 1 production.
A is replaced by bcD 6= ∧
AB → AbBc is a type 1 production.
A → abA is a type 1 production.
A grammar is called type 1 or Context sensitive or
Context-dependent if all its productions are type 1
productions.
The production S → ∧ is also allowed in type 1 grammar, but
in this case S does not appear on the right-hand side of any
production.

Department of CSE Module 1 January 7, 2022 67/120

 Chomsky Hierarchy

Chomsky Classification of Languages

A production of the form φA ψ → φαψ is called Type-1
production or Context-sensitive Language, if α 6= ∧
=⇒ In type-1 production erasing ’A’ is not allowed
Example:
aAbCD → abcDbcD is a type 1 production.
A is replaced by bcD 6= ∧
AB → AbBc is a type 1 production.
A → abA is a type 1 production.
A grammar is called type 1 or Context sensitive or
Context-dependent if all its productions are type 1
productions.
The production S → ∧ is also allowed in type 1 grammar, but
in this case S does not appear on the right-hand side of any
production.
The language generated by a type-1 grammar is called a
type-1 or context-sensitive language
Department of CSE Module 1 January 7, 2022 67/120
 Chomsky Hierarchy

Chomsky Classification of Languages

A grammar G= (VN , Σ,P,S) is monotonic (or

length-increasing) if every production in P is of the form
α → β with |α |≤ |β |or S → ∧. In second case, S does not
appear on right-hand side of any production in P.

Department of CSE Module 1 January 7, 2022 68/120

 Chomsky Hierarchy

Chomsky Classification of Languages

A grammar G= (VN , Σ,P,S) is monotonic (or

length-increasing) if every production in P is of the form
α → β with |α |≤ |β |or S → ∧. In second case, S does not
appear on right-hand side of any production in P.
Type-2: Context free Grammar generates context free
language
A Type-2 production is a production of the form A → α
where A ∈ VN and α ∈ (VN ∨ Σ)∗

Department of CSE Module 1 January 7, 2022 68/120

 Chomsky Hierarchy

Chomsky Classification of Languages

A grammar G= (VN , Σ,P,S) is monotonic (or

length-increasing) if every production in P is of the form
α → β with |α |≤ |β |or S → ∧. In second case, S does not
appear on right-hand side of any production in P.
Type-2: Context free Grammar generates context free
language
A Type-2 production is a production of the form A → α
where A ∈ VN and α ∈ (VN ∨ Σ)∗
In other words, in Type-2 =⇒
It should be in Type-1
L.H.S. production should have only 1 variable i.e. |α |= 1 and there
is no restriction on β
Example: S → Aa, A →a, B → abc, A → ∧ are type-2 productions.

Department of CSE Module 1 January 7, 2022 68/120

 Chomsky Hierarchy

Chomsky Classification of Languages

A production of the form A → a or A → aB, where A,B ∈ VN

and a∈ Σ is called a type-3 production.
A grammar is called a type-3 or Regular Grammar if all its
productions are type-3 productions.
A production s → ∧ is allowed in type-3 grammar, but in this
case S does not appear on the right-hand side of any
production

Department of CSE Module 1 January 7, 2022 69/120

 Chomsky Hierarchy

Chomsky Classification of Languages I

1 Find the highest type number which can be applied to the
following productions:
S → Aa, A → c |Ba, B → abc
S → ASB |d, A → aA
S → aS |ab
2 Differentiate between Recursive Set and Recursively
Enumerable Set
3 Prove that Context-sensitive language is recursive.
4 Prove that there exists a recursive set which is not a
contxt-sensitive language over {0,1}.
5 Let G=({A,B,S},{0,1},P.S) where P consists of S → 0AB, A0
→ S0B, A1 →SB1, B →SA, B →01. Show that L(G)= φ.
6 Find the language generated by grammar S → AB, A →A1 |0,
B → 2B |3. Can the above language be generated by a
grammar of higher type?

Department of CSE Module 1 January 7, 2022 70/120

 Chomsky Hierarchy

Chomsky Classification of Languages II

7 Construct a grammar which generates all even integer upto
998.
8 Construct CFG to generate the following:
{0m 1n |m6=n, m,n ≥1}
{al b m c n |one of l,m,n equals 1 and remaining tqo are equal}
{al b m c n |l+m=n}
The set of all strings over {0,1} containing twice as many 0’s and
1’s
9 Show that G1 =({S},{a,b},P1 ,S) where P1 ={S → aSb |ab} is
equivalent to G2 =({S,A,B,C},{a,b},P2 ,S), where P2 consists
of S →AC, C→SB, S →AB, A→a,B →b
10 What are the applications of different grammar types?

Department of CSE Module 1 January 7, 2022 71/120

 Regular Expression

Regular Expression

A language is regular if there exists a finite acceptor for it

∴ Every regular language can be described as DFA or NDFA

Department of CSE Module 1 January 7, 2022 72/120

 Regular Expression

Regular Expression

A language is regular if there exists a finite acceptor for it

∴ Every regular language can be described as DFA or NDFA
Regular Expression: Algebraic decription of languages

Department of CSE Module 1 January 7, 2022 72/120

 Regular Expression

Regular Expression

A language is regular if there exists a finite acceptor for it

∴ Every regular language can be described as DFA or NDFA
Regular Expression: Algebraic decription of languages
Let Σ be a given alphabet, then:
1 φ, λ and a ∈ Σ are all regular expressions, called Primitive regular
expressions.
2 If r1 and r2 are regular expressions, so are r1 + r2 ,r1 .r2 ,r1 ∗ and (r1 )
3 A string is a regular expression if and only if it can be derived from
primitive regular expressions by a finite number of applications of
the rules in (2)

Department of CSE Module 1 January 7, 2022 72/120

 Regular Expression

Regular Expression

A language is regular if there exists a finite acceptor for it

∴ Every regular language can be described as DFA or NDFA
Regular Expression: Algebraic decription of languages
Let Σ be a given alphabet, then:
1 φ, λ and a ∈ Σ are all regular expressions, called Primitive regular
expressions.
2 If r1 and r2 are regular expressions, so are r1 + r2 ,r1 .r2 ,r1 ∗ and (r1 )
3 A string is a regular expression if and only if it can be derived from
primitive regular expressions by a finite number of applications of
the rules in (2)
Example: For Σ={a,b,c}, the string (a + b.c)∗ .(c + φ) is a
regular expression
while (a+b+) is not a regular expression.

Department of CSE Module 1 January 7, 2022 72/120

 Regular Expression

Language Associated with Regular Expression

The language l(r) denoted by any regular expression ’r’ is defined
by following rules
1 φ is a R.E. denoting empty set
2 λ is a R.E. denoting {λ}
3 For every a ∈ Σ, a is a R.E. denoting {a}
If r1 and r2 are R.E. , then
4 L(r1 +r2 )=L(r1 )∨L(r2 )
5 L(r1 .r2 )=L(r1 )L(r2 )
6 L((r1 ))=L(r1 )
7 L(r1∗ )=(L(r1 ))∗

Department of CSE Module 1 January 7, 2022 73/120

 Regular Expression

Language Associated with Regular Expression

The language l(r) denoted by any regular expression ’r’ is defined
by following rules
1 φ is a R.E. denoting empty set
2 λ is a R.E. denoting {λ}
3 For every a ∈ Σ, a is a R.E. denoting {a}
If r1 and r2 are R.E. , then
4 L(r1 +r2 )=L(r1 )∨L(r2 )
5 L(r1 .r2 )=L(r1 )L(r2 )
6 L((r1 ))=L(r1 )
7 L(r1∗ )=(L(r1 ))∗
Example: For Σ={a,b}, the expression
r=(a + b)∗ (a+bb) is regular

Department of CSE Module 1 January 7, 2022 73/120

 Regular Expression

Language Associated with Regular Expression

The language l(r) denoted by any regular expression ’r’ is defined
by following rules
1 φ is a R.E. denoting empty set
2 λ is a R.E. denoting {λ}
3 For every a ∈ Σ, a is a R.E. denoting {a}
If r1 and r2 are R.E. , then
4 L(r1 +r2 )=L(r1 )∨L(r2 )
5 L(r1 .r2 )=L(r1 )L(r2 )
6 L((r1 ))=L(r1 )
7 L(r1∗ )=(L(r1 ))∗
Example: For Σ={a,b}, the expression
r=(a + b)∗ (a+bb) is regular
=⇒ L(r)={a,bb,aa,abb,ba,bbb,....}

Department of CSE Module 1 January 7, 2022 73/120

 Regular Expression

Language Associated with Regular Expression

The language l(r) denoted by any regular expression ’r’ is defined
by following rules
1 φ is a R.E. denoting empty set
2 λ is a R.E. denoting {λ}
3 For every a ∈ Σ, a is a R.E. denoting {a}
If r1 and r2 are R.E. , then
4 L(r1 +r2 )=L(r1 )∨L(r2 )
5 L(r1 .r2 )=L(r1 )L(r2 )
6 L((r1 ))=L(r1 )
7 L(r1∗ )=(L(r1 ))∗
Example: For Σ={a,b}, the expression
r=(a + b)∗ (a+bb) is regular
=⇒ L(r)={a,bb,aa,abb,ba,bbb,....}
=⇒ L(r) is the set of all strings on {a,b}, terminated by either ’a’
or ’bb’.
Department of CSE Module 1 January 7, 2022 73/120
 Regular Expression

Language Associated with Regular Expression

r=(aa)∗ (bb)∗ b

Department of CSE Module 1 January 7, 2022 74/120

 Regular Expression

Language Associated with Regular Expression

r=(aa)∗ (bb)∗ b
denotes the set of all strings with even number of a’s followed
by an odd number of b’s

Department of CSE Module 1 January 7, 2022 74/120

 Regular Expression

Language Associated with Regular Expression

r=(aa)∗ (bb)∗ b
denotes the set of all strings with even number of a’s followed
by an odd number of b’s
L(r)={a2n b 2m+1 |n≥0, m≥0}

Department of CSE Module 1 January 7, 2022 74/120

 Regular Expression

Language Associated with Regular Expression

r=(aa)∗ (bb)∗ b
denotes the set of all strings with even number of a’s followed
by an odd number of b’s
L(r)={a2n b 2m+1 |n≥0, m≥0}
For Σ ={0,1}. Give a regular expression ’r’ such that
L(r)={w∈ Σ∗ |w has atleast one pair of consequtive zeroes}

Department of CSE Module 1 January 7, 2022 74/120

 Regular Expression

Language Associated with Regular Expression

r=(aa)∗ (bb)∗ b
denotes the set of all strings with even number of a’s followed
by an odd number of b’s
L(r)={a2n b 2m+1 |n≥0, m≥0}
For Σ ={0,1}. Give a regular expression ’r’ such that
L(r)={w∈ Σ∗ |w has atleast one pair of consequtive zeroes}
Solution: r=(0 + 1)∗ 00(0 + 1)∗

Department of CSE Module 1 January 7, 2022 74/120

 Regular Expression

Language Associated with Regular Expression

r=(aa)∗ (bb)∗ b
denotes the set of all strings with even number of a’s followed
by an odd number of b’s
L(r)={a2n b 2m+1 |n≥0, m≥0}
For Σ ={0,1}. Give a regular expression ’r’ such that
L(r)={w∈ Σ∗ |w has atleast one pair of consequtive zeroes}
Solution: r=(0 + 1)∗ 00(0 + 1)∗
Find R.E. for language
L={w ∈ {0, 1}∗ |w has no pair of consecutive zeroes}

Department of CSE Module 1 January 7, 2022 74/120

 Regular Expression

Language Associated with Regular Expression

r=(aa)∗ (bb)∗ b
denotes the set of all strings with even number of a’s followed
by an odd number of b’s
L(r)={a2n b 2m+1 |n≥0, m≥0}
For Σ ={0,1}. Give a regular expression ’r’ such that
L(r)={w∈ Σ∗ |w has atleast one pair of consequtive zeroes}
Solution: r=(0 + 1)∗ 00(0 + 1)∗
Find R.E. for language
L={w ∈ {0, 1}∗ |w has no pair of consecutive zeroes}
Solution: r=(1 + 01)∗ (0 + λ)
r=(1∗ 011∗ )∗ (0 + λ) + 1∗ (0 + λ)

Department of CSE Module 1 January 7, 2022 74/120

 Regular Expression

Language Associated with Regular Expression

r=(aa)∗ (bb)∗ b
denotes the set of all strings with even number of a’s followed
by an odd number of b’s
L(r)={a2n b 2m+1 |n≥0, m≥0}
For Σ ={0,1}. Give a regular expression ’r’ such that
L(r)={w∈ Σ∗ |w has atleast one pair of consequtive zeroes}
Solution: r=(0 + 1)∗ 00(0 + 1)∗
Find R.E. for language
L={w ∈ {0, 1}∗ |w has no pair of consecutive zeroes}
Solution: r=(1 + 01)∗ (0 + λ)
r=(1∗ 011∗ )∗ (0 + λ) + 1∗ (0 + λ)
Find all strings in L((a + b)∗ b(a + ab)∗ ) of length less than 4

Department of CSE Module 1 January 7, 2022 74/120

 Regular Expression

Language Associated with Regular Expression

r=(aa)∗ (bb)∗ b
denotes the set of all strings with even number of a’s followed
by an odd number of b’s
L(r)={a2n b 2m+1 |n≥0, m≥0}
For Σ ={0,1}. Give a regular expression ’r’ such that
L(r)={w∈ Σ∗ |w has atleast one pair of consequtive zeroes}
Solution: r=(0 + 1)∗ 00(0 + 1)∗
Find R.E. for language
L={w ∈ {0, 1}∗ |w has no pair of consecutive zeroes}
Solution: r=(1 + 01)∗ (0 + λ)
r=(1∗ 011∗ )∗ (0 + λ) + 1∗ (0 + λ)
Find all strings in L((a + b)∗ b(a + ab)∗ ) of length less than 4
Find R.E. for set {an b m :(n+m) is even}

Department of CSE Module 1 January 7, 2022 74/120

 Regular Expression

Automata and Regular Expression

Automaton for L(r1 + r2 )

Department of CSE Module 1 January 7, 2022 75/120

 Regular Expression

Automata and Regular Expression

Automaton for L(r1 + r2 )

Automaton for L(r1 .r2 )

Department of CSE Module 1 January 7, 2022 75/120

 Regular Expression

Automata and Regular Expression

Automaton for L(r1 + r2 )

Automaton for L(r1 .r2 )

Automaton for L(r1 ∗ )

Department of CSE Module 1 January 7, 2022 75/120

 Regular Expression

Automata and Regular Expression

Generalized Transition Graph: A transition graph whose edges
are labelled as R.E.

Department of CSE Module 1 January 7, 2022 76/120

 Regular Expression

Automata and Regular Expression

Generalized Transition Graph: A transition graph whose edges
are labelled as R.E.
Example: L(r)=(a∗ + a∗ (a + b)c ∗ )

Department of CSE Module 1 January 7, 2022 76/120

 Regular Expression

Automata and Regular Expression

Generalized Transition Graph: A transition graph whose edges
are labelled as R.E.
Example: L(r)=(a∗ + a∗ (a + b)c ∗ )
Equivalence of Generalized Transition Graph:
Let L be a regular expression. Then, there exists some NFA
that accepts L(r). Consequently, L(r) is a regular language.
Find NDFA which accepts L(r) where r=(a + bb)∗ (ba∗ + λ)

Department of CSE Module 1 January 7, 2022 76/120

 Regular Expression

Automata and Regular Expression

The Strings denoted by such regular expressions are a subset

of the language accepted by GTG, with full language being
the union of all such generated subsets

Department of CSE Module 1 January 7, 2022 77/120

 Regular Expression

Automata and Regular Expression

The Strings denoted by such regular expressions are a subset

of the language accepted by GTG, with full language being
the union of all such generated subsets
Example: The language accepted by the following GTG is

L(a∗ + a∗ (a + b)c∗)
State Elimination method
Arden’s Theorem

Department of CSE Module 1 January 7, 2022 77/120

 Regular Expression

Automata and Regular Expression

State Elimination method

1 Initial State should not have any incoming edge
2 Final State should not have any outgoing edge
3 Only 1 final state
4 Eliminate each non-initial/final vertex one by one

Department of CSE Module 1 January 7, 2022 78/120

 Regular Expression

State Elimination Method

1. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 79/120

 Regular Expression

State Elimination Method

1. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 79/120

 Regular Expression

State Elimination Method

1. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 79/120

 Regular Expression

State Elimination Method

1. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 79/120

 Regular Expression

State Elimination Method

1. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 79/120

 Regular Expression

State Elimination Method

2. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 80/120

 Regular Expression

State Elimination Method

2. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 80/120

 Regular Expression

State Elimination Method

2. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 80/120

 Regular Expression

State Elimination Method

2. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 80/120

 Regular Expression

State Elimination Method

2. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 80/120

 Regular Expression

State Elimination Method

2. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 80/120

 Regular Expression

State Elimination Method

2. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 80/120

 Regular Expression

State Elimination Method

3. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 81/120

 Regular Expression

State Elimination Method

3. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 81/120

 Regular Expression

State Elimination Method

3. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 81/120

 Regular Expression

State Elimination Method

3. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 81/120

 Regular Expression

State Elimination Method

3. Find R.E. for given DFA

Department of CSE Module 1 January 7, 2022 81/120

 Regular Expression

State Elimination Method

1 Find R.E. for the given DFA

Department of CSE Module 1 January 7, 2022 82/120

 Regular Expression

State Elimination Method

1 Find R.E. for the given DFA

2 Find R.E. for the given DFA

Department of CSE Module 1 January 7, 2022 82/120

 Regular Expression

Identities for Regular Expression

1 φ+R=R
2 φR = R φ = φ
3 ΛR = RΛ =R
4 Λ∗ = Λ and φ∗ = Λ
5 R+R=R
6 R ∗R ∗ = R ∗
7 RR ∗ = R ∗ R
8 (R ∗ )∗ = R ∗
9 Λ + RR ∗ = R ∗ = Λ + R ∗ R
10 (PQ)∗ P = P(QP)∗
11 (P + Q)∗ = (P ∗ Q ∗ )∗ =(P ∗ + Q ∗ )∗
12 (P+Q)R = PR + QR and R(P+Q) = RP + RQ

Department of CSE Module 1 January 7, 2022 83/120

 Regular Expression

-NFA
=⇒ Moving without reading a symbol from Input Tape.

Department of CSE Module 1 January 7, 2022 84/120

 Regular Expression

-NFA
=⇒ Moving without reading a symbol from Input Tape.

State/Input 0 1 
A B,C A B
B - B C
C C C -

Department of CSE Module 1 January 7, 2022 84/120

 Regular Expression

-NFA
=⇒ Moving without reading a symbol from Input Tape.

State/Input 0 1 
A B,C A B
B - B C
C C C -

Epsilon Closure
-closure for a given state X is a set of States which can be
reached from states X with only (null) or  moves including the
state X itself.

Department of CSE Module 1 January 7, 2022 84/120

 Regular Expression

-NFA
=⇒ Moving without reading a symbol from Input Tape.

State/Input 0 1 
A B,C A B
B - B C
C C C -

Epsilon Closure
-closure for a given state X is a set of States which can be
reached from states X with only (null) or  moves including the
state X itself.
Example:  closure (A)={A,B,C}
 closure (B)={B,C}
 closure (C)={C}
Department of CSE Module 1 January 7, 2022 84/120
 Regular Expression

Conversion of NFA with  to DFA

Steps:
1 Take  closure of initial state as begining state
2 Find states that can be traversed from present from present
state for each input symbol
3 If any new state is found, repeat step 2 till we get no new
state in the transition table.
4 Mark states containing final states as new final state.

State/Input 0 1
{A,B,C} {B,C} {A,B,C}

Department of CSE Module 1 January 7, 2022 85/120

 Regular Expression

Conversion of NFA with  to DFA

Steps:
1 Take  closure of initial state as begining state
2 Find states that can be traversed from present from present
state for each input symbol
3 If any new state is found, repeat step 2 till we get no new
state in the transition table.
4 Mark states containing final states as new final state.

State/Input 0 1
{A,B,C} {B,C} {A,B,C}
{B,C} {C} {B,C}

Department of CSE Module 1 January 7, 2022 85/120

 Regular Expression

Conversion of NFA with  to DFA

Steps:
1 Take  closure of initial state as begining state
2 Find states that can be traversed from present from present
state for each input symbol
3 If any new state is found, repeat step 2 till we get no new
state in the transition table.
4 Mark states containing final states as new final state.

State/Input 0 1
{A,B,C} {B,C} {A,B,C}
{B,C} {C} {B,C}
{C} {C} {C}

Department of CSE Module 1 January 7, 2022 85/120

 Regular Expression

Conversion of NFA with  to DFA

Steps:
1 Take  closure of initial state as begining state
2 Find states that can be traversed from present from present
state for each input symbol
3 If any new state is found, repeat step 2 till we get no new
state in the transition table.
4 Mark states containing final states as new final state.

State/Input 0 1
{A,B,C} {B,C} {A,B,C}
{B,C} {C} {B,C}
{C} {C} {C}

Now, create transition diagram

Department of CSE Module 1 January 7, 2022 85/120

 Regular Expression

Arden’s Theorem
Let P and Q be two regular expressions over Σ. If P doesnot
contain Λ, then the following equation in R i.e. R=Q+RP
has a unique solution R=QP ∗
Proof:
R = Q + RP (1)
putting ”R=Q+RP” in equation 1
R=Q+QP+RPP
putting R recursively again and again
we get:
R=Q+QP+QP 2 +QP 3 + . . .
R= Q (Λ + P + P 2 + P 3 + . . .)
R=QP ∗

Department of CSE Module 1 January 7, 2022 86/120

 Regular Expression

Arden’s Theorem
Let P and Q be two regular expressions over Σ. If P doesnot
contain Λ, then the following equation in R i.e. R=Q+RP
has a unique solution R=QP ∗
Proof:
R = Q + RP (1)
putting ”R=Q+RP” in equation 1
R=Q+QP+RPP
putting R recursively again and again
we get:
R=Q+QP+QP 2 +QP 3 + . . .
R= Q (Λ + P + P 2 + P 3 + . . .)
R=QP ∗
Assumptions:
The transition diagram must not have null transitions.
It must only 1 initial state

Department of CSE Module 1 January 7, 2022 86/120

 Regular Expression

Arden’s Theorem I
1. Find R.E. for the following DFA

q1 = q1 0 + q3 0 + ∧ (2)
q2 = q1 1 + q2 1 + q3 1 (3)
q3 = q2 0 (4)
putting equation 4 in equation 3

q2 = q1 1 + q2 1 + q3 1
= q1 1 + q2 1 + (q2 0)1
= q1 1 + q2 (1 + 01)
Department of CSE Module 1 January 7, 2022 87/120
 Regular Expression

Arden’s Theorem II
Applying Arden’s Theorem
q2 = q1 1(1 + 01)∗ (5)
putting 5 in equation 2
q1 = q1 0 + q3 0 + ∧
= q1 0 + q2 00 + ∧
= q1 0 + (q1 1(1 + 01)∗ 00) + ∧
q1 (0 + 1(1 + 01)∗ 00) + ∧
using arden’s theorem again

∗
q1 = ∧(0 + 1(1 + 01)∗ 00)
∗
(0 + 1(1 + 01)∗ 00)
∗
As q1 is the final state. ∴ r= (0 + 1(1 + 01)∗ 00)
Department of CSE Module 1 January 7, 2022 88/120
 Regular Expression

Arden’s Theorem

Consider the transition system below. Prove that the strings

∗
recognized are (a + a(b + aa)∗ b) a(b + aa)∗ a

Department of CSE Module 1 January 7, 2022 89/120

 Regular Expression

Arden’s Theorem I
Consider the transition system below. Prove that the strings
∗
recognized are (a + a(b + aa)∗ b) a(b + aa)∗ a

Solution:

q1 = q1 a + q2 b + ∧ (6)
q2 = q1 a + q2 b + q3 a (7)
q3 = q2 a (8)

Department of CSE Module 1 January 7, 2022 90/120

 Regular Expression

Arden’s Theorem II
Putting equation 8 in equation 7

q2 = q1 a + q2 b + q2 aa
q2 = q1 a + q2 (b + aa)
q2 = q1 a(b + aa)∗

Now putting q2 in equation 6

q1 = q1 a + q2 b + ∧
= q1 a + q1 a(b + aa)∗ b + ∧
= q1 (a + a(b + aa)∗ b) + ∧
∗
= ∧(a + a(b + aa)∗ b)
∗
= (a + a(b + aa)∗ b)

putting this in q2

Department of CSE Module 1 January 7, 2022 91/120

 Regular Expression

Arden’s Theorem III

∗
q2 = (a + a(b + aa)∗ b) a + q2 b + q2 aa
∗
= (a + a(b + aa)∗ b) a + q2 (b + aa)
∗
= (a + a(b + aa)∗ b) a(b + aa)∗

putting q2 in q3
∗
q3 = (a + a(b + aa)∗ b) a(b + aa)∗ a (9)

Since q3 is the final state.

∗
∴ r= (a + a(b + aa)∗ b) a(b + aa)∗ a

Department of CSE Module 1 January 7, 2022 92/120

 Regular Expression

Arden’s Theorem I
Prove that the finite automaton whose transition diagram
below accepts the set of all strings over alphabet {a,b} with
an equal number of a’s and b’s, such that each prefix has
atmost has atmost one more a than the b’s and atmost one
more b than the a’s

Department of CSE Module 1 January 7, 2022 93/120

 Regular Expression

Arden’s Theorem II
Solution:

q1 = q2 b + q3 a + ∧ (10)
q2 = q1 a (11)
q3 = q1 b (12)
q4 = q2 a + q3 b + q4 a + q4 b (13)

putting q2 and q3 in q1

q1 = q1 ab + q1 ba + ∧
q1 = q1 (ab + ba) + ∧

applying Arden’s theorem

q1 = ∧(ab + ba)∗
q1 = (ab + ba)∗
Department of CSE Module 1 January 7, 2022 94/120
 Regular Expression

Arden’s Theorem III

Now, the prefix can be even or odd in length. For Prefix x of
even length, the number of a’s and b’s shall be equal as x is a
substring formed by ab’s and ba’s. For prefix x of odd length,
then we can write ’x’ as ya or yb. As y has even number of
symbols, which implies x has one more a than b or vice-versa

Department of CSE Module 1 January 7, 2022 95/120

 Regular Expression

Arden’s Theorem

Describe in English the set accepted by finite automaton

whose transition diagram is as under:

Department of CSE Module 1 January 7, 2022 96/120

 Regular Expression

Arden’s Theorem

Construct a regular expression corresponding to the state

diagram described as under:

Give R.E. for representing the set L of strings in which every 0

is immediately followed by atleast two 1’s. Prove that R.E. r=
∗
∧ + 1∗ (011)∗ (1∗ (011)∗ ) also describes the same set of strings.
Prove
(1 + 00∗ 1) + (1 + 00∗ 1)(0 + 10∗ 1)∗ (0 + 10∗ 1) = 0∗ 1(0 + 10∗ 1)∗

Department of CSE Module 1 January 7, 2022 97/120

 Two way finite automata

2-way DFA

2-way DFA allows the read head to move left or right on the
input
Two end-markers
Needs only 1 accept or reject state.
A tuple M = {Q, Σ, `, a, δ, s, t, r }
where Q is the set of states
Σ is the input alphabet set
` is the left end marker
a is the right end marker
δ is Q × (Σ ∪ {`, λ}) → Q × {L, R}
s is start state
t is the accept state
r is reject state such that r 6= t

Department of CSE Module 1 January 7, 2022 98/120

 Two way finite automata

2-Way DFA
Determine the acceptability of 101001 for the following:
State/ Σ 0 1
→ q0 (q0 ,R) (q1 , R)
q1 (q1 ,R) (q2 , L)
q2 (q0 ,R) (q2 , L)
where Q={q0 , q1 , q2 }, s=q0 , t=q1 , r=q2

Department of CSE Module 1 January 7, 2022 99/120

 Two way finite automata

Transition System containing ∧-moves

Conversion from system with ∧-moves into equivalent system

without ∧-moves
Suppose we want to replace a ∧-move from v1 → v2 , then use the
following steps:
1 Find all edges starting from v2
2 Duplicate all those edges starting from v1 without changing
edge labels.
3 If v1 is initial state, make v2 as Initial state.
4 If v2 is final state, make v1 as final state.

Department of CSE Module 1 January 7, 2022 100/120

 Two way finite automata

Conversion from system with ∧-moves into

equivalent system without ∧-moves
Consider a finite automaton with ∧-moves given below. Obtain
equivalent automaton without ∧-moves.

Department of CSE Module 1 January 7, 2022 101/120

 Two way finite automata

Conversion from system with ∧-moves into

equivalent system without ∧-moves
Consider a finite automaton with ∧-moves given below. Obtain
equivalent automaton without ∧-moves.

Department of CSE Module 1 January 7, 2022 101/120

 Two way finite automata

Conversion from system with ∧-moves into

equivalent system without ∧-moves
Consider a finite automaton with ∧-moves given below. Obtain
equivalent automaton without ∧-moves.

Department of CSE Module 1 January 7, 2022 101/120

 Two way finite automata

Conversion from system with ∧-moves into

equivalent system without ∧-moves
Consider a finite automaton with ∧-moves given below. Obtain
equivalent automaton without ∧-moves.

Department of CSE Module 1 January 7, 2022 101/120

 Two way finite automata

Conversion from system with ∧-moves into

equivalent system without ∧-moves

Consider the given transition system containing ∧-move. Obtain

an equivalent transition system without ∧-moves.

Department of CSE Module 1 January 7, 2022 102/120

 Two way finite automata

Conversion from system with ∧-moves into

equivalent system without ∧-moves

Consider the given transition system containing ∧-move. Obtain

an equivalent transition system without ∧-moves.

Department of CSE Module 1 January 7, 2022 102/120

 Two way finite automata

Construction of FA equivalent to given RE I

Construct FA equivalent to Regular Expression.
(0 + 1)∗ (00 + 11)(0 + 1)∗
Solution:

Department of CSE Module 1 January 7, 2022 103/120

 Two way finite automata

Construction of FA equivalent to given RE II

State/Σ 0 1
q0 q0 , q3 q0 , q4
q3 qf
q4 qf
qf qf qf

Department of CSE Module 1 January 7, 2022 104/120

 Two way finite automata

Construction of FA equivalent to given RE III

converting to DFA
State/Σ 0 1
q0 q0 , q3 q0 , q4
q0 , q3 q0 , q3 , qf q0 , q4
q0 , q4 q0 , q3 q0 , q4 , qf
q0 , q3 , qf q0 , q3 , qf q0 , q4 , qf
q0 , q4 , qf q0 , q3 , qf q0 , q4 , qf
reducing
State/Σ 0 1
q0 q0 , q3 q0 , q4
q0 , q3 q0 , q3 , qf q0 , q4
q0 , q4 q0 , q3 q0 , q3 , qf
q0 , q3 , qf q0 , q3 , qf q0 , q3 , qf

Department of CSE Module 1 January 7, 2022 105/120

 Two way finite automata

Construction of FA equivalent to given RE

1 Construct DFA with reduced states equivalent to R.E.

(10+(0+11)0∗ 1).
2 Construct transition system equivalent to R.E.
(ab + c ∗ )∗ b
a + bb + bab ∗ a
(a + b)∗ abb
3 Prove that
(a∗ ab + ba)∗ a∗ = (a + ab + ba)∗
4 Construct a finite automata accepting all strings over {0,1}
ending in 010 or 0010.
5 Construct a regular grammar which can generate the set of all
strings starting with a letter (A to Z) followed by a string of
letters or digits (0 to 9).

Department of CSE Module 1 January 7, 2022 106/120

 Pumping Lemma for Regular Sets

Pumping Lemma for Regular Sets

Let M = (Q, Σ, δ, q0 , F) be a finite automaton with ’n’

states. Let L be the regular sets accepted by M.
Let w ∈ L and |w |≥ m, if m ≥ n, then ∃ x,y,z such that
w=xyz, y 6= ∧ and xy i z ∈ L for each i ≥ 0.
Applications of Pumping Lemma: Used to prove that
certain set are not regular.
Steps to prove that given set is not regular:
1 Assume L is regular. Let ’n’ be the number of states in
corresponding FA.
2 Choose a string ’w’ such that |w |≥ n. Use pumping lemma to write
w=xyz with |xy |≤ n and |y |> 0
3 Fing a suitable integer i such that xy i z 6∈ L. This contradicts our
assumption. Hence, L is not regular.

Department of CSE Module 1 January 7, 2022 107/120

 Pumping Lemma for Regular Sets

Pumping Lemma for Regular Sets

2
Show that the set L ={ai |i ≤ 1} is not regular
Solution:
Let L is regular
Let ’n’ be number of states in FA accepting L.
Let w=an2 =⇒ |w |= n2 > n
by pumping lemma, w=xyz with |xy |≤ n and |y |> 0
Consider xy 2 z
|xy 2 z |= |x |+ 2 |y |+ |z |> |x |+ |y |+ |z |∵ |y |> 0
=⇒ n2 = |xyz |= |x |+ |y |+ |z |< |xy 2 z |
As |xy |≤ n, |y |≤ n
∴ |xy 2 z |= |x |+ 2 |y |+ |z |≤ n2 + n < n2 + n + n + 1.
Hence, |xy 2 z |lies between n2 and (n + 1)2 but not equal to
any one of them.
∴ |xy 2 z |is not a perfect square and so xy 2 z 6∈ L.
∴ this is a contradiction. This implies not Regular
Department of CSE Module 1 January 7, 2022 108/120
 Pumping Lemma for Regular Sets

Pumping Lemma for Regular Sets

Show that L= {ap |p is a prime} is not regular. Solution:

1 Let L is regular. Let ’n’ be number of states in finite
automata accepting L.
2 Let ’p’ be a prime number greater than ’n’.
Let w=ap
by pumping lemma, w=xyz with |xy |≤ n and |y |> 0
x, y, z are simply strings of a’s.
So, y= am for some m ≥ 1 (and ≤ n)
3 Let i= p+1, then
|xy i z |= |xyz |+ |y i−1 |=p+(i-1)m=p+pm=p(1+m) which is
not prime.
∴ xy i z 6∈ L. =⇒ contradiction.
So, L is not regular.

Department of CSE Module 1 January 7, 2022 109/120

 Pumping Lemma for Regular Sets

Pumping Lemma for Regular Sets

1 Show that L={0i 1i |i ≥ 1} is not regular.

2 Show that L= {ww |w ∈ {a, b}∗ } is not regular.
3 Is L = {a2n |n ≥ 1} regular ?

Department of CSE Module 1 January 7, 2022 110/120

 Pumping Lemma for Regular Sets

Regular Sets and Regular Grammar

Construct a regular grammar G generating the regular set
represented by
P= a∗ b(a + b)∗ .

Department of CSE Module 1 January 7, 2022 111/120

 Pumping Lemma for Regular Sets

Regular Sets and Regular Grammar

Construct a regular grammar G generating the regular set
represented by
P= a∗ b(a + b)∗ .
Solution:

Department of CSE Module 1 January 7, 2022 111/120

 Pumping Lemma for Regular Sets

Regular Sets and Regular Grammar

Construct a regular grammar G generating the regular set
represented by
P= a∗ b(a + b)∗ .
Solution:

Let G=({q0 , q1 },{a,b},P,q0 )

where P is given by:

Department of CSE Module 1 January 7, 2022 111/120

 Pumping Lemma for Regular Sets

Regular Sets and Regular Grammar

Construct a regular grammar G generating the regular set
represented by
P= a∗ b(a + b)∗ .
Solution:

Let G=({q0 , q1 },{a,b},P,q0 )

where P is given by:
q0 → aq0
q0 → bq1 , q0 → b
q1 → aq1 , q1 → bq1
q1 → b

Department of CSE Module 1 January 7, 2022 111/120

 Pumping Lemma for Regular Sets

Regular Sets and Regular Grammar

Construct a regular grammar G generating the regular set
represented by
P= a∗ b(a + b)∗ .
Solution:

Let G=({q0 , q1 },{a,b},P,q0 )

where P is given by:
q0 → aq0
q0 → bq1 , q0 → b
q1 → aq1 , q1 → bq1
q1 → b
Let G=({A,B},{a,b},P,A) where P consists of
A → aB, B → bB
B → a, B → bA
Construct a transition system M accepting L(G).
Department of CSE Module 1 January 7, 2022 111/120
 Pumping Lemma for Regular Sets

Regular Sets and Regular Grammar

If a regular grammar G is given by S → aS |a. Find M

accepting L(G).
Construct a DFA equivalent to grammar
S → aS |bS |aA
A → bB
B → aC, C → ∧

Department of CSE Module 1 January 7, 2022 112/120

 My-Hill-NeroArdede Theorem

My-hill Nerode Theorem I

Used for Minimization of DFA.
Steps:
1 Draw a table for all pair of states (P,Q).
2 Mark all pairs where P ∈ F and Q 6∈ F.
3 IF there are unmarked pairs (P,Q) such that [δ(P, X ), δ(Q, X )] is
marked, then mark [P,Q], where ’X’ is an input symbol.
4 Repeat step 3 untill no more marking can be made.
5 Combine all un-marked pairs and make them a single state in
minimized DFA.
Minimize the given deterministic finite automata

Department of CSE Module 1 January 7, 2022 113/120

 My-Hill-NeroArdede Theorem

My-hill Nerode Theorem II

Solution:

Department of CSE Module 1 January 7, 2022 114/120

 My-Hill-NeroArdede Theorem

My-hill Nerode Theorem III

(B,A) =⇒ δ(B, 0) = A
δ(A, 0) = B Unmarked
δ(B, 1) = D
δ(A, 1) = C unmarked
(D,C) =⇒ δ(D, 0) = E
δ(D, 0) = E Unmarked
δ(C , 1) = F
δ(C , 1) = F unmarked
(E,C) =⇒ δ(E , 0) = E
δ(C , 0) = E Unmarked
δ(E , 1) = F
δ(C , 1) = F unmarked
(E,D) =⇒ δ(E , 0) = E
δ(E , 0) = E Unmarked
δ(D, 1) = F

Department of CSE Module 1 January 7, 2022 115/120

 My-Hill-NeroArdede Theorem

My-hill Nerode Theorem IV

δ(D, 1) = F unmarked
(F,A) =⇒ δ(F , 0) = F
δ(A, 0) = B Unmarked
δ(F , 1) = F
δ(A, 1) = C Marked, Mark (F,A)
(F,B) =⇒ δ(F , 0) = F
δ(B, 0) = A Marked, Mark (F,B)
δ(F , 1) = F
δ(B, 1) = D Marked, Mark (F,B)

Department of CSE Module 1 January 7, 2022 116/120

 My-Hill-NeroArdede Theorem

My-hill Nerode Theorem V

Therefore, unmarked pairs:

(A,B),(D,C),(E,C),(E,D)
here, (C,D,E) form a common pair. So, combined state
(C,D,E)
States 0 1
{A,B} {A,B} {C,D,E}
{C,D,E} {C,D,E} {F}
{F} {F} {F}

Department of CSE Module 1 January 7, 2022 117/120

 My-Hill-NeroArdede Theorem

My-hill Nerode Theorem VI

Department of CSE Module 1 January 7, 2022 118/120

Questions?
[email protected]
Thank you.