c) Write a function that implements the above finite-state machine. (Do not write the entire program). d) Minimize the size of the state set by computing the state equivalence relations. Hint: The minimized machine must have four states. (Name it Machine M2)

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
icon
Concept explainers
Question

ONLY QUESTIONS "C" AND "D", PLEASE.

 

DISCRETE MATH

Design an eight-state finite-state machine to recognize intruders using a
security alarm system (Name it Machine M1).
a) Draw the state table or the state diagram (graph) for the machine.
b) List three (3) strings which would be accepted by the machine.
c) Write a function that implements the above finite-state machine.
(Do not write the entire program).
d) Minimize the size of the state set by computing the state equivalence relations.
Hint: The minimized machine must have four states. (Name it Machine M2)
e) Change one non-final state in the original eight-state machine (Machine M1)
into a final state. (Name it Machine M3)
f) What is the regular expression for the language accepted by Machine M3?
g) Redo the minimization in (e). (Name it Machine M4)
h) How large could the new state set be? How small could it be? (Machine M4)
i) Justify your answer.
Transcribed Image Text:Design an eight-state finite-state machine to recognize intruders using a security alarm system (Name it Machine M1). a) Draw the state table or the state diagram (graph) for the machine. b) List three (3) strings which would be accepted by the machine. c) Write a function that implements the above finite-state machine. (Do not write the entire program). d) Minimize the size of the state set by computing the state equivalence relations. Hint: The minimized machine must have four states. (Name it Machine M2) e) Change one non-final state in the original eight-state machine (Machine M1) into a final state. (Name it Machine M3) f) What is the regular expression for the language accepted by Machine M3? g) Redo the minimization in (e). (Name it Machine M4) h) How large could the new state set be? How small could it be? (Machine M4) i) Justify your answer.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 4 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

e) Change one non-final state in the original eight-state machine (Machine M1)
 into a final state. (Name it Machine M3)
f) What is the regular expression for the language accepted by Machine M3?
g) Redo the minimization in (e). (Name it Machine M4)
h) How large could the new state set be? How small could it be? (Machine M4)
i) Justify your answer.

Could you do these also real quick ??? 

Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Operators
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