Register

Toc infinite language upper bound

976 views
1 1 vote

What should the maximum length of string that we should check in order to say whether language is finite or infinite.?

I asked the related question sometime back but didn't get satisfactory answer.https://gateoverflow.in/104257/toc-finite-automata-infinite-language

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · TOC Infinite languag...Next → · Permutations
← Previous in category · TOC Infinite languag...Next in category → · TOC Linear grammer
Position:
Show:

Related questions

1 1 vote
0 0 answers
866
866 views
rahul sharma 5 asked Jul 31, 2017
866 views
TOC Infinite language
If FA has length n and accepting the string of more than n,then can i say that it must accept the string of length less than n also?
2 2 votes
1 1 answer
2.9k
2.9k views
rahul sharma 5 asked Jan 12, 2017
2,921 views
[TOC] Finite automata Infinite language
Some one please explain these two theorems,I am struggling a lot here.
1 1 vote
0 0 answers
4.7k
4.7k views
MiNiPanda asked Nov 30, 2018
4,719 views
Condition for regular language to be infinite
Given M = (Q,Σ,δ,q0,F) a DFA with n states. Prove:The language L(M) is infinite iff it contains a string with length t, where n ≤ t < 2n.Please provide a prove. I am not ...
0 0 votes
2 2 answers
623
623 views
Shivani gaikawad asked Jun 6, 2018
623 views
Toc deterministic infinite automaton