Scribd
Upload
5 views1 page

FLAT 1st Assignment

The document outlines various tasks related to finite automata, including designing a DFA for a specific substring, creating an NFA for strings starting with '01', and constructing equivalent DFAs and machines for given transitions and conditions. It also covers the conversion of regular expressions to finite automata, the creation of regular expressions for specific sets of strings, and the differences between DFA and NFA. Additionally, it discusses the conversion of NFA with epsilon moves to NFA without epsilon moves.

Uploaded by

praneethkumarpendota21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views1 page

FLAT 1st Assignment

The document outlines various tasks related to finite automata, including designing a DFA for a specific substring, creating an NFA for strings starting with '01', and constructing equivalent DFAs and machines for given transitions and conditions. It also covers the conversion of regular expressions to finite automata, the creation of regular expressions for specific sets of strings, and the differences between DFA and NFA. Additionally, it discusses the conversion of NFA with epsilon moves to NFA without epsilon moves.

Uploaded by

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

1 a)Design a DFA that accepts the strings contains substring ‘abaabb’ over ∑={a,b}.

b) NFA that accepts the strings such that all strings starts with 01 over ∑={0,1}.

2. Construct DFA equivalent to NFA ({p,q,r,s},{0,1},p,$,{s}) where transition function is given


as follows
State 0 1
p {p,q} p
q r r
r s -
s s s

3. Construct Mealy and Moore machine for the input from (0+1+2)* that gives residue
modulo 5 of input treated as ternary numbers(0,1,2).
4. Convert the following DFA in to regular expression :

5. Explain the procedure for converting Regular Expression to Finite Automata. And also
convert the regular exoression : (a+b)*abb into £-NFA.
6. Describe the following sets by regular exoression:
i)Set of all strings of 0’s and 1’s begin with 0 and ends with 1 over ∑={0,1}.
ii)Set of all strings with atleast one 0 ,one 1 and one 2 over ∑={0,1} .
iii)Set of all strings containing odd number of a’s over
∑={a}
7. Differentiate between DFA and NFA
8. Convert given NFA with epsilon moves into NFA without epsilon moves

You might also like