Scribd
Upload
12 views

Assignment 02 Automata

The document contains solutions to assignment questions on finite automata theory. It includes transition tables for non-deterministic and deterministic finite automata, descriptions of conversions between NFAs and DFAs, minimization of DFAs, and regular expressions corresponding to various automata.

Uploaded by

U are EdiTor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Assignment 02 Automata

The document contains solutions to assignment questions on finite automata theory. It includes transition tables for non-deterministic and deterministic finite automata, descriptions of conversions between NFAs and DFAs, minimization of DFAs, and regular expressions corresponding to various automata.

Uploaded by

U are EdiTor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

ASSIGNMENT AUTOMATA

NAME : MUHAMMAD TOQEER


REG NO : BSCS-2020-34

QUESTION NO 01 :
Solution:
1)
remove unnecessary states
now create the transition graph

2)
remove unnecessary states

3)
The FA mentioned in 2 accept the same language as this one. So, there can
be same Transition Graph for both of the Finite automata.
4)
this TG accept the same language

5)

The mentioned FA in Q.20 does not accept any language, because there is no final
state in it.
So TG for it :
QUESTION NO 02 :

a)

TRANSITION TABLE:
State a b
1 {1,2} 2
2 - 1

New table :

State a b
1 {1,2} 2
{1,2} {1,2} {1,2}
2 trap 1

NOW DFA :
(b)

transition table of given nfa :

state a b
1 3 -
2 1 -
3 2 {2,3}

New table :

state a b
1 3 -
3 2 {2,3}
2 1 -
{2,3} {1,2} {2,3}
{1,2} {1,3} -
{1,3} {2,3} {2,3}

Final DFA :
QUESTION 03

this TG accept even number of states;


----------------

QUESTION 04 :

PART 01 :

Transition table :
state a b
0 0,1 0
1 1 0

3)Transition TABLE for DFA:

state a b
0 0,1 0
0,1 0,1 0

DFA :

part 02 :

R.E = a*b(a + b) *

Transition Table of NFA:


state a b
0 0 1
1 1 1

Transition Table of DFA:

state a b
0 0 1
1 1 1

Transition tables are same so the nfa and dfa are same :

part 03:

transition table :

state a b
0 1 1
1 final 0 0

NFA :
dfa conversion :

state a b
0 1 1
1 final 0 0

Dfa :

part 04 :

R.E = ba (a + b) *

Transition table :
state a b
0 - 1
1 2 -
2 2 2

Transition table for dfa :

state a b
0 - 1
1 2 -
2 2 2

part 05 :
R. E= b* aa* b (a + b) *

Nfa transition table :

state a b
0 1 0
1 1 2
2 2 2

Nfa :

Dfa transition table :


state a b
0 1 0
1 1 2
2 2 2

Dfa will be same as the nfa


QUESTION NO 05 :
In this we will remove the states
First we remove q3:

now we remove q2 :

final regular expression is :

R.E= (aa+ bb*aa) *(ab+ bb*ab) (b*a (aa+ bb*aa) *ab + bb*ab) *
Question no : 06

Solution: Step 1: No unreachable states, so no state will be removed.


Step2: Draw Transition Table

Step3:
1- 0-equilance
2- Final Non-Final {E, F} {A, B, C}
3- 1-equilance
4- {F}, {E} {A, C}, {B}
5- 2-equilance
6- {F}, {E} {A, C}, {B}

new table

minimized dfa :

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy