Scribd
Upload
22 views1 page

Question 1&2answer

The document describes three finite state machines labeled a, b, and c. Machine a has members b and aaabb and non-members abba and ba. Machine b has members aab and abbabbaaab and non-members a and ababbaaa. Machine c has members aaa and b and non-members aabab and ab. It also provides the sequence of states and outputs for sample inputs to machines a and b.

Uploaded by

Daniyal BBE-1637
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
22 views1 page

Question 1&2answer

The document describes three finite state machines labeled a, b, and c. Machine a has members b and aaabb and non-members abba and ba. Machine b has members aab and abbabbaaab and non-members a and ababbaaa. Machine c has members aaa and b and non-members aabab and ab. It also provides the sequence of states and outputs for sample inputs to machines a and b.

Uploaded by

Daniyal BBE-1637
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
You are on page 1/ 1

a:

Members : b , aaabb

Non Members : abba , ba

b:

Members : aab , abbabbaaab

Non Members : a , ababbaaa

c:

Members : aaa , b

Non Members : aabab , ab

a:

Sequence of states : q1,q1,q1,q1

Output : 000

b:

Sequence of states : q1,q3,q2,q3,q2

Output : 1111

You might also like