This
preview
has intentionally blurred sections.
Sign up to view the full version.
Unformatted text preview: Consider the ±ve state machine de±ned by the table below. The start state is s . f g input input state 0 1 0 1 s s 1 s 1 0 s 1 s 1 s 2 1 1 s 2 s s 4 0 0 s 3 s 2 s 0 0 s 4 s 3 s 4 0 0 (a) Draw the state diagram (graph) representing this machine. s0 s1 s2 s3 s4 0/0 1/0 0/0 1/0 0/0 1/1 0/1 1/0 0/1 1/0 (b) What is the output string generated when the input string is 001101? 111000 (c) What is the sequence of states through which the machine passes when the input string is 001101? s s 1 s 1 s 2 s 4 s 3 s (d) What is the output string generated when the input string is 1101? 0011...
View
Full Document
- Spring '08
- SaktiPramanik
- Computer Science, Formal language, Regular expression, input string, Context-free grammar
-
Click to edit the document details