Scribd
Upload
35 views

Tutorial 1 - DFA & NFA

The document provides a tutorial on designing finite state machines (FSMs) with 10 practice problems. The problems involve designing FSMs to check properties of decimal, binary, and unary numbers as well as strings containing certain patterns of 0s, 1s, and other symbols.

Uploaded by

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

Tutorial 1 - DFA & NFA

The document provides a tutorial on designing finite state machines (FSMs) with 10 practice problems. The problems involve designing FSMs to check properties of decimal, binary, and unary numbers as well as strings containing certain patterns of 0s, 1s, and other symbols.

Uploaded by

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

Department of Computer Science & Engineering,

Manav Rachna University, Faridabad Course:


B.Tech. (Computer Science & Engineering)

Subject Name: Theory of Computation & Compiler Design Subject Code:


CSH-311-B- T

Tutorial: 1
Name Roll No. Group No._

Date of Performance Faculty’s Signature

Learning Objective: Student shall be able to learn and design finite state machines

1. Design a machine which checks whether a given decimal number is “Even”.

2. Design F.S.M. to check that given binary number is divisible by ‘5’.

3. Design F.S.M. to check whether a given Unary number is divisible by ‘3’.

4. Design F.S.M. which can accepts string if it contains odd number of 0’s and even
number of 1’s.

5. Design F.S.M. to which al strings end with 00(consecutive two zero’s.

6. Design F.S.M. to set of all strings which starts with ‘0’ and ends with 1’s.

7. Design F.S.M. to set all strings ending with ‘101’

8. Design a F.S.M. which accepts strings those have exactly two zero’s anywhere.

9. Design F.S.M. For Strings having 101 or 110 as a sub-string.

10. Draw the NFA for the language L that consists of all the strings over Σ = {a, b}
such that :
 starting with “a”
 containing substring “aa”
 the 3rd last symbol of string is “b”
 starting with “a” and ending with “b”
 containing “abba” or “baab”

You might also like