Assignment_2_Answer_Key

Assignment_2_Answer_Key - 2.d M does not accept the...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Answer Key Assignment 2 1. M={{q0, q1, q2, q3}, {0,1}, G, q0, {q1, q3}} where G= State Output state given input = 0 Output State given input = 1 q0 q2 q1 q1 q1 q3 q2 q3 q0 q3 q2 q0 2 2.a 2.b 000111001 - accepted 110011 - not accepted 10011 - accepted 2.c.i q2 -> q1 -> q2 -> q3 -> q4 ->q1 ->q2 ->q3 2.c.ii The transition from q1 to q2 can occur with input 0 or 1, therefore it is impossible to determine which input caused the state sequence.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2.d M does not accept the language because the language accepted by M contains more strings than the two strings given in the given language. 3.a M accepts any string composed of ones and zeros that has a length that is a number divisible by 3. 3.b Yes, the empty string has length zero, which is divisible by 3. The initial state is an accepting state....
View Full Document

This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.

Page1 / 2

Assignment_2_Answer_Key - 2.d M does not accept the...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online