Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
14) Suppose FSA M1 and M2 are defined as follows: M1(Q, S, qo, A, 8) = ({I, II, III }, {a, b}, I, {I, III}, 81), where &ı is specified by the following table: a I II III II II II III II III M2(Q, S, q0, A, 8) = ({1, 2, 3}, {a, b}, 1, {2}, 82), where d2 is specified by the following table: a 1 3 3 1 3 2 3 Applying the algorithms from class, suppose we create the following FSA: M3 such that L(M3) = L(M1) n L(M2) M4 such that L(M4) = L(M1) - L(M2) a) Specify M3 completely (any format is fine). Your answer should NOT include any states not reachable from the initial state. Perform no other optimization. b) What is the set of accepting states for M4?

14) Suppose FSA M1 and M2 are defined as follows: M1(Q, S, qo, A, 8) = ({I, II, III }, {a, b}, I, {I, III}, 81), where &ı is specified by the following table: a I II III II II II III II III M2(Q, S, q0, A, 8) = ({1, 2, 3}, {a, b}, 1, {2}, 82), where d2 is specified by the following table: a 1 3 3 1 3 2 3 Applying the algorithms from class, suppose we create the following FSA: M3 such that L(M3) = L(M1) n L(M2) M4 such that L(M4) = L(M1) - L(M2) a) Specify M3 completely (any format is fine). Your answer should NOT include any states not reachable from the initial state. Perform no other optimization. b) What is the set of accepting states for M4?

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

Theory of Computing

14) Suppose FSA M1 and M2 are defined as follows: M1(Q, S, qo, A, 8) = ({I, II, III }, {a, b}, I, {I, III}, 81), where ôi is specified by the following table: a b I II III II II II III II III M2(Q, S, q0, A, 8) = ({1, 2, 3}, {a, b}, 1, {2}, 82), where 82 is specified by the following table: | a | b 1 3 2 2 3 1 3 2 3 Applying the algorithms from class, suppose we create the following FSA: M3 such that L(M3) = L(M1) n L(M2) M4 such that L(M4) = L(M1) - L(M2) a) Specify M3 completely (any format is fine). Your answer should NOT include any states not reachable from the initial state. Perform no other optimization. b) What is the set of accepting states for M4?
Transcribed Image Text:14) Suppose FSA M1 and M2 are defined as follows: M1(Q, S, qo, A, 8) = ({I, II, III }, {a, b}, I, {I, III}, 81), where ôi is specified by the following table: a b I II III II II II III II III M2(Q, S, q0, A, 8) = ({1, 2, 3}, {a, b}, 1, {2}, 82), where 82 is specified by the following table: | a | b 1 3 2 2 3 1 3 2 3 Applying the algorithms from class, suppose we create the following FSA: M3 such that L(M3) = L(M1) n L(M2) M4 such that L(M4) = L(M1) - L(M2) a) Specify M3 completely (any format is fine). Your answer should NOT include any states not reachable from the initial state. Perform no other optimization. b) What is the set of accepting states for M4?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Hash Table
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
SEE MORE TEXTBOOKS