GATE CSE
First time here? Checkout the FAQ!
x
0 votes
91 views
If n state finite automata accespts infinite language then what is the length of min, and max. cycle?
asked in Theory of Computation by Boss (5.9k points)   | 91 views
Min :2 ; Max: n ?
if there is a self loop minimum should be 1 and max=n. ??
I dont have the exact answer,Read this questions somewhere:(
Can we call self-loop a cycle?
all cycles are loops and loop is self and non self also.
min - 1

max - no limit since this is infinite language

1 Answer

0 votes
if there is no self loop.

then min.-N   and max.-2N-1
answered by Junior (871 points)  
Can you please provide some valid reason for this answer to understand?
Your answer is right as i got some theorem related to this.Request you to please explain.
I have added theorem here:-http://gateoverflow.in/104257/toc-finite-automata-infinite-language
you should go through pumping lemma theorem.

take any example- N=4

try all possibility of loops except self loop THEN you 'll get it.
I tried on this,please confirm

Say I have four states a,b,c,d in my machine now after traversing from a to d ,the string went back to some state(start state),means as of now it is not accespted,now when it again come to d,we came to know that some loop has been pumped.Is it correct understanding?

But then when i went from a->d and then came to a,isnt it sufficient to say that we have a loop,?Why do we want to enter final state again.Please explain once .I have gone through pumping lemma theorem ,but this is best i could think as of now:(


Top Users Jul 2017
  1. Bikram

    3946 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1842 Points

  4. joshi_nitish

    1650 Points

  5. Arjun

    1268 Points

  6. Hemant Parihar

    1184 Points

  7. Arnab Bhadra

    1100 Points

  8. Shubhanshu

    1052 Points

  9. Ahwan

    900 Points

  10. rahul sharma 5

    692 Points


24,016 questions
30,946 answers
70,303 comments
29,333 users