yeah i know that, but in a finite state machine... According to the sequence in the language there must be more 0 than 1... (the way I understand it..)
Why is it not possible to construct a finite state machine that recognizes precisely those sequences in the language
A = {0^i 1^j |i,j Element Z^+, i>j} where the alphabet for A is {0,1}..
I just don't get it why this is not possible.. :grumpy:
Is it because 0 can be infinite.. ?
Hmmm, i'm not sure i understod all you wrote, but thanks for your reply:)
You see one of my exercises is based on a finite state machine diagram where we're supposed to determine the output string of some input etc. , but i'm having trouble translating the diagram to a state table. My book...
Yeah, so i see :smile: But can you explain the process of "f" and "g" ? What make states:
A, column f = B and C
B, column f = B and C
C, column f = C and C
A, column g = 0 and 1
B, column g = 0 and 1
C, column g =1 and 1 ?
I just don't get it :(((
Finite state machines :(
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, \ell , \wp , v , \omega ) where S = {S0, S1, S2}, \ell = \omega = {0,1}.
Please check out the attachment:smile: What i don't...
yeah, that's right! In my textbook it says that:
v: S X \ell -> S is the next state function
w: S X \ell -> \wp is the output function.. but i still don't get it :(
Hmm, my attachment is still pending. I've found the same example here ...
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, \ell , \wp , v , \omega ) where S = {S0, S1, S2}, \ell = \omega = {0,1}.
Please check out the attachment:smile: What i don't understand is the v and...
\lambda is according to definition a empty string - that is, the string consisting of no symbols taken from \Sigma.
\{ \lambda \} \neq \emptyset because | \{ \lambda \} | = 1 \neq 0 = | \emptyset | .
\parallel w \parallel[/itex] = the length of w, and \parallel \lambda...
Well.. the problem is that i'm totally stuck. I have no idea what to do.. I've red the chapter over and over, checked several math websites, forum and so on.. :cry:
It seems to me that people find it difficult to solve this no matter math skills :rolleyes:
So if you don't want to help me...
Let \Sigma = { \beta,x,y,z} where \beta denotes a blank, so x\beta \neq x, \beta \beta \neq \beta, and x\betay \neq xy but x \lambday = xy.
Compute each of the following:
1: \parallel \lambda \parallel
2: \parallel \lambda \lambda \parallel
3: \parallel \beta \parallel
4...
Let \Sigma = { \beta,x,y,z} where \beta denotes a blank, so x\beta \neq x, \beta \beta \neq \beta, and x\betay \neq xy but x \lambday = xy.
Compute each of the following:
1: \parallel \lambda \parallel
2: \parallel \lambda \lambda \parallel
3: \parallel \beta \parallel
4...