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.. ?
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...
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...
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...