Scribd
Upload
14 views

ATC Assignment1

adc

Uploaded by

sugunalecit_50874899
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

ATC Assignment1

adc

Uploaded by

sugunalecit_50874899
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

ASSIGNMENT I (Academic Year 2020-21 Odd Sem)

Course 25/9/202
Automata Theory and Computability Date:
Name: 0
Course Code Sem
18CS54 V Max. Marks: 25
: :
Staff Name: Mrs.C.Sharon Roji Priya Sec: A&B

Questions Marks
1 Define the terms a) ɛ-NFA b) ɛ-Closure 05
2a What is the procedure or algorithm to obtain a DFA from an ɛ-NFA
Convert the following NFA to its equivalent DFA.

a,c c
05
b
a b b
ɛ

b a,b
c

c,ɛ

3a What are distinguishable and indistinguishable states?


Minimize the following DFSM.
δ a b
→A B E
B C F
*C D H
D E H 05
b
E F I
*F G B
G H B
H I C
*I A E
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Hardcode the following DFSM or simulate the following DFA.
a b

b
4 05

Construct a mealy machine which accepts strings of 0’s and 1’s output EVEN when the
input string has even number of 1’s and output ODD when the input string has odd
number of 1’s.

5 Construct a moore machine which accepts strings of 0’s and 1’s output EVEN when 05
the input string has even number of 1’s and output ODD when the input string has
odd number of 1’s.

You might also like