1 votes 1 votes 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? Theory of Computation theory-of-computation finite-automata + – rahul sharma 5 asked Jul 31, 2017 rahul sharma 5 563 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Jul 31, 2017 reply Follow Share yes, true.. 0 votes 0 votes rahul sharma 5 commented Jul 31, 2017 reply Follow Share I used the logic:- If language is infinite ,surely there is loop in between somewhere.And i will not take the loop and my min. string of length max n-1 will be accepted.max n-1 means last state is final.If some state before that is final then it might be less than n-1.Is it correct reasoning? 0 votes 0 votes Please log in or register to add a comment.