Create a deterministic state diagram which accepts all binary strings in the following set (and rejects all others): {w w does not contain an even-length run of Os} (A "run" is a maximal group of consecutive identical symbols, so e.g. 0000010 consists of a length-5 run of Os followed by a length-1 run of 1s and then a length-1 run of Os. Examples for your state diagram: &, 11, 00000, and 00010110001 should all be accepted, while 00 and 11100101000 should be rejected. A string is "accepted" if the state diagram ends up in a Goal State (aka "end", "final", or "accepting" state) after the whole string is read, and the string is rejected otherwise.) Hint: it is possible to solve this using just 4 states, though you are welcome to use more.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Answer the given question with a proper explanation and step-by-step solution.

 

Create a deterministic state diagram which accepts all binary strings in the following set (and rejects all others):
{w w does not contain an even-length run of Os}
(A "run" is a maximal group of consecutive identical symbols, so e.g. 0000010 consists of a length-5 run of Os
followed by a length-1 run of 1s and then a length-1 run of Os. Examples for your state diagram: &, 11, 00000,
and 00010110001 should all be accepted, while 00 and 11100101000 should be rejected. A string is
"accepted" if the state diagram ends up in a Goal State (aka "end", "final", or "accepting" state) after the whole
string is read, and the string is rejected otherwise.)
Hint: it is possible to solve this using just 4 states, though you are welcome to use more.
Transcribed Image Text:Create a deterministic state diagram which accepts all binary strings in the following set (and rejects all others): {w w does not contain an even-length run of Os} (A "run" is a maximal group of consecutive identical symbols, so e.g. 0000010 consists of a length-5 run of Os followed by a length-1 run of 1s and then a length-1 run of Os. Examples for your state diagram: &, 11, 00000, and 00010110001 should all be accepted, while 00 and 11100101000 should be rejected. A string is "accepted" if the state diagram ends up in a Goal State (aka "end", "final", or "accepting" state) after the whole string is read, and the string is rejected otherwise.) Hint: it is possible to solve this using just 4 states, though you are welcome to use more.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Use of XOR function
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education