EE200_Weber_9-4

EE200_Weber_9-4 - EE 200 Nondeterministic State Machines A...

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

View Full Document Right Arrow Icon
1 EE 200 Nondeterministic State Machines A state machine is deterministic if the guards for each state are mutually exclusive. For any input there is only one next state it can go to. In a nondeterministic state machine the guards can overlap. Two or more arcs may have the same conditions on them, and the machine can take either path to the next state. state1 state2 {0,1}/on {0}/off {1}/on {1}/off
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 EE 200 Nondeterministic State Machines Why would you want a state machine where you don’t know what state it will go to next? Probably not something you would build but still useful. It can be an abstraction of a more complicated deterministic machine. The abstraction is simpler but can exhibit all the behavior of the more complicated deterministic machine.
Background image of page 2
3 EE 200 Nondeterministic State Machines <15¢ 15¢ {nickel, dime} {nickel, dime} {dime}/candy {nickel}/ candy {dime}/candy,change {nickel, absent } { absent } { absent }
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 EE 200 Composing State Machines State machines can be combined (composed) to create
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/03/2008 for the course EE 200 taught by Professor Zadeh during the Fall '08 term at USC.

Page1 / 11

EE200_Weber_9-4 - EE 200 Nondeterministic State Machines A...

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

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