A finite state machine.

  • Thread starter prevail
  • Start date
  • #1
17
0
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.. ?
 

Answers and Replies

  • #2
matt grime
Science Advisor
Homework Helper
9,395
4
0 is 0, 0 is not 'infinite'.
 
  • #3
17
0
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..)
 

Related Threads on A finite state machine.

  • Last Post
Replies
1
Views
5K
  • Last Post
Replies
9
Views
2K
Replies
1
Views
472
M
Replies
17
Views
6K
Replies
0
Views
2K
  • Last Post
Replies
0
Views
2K
  • Last Post
Replies
6
Views
784
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
6
Views
3K
Top