Scribd
Upload
19 views6 pages

Automata Theory Tutorial Solution 4

This document outlines a tutorial for the Automata Theory & Computability course, focusing on the construction of Non-deterministic Finite Automata (NFA) and their conversion to Deterministic Finite Automata (DFA). It includes various exercises requiring the design of NFAs for specific languages and the conversion of NFAs with ε moves to equivalent DFAs. The tutorial is intended for third-year BTech students in their 5th semester.

Uploaded by

Bhavesh Kumar
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
19 views6 pages

Automata Theory Tutorial Solution 4

This document outlines a tutorial for the Automata Theory & Computability course, focusing on the construction of Non-deterministic Finite Automata (NFA) and their conversion to Deterministic Finite Automata (DFA). It includes various exercises requiring the design of NFAs for specific languages and the conversion of NFAs with ε moves to equivalent DFAs. The tutorial is intended for third-year BTech students in their 5th semester.

Uploaded by

Bhavesh Kumar
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/ 6

Course- BTech Type- Core

Course Code- CSET302 Course Name- Automata Theory & Computability


Year- Third Semester- Odd Batch- BTech 5th Semester

Tutorial-1

Tutorial No. Name CO1 CO2 CO3 CO4


 -- --

Objective: Construction of a NFA and conversion from NFA to DFA.

1. Construct a DFA for L= { all binary strings containing substring 001 } (CO1)
Solution:

2. Draw a Non-deterministic Finite Automaton (NFA) which accept all the strings of 0’s
and 1’s ending with either 00 or 11. (CO1)
Solution:

3. Draw a Non-deterministic Finite Automaton (NFA) which accept a string containing “the”
anywhere in a string of {a-z}, e.g., “there” but not “those”. (CO1)
Solution:
4. Draw a Non-deterministic Finite Automaton (NFA) which accept all the strings of 0’s and 1’s
that either starts with 01 or end with 01. (CO1)
Solution:

5. Design an NFA with ε for L={ a n| n is even or divisible by 3}. (CO1)

6. Design an NFA with ε for L={ apbqcr| p,q,r 0}. (CO1)

7. Design a NFA for the transition table as given below, then convert the obtained NFA into
equivalent DFA. (CO1)

Present State 0 1
→q0 q0, q1 q0, q2
q1 q3 Φ
q2 q2, q3 q3
*q3 q3 q3
Solution: NFA DFA

8. Convert the given NFA to DFA. (CO1)

Solution:
9. Convert the following NFA with ε to NFA without ε. (CO1)

Solution:

10. Convert the following NFA with ε moves into equivalent NFA without ε. (CO1)

ε -NFA Solution: NFA

11. Convert the given NFA to DFA. (CO1)

NFA
Solution: DFA

12. Convert the NFA with ε into its equivalent DFA. (CO1)
ε -NFA

Solution: DFA

13. Convert the NFA with ε into its equivalent DFA. (CO1)
ε -NFA
School of Computer Science Engineering and Technology

Solution: DFA

You might also like