Question: prove that k state FSA accept an infinite language iff it accept at least one string of length between k and 2k. hint: this is

prove that k state FSA accept an infinite language iff it accept at least one string of length between k and 2k. hint: this is two part proof (LR and RL)

I am looking for precise proof. please answer it if you know it completely.

Thanks

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!