Finite state machine, heeelp

  • Thread starter prevail
  • Start date
  • #1
17
0
Okay, i'm having trouble understanding a finite state machine example in my :yuck: book. It's a state table for the machine M = (S, [tex] \ell [/tex], [tex] \wp [/tex], v , [tex] \omega [/tex]) where S = {S0, S1, S2}, [tex] \ell = \omega = [/tex] {0,1}.

Please check out the attachment:smile: What i don't understand is the v and [tex] \omega [/tex] column... Why is row S0; S0 in "0" and S1 in "1", and row S2; 0 in "0" and 1 in "1"?

Is this just made up or something? :tongue2:
 

Attachments

  • finitestatemachine.jpg
    finitestatemachine.jpg
    40.5 KB · Views: 298
Last edited:

Answers and Replies

  • #2
Hurkyl
Staff Emeritus
Science Advisor
Gold Member
14,950
19
Given a state and an input, isn't v supposed to tell you where to go next? And similarly w tells you what you're supposed to output?
 
  • #3
17
0
yeah, that's right! In my textbook it says that:

v: S X [tex] \ell [/tex] -> S is the next state function
w: S X [tex] \ell [/tex] -> [tex] \wp [/tex] is the output function.. but i still don't get it :(


Hmm, my attachment is still pending. I've found the same example here :
http://www.cis.uoguelph.ca/~sawada/2910/notes/fsm-1x2.pdf (check out page 3)
 
Last edited by a moderator:

Related Threads on Finite state machine, heeelp

  • Last Post
Replies
14
Views
1K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
7
Views
819
  • Last Post
Replies
6
Views
1K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
11
Views
2K
  • Last Post
Replies
8
Views
2K
Replies
3
Views
2K
Top