1.6 Give state diagrams of DFAS recognizing the following languages. In all parts the alphabet is {0,1} a. {w| w begins with a 1 and ends with a 0} b. {w w contains at least three 1s} c. {w w contains the substring 0101, i.e., w = r0101y for some r and y} d. {w w has length at least 3 and its third symbol is a 0} e. {w w starts with O and has odd length, or starts with 1 and has even length} f. {w w doesn't contain the substring 110} g. {w the length of w is at most 5} h. {ww is any string except 11 and 111} i. {w every odd position of w is a 1} j. {w w contains at least two Os and at most one 1} k. {e,0} 1. {w w contains an even number of Os, or contains exactly two 1s} m. The empty set n. All strings except the empty string

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%
1.6 Give state diagrams of DFAS recognizing the following languages. In all parts the
alphabet is {0,1}
a. {w| w begins with a 1 and ends with a 0}
b. {w w contains at least three 1s}
c. {w w contains the substring 0101, i.e., w = r0101y for some r and y}
d. {w w has length at least 3 and its third symbol is a 0}
e. {w w starts with O and has odd length, or starts with 1 and has even length}
f. {w w doesn't contain the substring 110}
g. {w the length of w is at most 5}
h. {ww is any string except 11 and 111}
i. {w every odd position of w is a 1}
j. {w w contains at least two Os and at most one 1}
k. {e,0}
1. {w w contains an even number of Os, or contains exactly two 1s}
m. The empty set
n. All strings except the empty string
Transcribed Image Text:1.6 Give state diagrams of DFAS recognizing the following languages. In all parts the alphabet is {0,1} a. {w| w begins with a 1 and ends with a 0} b. {w w contains at least three 1s} c. {w w contains the substring 0101, i.e., w = r0101y for some r and y} d. {w w has length at least 3 and its third symbol is a 0} e. {w w starts with O and has odd length, or starts with 1 and has even length} f. {w w doesn't contain the substring 110} g. {w the length of w is at most 5} h. {ww is any string except 11 and 111} i. {w every odd position of w is a 1} j. {w w contains at least two Os and at most one 1} k. {e,0} 1. {w w contains an even number of Os, or contains exactly two 1s} m. The empty set n. All strings except the empty string
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY