Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
4. Let M (Q,E,9,,8,F) be the NDFA such that Q={qo•91»9z}, E = {a,b}, F = {q,}, the initial state is q, and o is given by a 9o (9o, q2} {q0) 91 {9o, q2} 92 | {91, 92} Ø a) Draw the transition diagram of M b) Which of the strings aba, bbb, bba, and abb are accepted by M ?

4. Let M (Q,E,9,,8,F) be the NDFA such that Q={qo•91»9z}, E = {a,b}, F = {q,}, the initial state is q, and o is given by a 9o (9o, q2} {q0) 91 {9o, q2} 92 | {91, 92} Ø a) Draw the transition diagram of M b) Which of the strings aba, bbb, bba, and abb are accepted by M ?

C++ for Engineers and Scientists
C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter13: Structures
Section: Chapter Questions
Problem 4PP
See similar textbooks
icon
Related questions
Question
100%

what answer this question ?

4. Let M = (Q,E,9,,8,F) be the NDFA such that Q=D{q,»9»4z}, E= {a,b}, F = {q,}, the initial state is q, and & is given by a 9o {90, q2} {qo) 91 {90, qz} 92 | {91, 92} | Ø (a) Draw the transition diagram of M (b) Which of the strings aba, bbb, bba, and abb are accepted by M ? 5. Let M (Q,E,T,q,,8,r) be a Finite state machine (FSM) such that the transition %3D a a 90 92 91 1 1 91 92 92 92 92 1 1 table of M is (a) Draw the transition diagram of M (b) What is the output string if the input string is aabbb ? (c) What is the output string if the input string is ababab ? (d) What is the output of the string abbbaba ? (e) What is the output of the string bbbababa ? 6. Design a FSM, with input alphabet E= {a,b}, that outputs a 1, if the input symbols read so far consists of even number of a's. 7. Design a FSM that accepts all strings over {a,b}, that begin with aa.
Transcribed Image Text:4. Let M = (Q,E,9,,8,F) be the NDFA such that Q=D{q,»9»4z}, E= {a,b}, F = {q,}, the initial state is q, and & is given by a 9o {90, q2} {qo) 91 {90, qz} 92 | {91, 92} | Ø (a) Draw the transition diagram of M (b) Which of the strings aba, bbb, bba, and abb are accepted by M ? 5. Let M (Q,E,T,q,,8,r) be a Finite state machine (FSM) such that the transition %3D a a 90 92 91 1 1 91 92 92 92 92 1 1 table of M is (a) Draw the transition diagram of M (b) What is the output string if the input string is aabbb ? (c) What is the output string if the input string is ababab ? (d) What is the output of the string abbbaba ? (e) What is the output of the string bbbababa ? 6. Design a FSM, with input alphabet E= {a,b}, that outputs a 1, if the input symbols read so far consists of even number of a's. 7. Design a FSM that accepts all strings over {a,b}, that begin with aa.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of Security Technology
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS