TOC http://www.youtube.

com/c/EDULINEFORCSE
STUDENTS

MODULE 2

Prepared By Mr.EBIN PM, AP, IESCE 1

FINITE STATE MACHINES WITH OUTPUT

MOORE MACHINE AND MEALY MACHINE
These machines can be described by (Q, Σ, , q₀, ∆, λ)
Q – Finite set of states
Σ – Input alphabet
 - Transition function (Q×Σ→Q)
q₀ - Initial state
∆ - Output alphabet
λ – Output function
The only difference between Moore and Mealy is in λ
Prepared By Mr.EBIN PM, AP, IESCE EDULINE2

Prepared By Mr. EBIN PM, AP, IESCE 1

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

MOORE MACHINE

λ : Q→∆

Here for every state an output is associated

∆ is a symbol which will be outputted by the machine.
The state q₀ produce an output 1
The state q₁ produce an output 0

Prepared By Mr.EBIN PM, AP, IESCE EDULINE3

MOORE MACHINE (WORKING)

 If we give input ab
a b
q₀ q₀ q₁
1 1 0

• Without seeing anything, q₀ will produce some output

• On seeing the input ab , this moore machine produce the output
110
• In general, if the string of length n is input, then output produced
is string of n+1 length.

Prepared By Mr.EBIN PM, AP, IESCE EDULINE4

Prepared By Mr. EBIN PM, AP, IESCE 2

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

MEALY MACHINE
(q₀, a) → 1
λ : Q×Σ→∆ (q₀, b) → 0
(q₁, b) → 0
(q₁, a) → 1

 For a state and a given input , there will be some output

For state q₀ , if input is a, then output is 1

Prepared By Mr.EBIN PM, AP, IESCE EDULINE5

MEALY MACHINE (WORKING)

 Let the input is ab

a b
q₀ q₀ q₁
1 0

The output is associated with input

 If we give n bit input, the output will be n bit

Prepared By Mr.EBIN PM, AP, IESCE EDULINE6

Prepared By Mr. EBIN PM, AP, IESCE 3

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

MYHILL – NERODE THEOREM

• It implies that there is a unique minimal DFA with minimum
number of states
• Minimization of DFA - DFA minimization stands for converting a
given DFA to its equivalent DFA with minimum number of states.
Here
Input − DFA
Output − Minimized DFA
• Table filling method is also called, Myhill - Nerode theorem.

Prepared By Mr.EBIN PM, AP, IESCE EDULINE7

STEP
1. Draw a table for all pairs of states (P, Q)
2. Mark all pairs where P Є F and Q ₵ F
3. If there are many unmarked pairs (P, Q) such that [(P,x),
(Q,x)] is marked , then mark [P, Q] (where x is an input symbol)
. Repeat this until no more markings can be made.
4. Combine all the unmarked pairs and make them a single state in
the minimized DFA.

Prepared By Mr. EBIN PM, AP, IESCE EDULINE8

Prepared By Mr. EBIN PM, AP, IESCE 4

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Example A B C D E F
A
d B

c D

E
Step 1: Draw a table for all pairs F
of states (P, Q)

Prepared By Mr. EBIN PM, AP, IESCE EDULINE9

A B C D E F

A d

C
c
D

Step 2: Mark all pairs where P Є F and Q ₵ F (One state

should be final and other should be non final state)
Prepared By Mr. EBIN PM, AP, IESCE EDULINE10

Prepared By Mr. EBIN PM, AP, IESCE 5

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Step 3
(B,A) -  (B, 0) - A
 (A, 0) – B unmarked
 (B, 1) – D
 (A, 1) – C unmarked

(D,C) -  (D, 0) –E
d
 (C, 0) – E no such column
 (D, 1) – F
c  (C, 1) – F no such column

Prepared By Mr. EBIN PM, AP, IESCE EDULINE11

Step 3 continuation
(E,C) -  (E, 0) - E
 (C, 0) – E no such column
 (E, 1) – F
 (C, 1) – F no such column

(E,D) -  (E, 0) –E
d
 (D, 0) – E no such column
 (E, 1) – F
c  (D, 1) – F no such column

Prepared By Mr. EBIN PM, AP, IESCE EDULINE12

Prepared By Mr. EBIN PM, AP, IESCE 6

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Step 3 continuation
(F, A) -  (F, 0) - F
 (A, 0) – B unmarked
 (F, 1) – F
 (A, 1) – C marked. So we
should mark FA

d (F, B) -  (F, 0) –F
 (B, 0) –A FA is marked .so
c
we should mark FB also.

Prepared By Mr. EBIN PM, AP, IESCE EDULINE13

Final table

Prepared By Mr. EBIN PM, AP, IESCE EDULINE14

Prepared By Mr. EBIN PM, AP, IESCE 7

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Step 4
Combine the unmarked pairs
(A,B), (D,C), (E,C), (E,D)

Prepared By Mr. EBIN PM, AP, IESCE EDULINE15

Minimal DFA

Prepared By Mr. EBIN PM, AP, IESCE EDULINE16

Prepared By Mr. EBIN PM, AP, IESCE 8

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

DFA MINIMIZATION USING EQUIVALENCE THEOREM

Suppose we have 2 states (P, Q)
We can say that P and Q are equivalent , when
(P, w) Є F ═> (Q, w) Є F
(P, w) Є F ═> (Q, w) Є F
If the above condition is satisfied, we can combine the states P
and Q in to one state.
The above condition can be used for combine the two states in
to a single state.

Prepared By Mr. EBIN PM, AP, IESCE EDULINE17

• If |w|=0, then states P and Q are called 0 equivalent

• If |w|=1, then states P and Q are called 1 equivalent
• If |w|=2, then states P and Q are called 2 equivalent
In general,
• If |w|=n, then states P and Q are called n equivalent

Prepared By Mr. EBIN PM, AP, IESCE EDULINE18

Prepared By Mr. EBIN PM, AP, IESCE 9

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Q: Minimize the following DFA

State Transition Table

• Here the start state is q₀ and final state is q₄.

• Step 1 - Identify the unreachable states (The states which are not
reachable from initial state) . If such state exist, delete it.
• Step 2 – Draw state transition table

Prepared By Mr. EBIN PM, AP, IESCE EDULINE19

Step 3 - Find 0 equivalent states (ie, separate non final

and final states )
[q₀, q₁, q₂, q₃] [q₄]
Find 1 equivalent states.
• Check 1 equivalent of (q₀,q₁)
• Check 1 equivalent of (q₀,q₂)
• Check 1 equivalent of (q₂,q₃)

1 equivalent states
q₀ q₁ q₂ q₃ q₄

Prepared By Mr. EBIN PM, AP, IESCE EDULINE20

Prepared By Mr. EBIN PM, AP, IESCE 10

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Find 2 equivalent states

• 2 equivalent state is find using
1 equivalent states. ie,
[q₀, q₁, q₂] [q₃] [q₄]
• Check 2 equivalent of (q₀,q₁)
• Check 2 equivalent of (q₀,q₂)

2 equivalent states

q₀ q₂ q₁ q₃ q₄

Prepared By Mr. EBIN PM, AP, IESCE EDULINE21

Find 3 equivalent states

• 3 equivalent state can be find
using 2 equivalent states. ie,
[q₀,q₂] [q₁] [q₃] [q₄]
• Check 3 equivalent of (q₀,q₂)

3 equivalent states
[q₀,q₂] [q₁] [q₃] [q₄]
ie, No further division is possible

Prepared By Mr. EBIN PM, AP, IESCE EDULINE22

Prepared By Mr. EBIN PM, AP, IESCE 11

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Step 4- Draw minimal DFA using the states

(This is our question) (minimized DFA - Answer)

Prepared By Mr. EBIN PM, AP, IESCE EDULINE23

Q: Minimize the following DFA using equivalence theorem

q₃ is not reachable from starting state. Then we should delete q₃

Prepared By Mr. EBIN PM, AP, IESCE EDULINE24

Prepared By Mr. EBIN PM, AP, IESCE 12

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

 Find 0 equivalent states

[q₀] [q₁ q₂]
Find 1 equivalent states
• Check 1 equivalent of (q₁ q₂)

1 equivalent states
[q₁ q₂] [q₀]
No further division is possible

Prepared By Mr. EBIN PM, AP, IESCE EDULINE25

Given DFA –Question

Minimized DFA - Answer

Prepared By Mr. EBIN PM, AP, IESCE EDULINE26

Prepared By Mr. EBIN PM, AP, IESCE 13

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

 Minimization of DFA (Example 3)

Step1 - Identify the unreachable states

Step 2- Draw state transition table
Prepared By Mr. EBIN PM, AP, IESCE EDULINE27

Step 2- Draw state transition table

Prepared By Mr. EBIN PM, AP, IESCE EDULINE28

Prepared By Mr. EBIN PM, AP, IESCE 14

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Step 3 - Find equivalent states

0 equivalent
[ q₀ q₁ q₂] [q₃]
1 equivalent
• Check 1 equivalent of (q₀ q₁)
• Check 1 equivalent of (q₀ q₂)

1 equivalent states
q₀ q₁ q₂ q₃

Prepared By Mr. EBIN PM, AP, IESCE EDULINE29

2 equivalent
• To find 2 equivalent states, we use 1 equivalent states. Ie,
[q₀ q₁] [q₂] [q₃]
• Check 2 equivalent of (q₀ q₁)

2 equivalent states

q₀ q₁ q₂ q₃
So, 2 equivalent states are
[q₀] [q₁] [q₂] [q₃]

Prepared By Mr. EBIN PM, AP, IESCE EDULINE30

Prepared By Mr. EBIN PM, AP, IESCE 15

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Given DFA in the question After removing unreachable states

Minimized DFA, which is also

Same as the above

Prepared By Mr. EBIN PM, AP, IESCE EDULINE31

GRAMMAR
A grammar describes how to form strings from a language's
alphabet that are valid according to the language's syntax.
A grammar is usually thought of as a language generator.
Formal Definition
• A Grammar is a 4-tuple such that G = (V , T , P , S) where
V = Finite non-empty set of non-terminal symbols (Variables)
T = Finite set of terminal symbols
P = Finite non-empty set of production rules
S = Start symbol
Prepared By Mr. EBIN PM, AP, IESCE EDULINE32

Prepared By Mr. EBIN PM, AP, IESCE 16

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

A Grammar is mainly composed of two basic elements

• Terminal Symbols - are denoted by using small case letters such as

a, b, c etc.
• Non-Terminal Symbols - are denoted by using capital letters such
as A, B, C etc. It is also called variables.

Prepared By Mr. EBIN PM, AP, IESCE EDULINE33

Example 1 of Grammar
• Consider a grammar G = (V , T , P , S) where-
V={S} // Set of Non-Terminal symbols
T={a,b} // Set of Terminal symbols
P = { S → aSbS , S → bSaS , S → ε } // Set of production rules
S={S} // Start symbol
This grammar generates the strings having equal number of a’s and
b’s

Prepared By Mr. EBIN PM, AP, IESCE EDULINE34

Prepared By Mr. EBIN PM, AP, IESCE 17

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Example 2 of Grammar
Consider a grammar G = (V , T , P , S) where-

V = { S , A , B } // Set of Non-Terminal symbols

T={a,b} // Set of Terminal symbols
P = { S → ABa , A → BB , B → ab , AA → b } // Set of production rules
S = { S } // Start symbol

Prepared By Mr. EBIN PM, AP, IESCE EDULINE35

 Chomsky Hierarchy
Noam Chomsky gave a mathematical model of grammar in 1956
which is effective for writing computer languages.
According to Chomsky hierarchy, grammars are divided of 4 types:

 Type 0 known as unrestricted grammar

 Type 1 known as context sensitive grammar
 Type 2 known as context free grammar
 Type 3 Known as Regular Grammar

Prepared By Mr. EBIN PM, AP, IESCE EDULINE36

Prepared By Mr. EBIN PM, AP, IESCE 18

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

 Chomsky Hierarchy

Prepared By Mr. EBIN PM, AP, IESCE EDULINE37

 Type 3: Regular Grammar

Regular grammars generate regular languages.
These languages are exactly all languages that can be accepted by a
finite state automaton.
Type 3 is most restricted form of grammar.
Regular grammar contains the production of the form α –> β where
|α|≤ |β|, α Є v and β has the form aB or a.
Eg : S –> aS, S –> b

Prepared By Mr. EBIN PM, AP, IESCE EDULINE38

Prepared By Mr. EBIN PM, AP, IESCE 19

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

 Derivations
The process of deriving a string is called as derivation.
The geometrical representation of a derivation is called as a parse
tree or derivation tree.

Leftmost Derivation – It is the process of deriving a string by

expanding the leftmost non-terminal at each step
Rightmost Derivation – It is the process of deriving a string by
expanding the rightmost non-terminal at each step
Prepared By Mr. EBIN PM, AP, IESCE EDULINE39

Leftmost Derivation
Find Leftmost derivation of the S →AB
Following Grammar ? →aBB
S → AB | ε →aSbB
A → aB →aεbB
B → Sb →abB
Derive the string abb →abSb
→abεb
→abb

Prepared By Mr. EBIN PM, AP, IESCE EDULINE40

Prepared By Mr. EBIN PM, AP, IESCE 20

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Rightmost Derivation
Find Rightmost derivation of the S →AB
Following Grammar ? →ASb
S → AB | ε →Aεb
A → aB →aBb
B → Sb →aSbb
Derive the string abb →aεbb
→abb

Prepared By Mr. EBIN PM, AP, IESCE EDULINE41

REGULAR EXPRESSIONS
The language accepted by finite automata can be easily described
by simple expressions called Regular Expressions.
It is the most effective way to represent any language.
The languages accepted by some regular expression are referred
to as Regular languages.
A regular expression can also be described as a sequence of
pattern that defines a string.
Regular expressions are used to match character combinations in
strings.

Prepared By Mr. EBIN PM, AP, IESCE EDULINE42

Prepared By Mr. EBIN PM, AP, IESCE 21

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Regular Expressions are used to denote regular languages. An

expression is regular if
• ɸ is a regular expression for regular language ɸ.
• ɛ is a regular expression for regular language {ɛ}
• If a ∈ Σ (Σ represents the input alphabet), a is regular expression
with language {a}.
• If a and b are regular expression, a + b is also a regular expression
with language {a,b}.
• If a and b are regular expression, ab (concatenation of a and b) is
also regular.
• If a is regular expression, a* (0 or more times a) is also regular.

Prepared By Mr. EBIN PM, AP, IESCE EDULINE43

Regular Languages : A language is regular if it can be expressed in

terms of regular expression.
In a regular expression, x* means zero or more occurrence of x. It
can generate {ε, x, xx, xxx, xxxx, .....}
In a regular expression, x means one or more occurrence of x. It
can generate {x, xx, xxx, xxxx, .....}

Prepared By Mr. EBIN PM, AP, IESCE EDULINE44

Prepared By Mr. EBIN PM, AP, IESCE 22

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Example 1:
Write the regular expression for the language accepting all
combinations of a's, over the set ∑ = {a}
Solution:
• All combinations of a's means a may be zero, single, double and so
on.
• If a is appearing zero times, that means a null string. That is we
expect the set of {ε, a, aa, aaa, ....}.
• So we give a regular expression for this as:
RE = a*

Prepared By Mr. EBIN PM, AP, IESCE EDULINE45

Example 2:
Write the regular expression for the language accepting all
combinations of a's except the null string, over the set ∑ = {a}
Solution:
• The regular expression has to be built for the language
L = {a, aa, aaa, ....}
• This set indicates that there is no null string. So we can denote
regular expression as:
RE =

Prepared By Mr. EBIN PM, AP, IESCE EDULINE46

Prepared By Mr. EBIN PM, AP, IESCE 23

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Example 3:
Write the regular expression for the language accepting all the
string containing any number of a's and b's.
Solution:
The regular expression will be:
RE = (a + b)*
• This will give the set as L = {ε, a, aa, b, bb, ab, ba, aba, bab, .....},
any combination of a and b.
• The (a + b)* shows any combination with a and b even a null
string.

Prepared By Mr. EBIN PM, AP, IESCE EDULINE47

Example 4:
Write the regular expression for the language accepting all the
string which are starting with 1 and ending with 0, over ∑ = {0, 1}
Solution:
• In a regular expression, the first symbol should be 1, and the last
symbol should be 0.

RE = 1 (0+1)* 0

Prepared By Mr. EBIN PM, AP, IESCE EDULINE48

Prepared By Mr. EBIN PM, AP, IESCE 24

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Conversion of RE to FA
Rules:
1. a+b (a or b, a|b) 2. (ab)
a
a b
q₀ q₁ q₀ q₁ q₂
b
3. ∗ (Repetition / a closure)
a

q₀

Prepared By Mr. EBIN PM, AP, IESCE EDULINE49

Example: 1
Convert the regular expression b𝐚∗ b to Finite Automata
L= {bb, bab, baab,…….}

Prepared By Mr. EBIN PM, AP, IESCE EDULINE50

Prepared By Mr. EBIN PM, AP, IESCE 25

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Example: 2
Convert the regular expression (a+b)c to Finite Automata
L= {ac, bc}

Prepared By Mr. EBIN PM, AP, IESCE EDULINE51

Example: 3
Convert the regular expression a ∗ to Finite Automata

L= {a, abc, abcbc, abcbcbc, ……..}

Prepared By Mr. EBIN PM, AP, IESCE EDULINE52

Prepared By Mr. EBIN PM, AP, IESCE 26

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Example: 3
Convert the regular expression ∗
(abb| b ) to Finite
Automata

Prepared By Mr. EBIN PM, AP, IESCE EDULINE53

REGULAR EXPRESSION TO NFA

 The following are the rules to convert a RE to NFA. They are called
Thompson’s Rule
Rule: 1
• Let i be the initial state and f be the final state. The NFA for the
regular expression (RE) that accept null string (ε) is given by

Prepared By Mr. EBIN PM, AP, IESCE EDULINE54

Prepared By Mr. EBIN PM, AP, IESCE 27

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Rule: 2
• The NFA for the regular expression (RE) that accept an input
symbol a is given by

Rule : 3
• If N1 and N2 are NFA for the regular Expression R1 and R2,then
(i) NFA for R1+R2 (R1|R2)

Prepared By Mr. EBIN PM, AP, IESCE EDULINE55

(i) NFA for R1R2

(ii) NFA for 𝐑∗

Prepared By Mr. EBIN PM, AP, IESCE EDULINE56

Prepared By Mr. EBIN PM, AP, IESCE 28

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Example : 1
Construct NFA for the RE (a|b)*a for a
W can split the RE like
R1 = a
R2 = b
R3 = R1 | R2 for b
R4 = R3*
R5 = R4.R1
We can construct NFA for each one

Prepared By Mr. EBIN PM, AP, IESCE EDULINE57

for a|b for (a|b)*

Prepared By Mr. EBIN PM, AP, IESCE EDULINE58

Prepared By Mr. EBIN PM, AP, IESCE 29

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

for (a|b)*a

Prepared By Mr. EBIN PM, AP, IESCE EDULINE59

Example 2
• Draw NFA to represent the regular expression ab|(a|b)a
for a for ab

for b for a|b

Prepared By Mr. EBIN PM, AP, IESCE EDULINE60

Prepared By Mr. EBIN PM, AP, IESCE 30

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

for ab|(a|b)

for ab|(a|b)a

Prepared By Mr. EBIN PM, AP, IESCE EDULINE61

Conversion of FA to RE
Here we are using state elimination method
Rule 1
Initial state should not have any incoming edge from other state.
If incoming edge is present, then create new initial state

Prepared By Mr. EBIN PM, AP, IESCE EDULINE62

Prepared By Mr. EBIN PM, AP, IESCE 31

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Rule 2a
Final state should not have any outgoing edge. If outgoing edge is
present, then create new final state

Prepared By Mr. EBIN PM, AP, IESCE EDULINE63

Rule 2b
If more than one Final state is present, then convert it into one
state

Rule 3
Eliminate the state one by one other than the initial & final state

Prepared By Mr. EBIN PM, AP, IESCE EDULINE64

Prepared By Mr. EBIN PM, AP, IESCE 32

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Example 1

No incoming edge from other state to

initial state
No outgoing edges from final state.

a, b, c
A B

RE = (a+b+c)

Prepared By Mr. EBIN PM, AP, IESCE EDULINE65

Example 2

No incoming edge from other state to

initial state
No outgoing edges from final state.

ab
q₀ q₁

RE = ab

Prepared By Mr. EBIN PM, AP, IESCE EDULINE66

Prepared By Mr. EBIN PM, AP, IESCE 33

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Example 3

No incoming edge from other state to

initial state
No outgoing edges from final state.

RE = ab*c

Prepared By Mr. EBIN PM, AP, IESCE EDULINE67

Example 4 Step - 1
Incoming edge is present from other state to
initial state . So , create new initial state

Prepared By Mr. EBIN PM, AP, IESCE EDULINE68

Prepared By Mr. EBIN PM, AP, IESCE 34

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Step - 2
Outgoing edge is present from final state
So , create new final state

Prepared By Mr. EBIN PM, AP, IESCE EDULINE69

Step - 3
Delete all intermediate states one by one

Eliminate the state A

10

0 ε
q₀ B qf

Prepared By Mr. EBIN PM, AP, IESCE EDULINE70

Prepared By Mr. EBIN PM, AP, IESCE 35

TOC http://www.youtube.com/c/EDULINEFORCSE
STUDENTS

Step - 3
Eliminate the state B
10

0(10)*
q₀ qf

RE = 0(10)*

Prepared By Mr. EBIN PM, AP, IESCE EDULINE71

Prepared By Mr. EBIN PM, AP, IESCE 36