Skip to main content
Computer Science

Return to Question

edited title
Link
xskxzr
xskxzr
  • 7.6k
  • 5
  • 23
  • 47

Prove: If finite automata $M$M with $k$k states accepts a string with at least$ $kleast k characters, then the language $LL(M$M) is infinite

Tweeted twitter.com/StackCompSci/status/1171438402475982848
added 8 characters in body; edited title
Source Link
J.-E. Pin
J.-E. Pin
  • 6.2k
  • 20
  • 38

Prove: If finite automata M$M$ with k$k$ states accepts a string with at least kleast$ $k characters, then the language L$L(MM$) is infinite

I need to prove that if finite automata M$M$ with k$k$ states accepts a string with at least k$k$ characters, then the language L(M)$L(M)$ is infinite. I have no idea where to start. Any suggestions?

Prove: If finite automata M with k states accepts a string with at least k characters, then the language L(M) is infinite

I need to prove that if finite automata M with k states accepts a string with at least k characters, then the language L(M) is infinite. I have no idea where to start. Any suggestions?

Prove: If finite automata $M$ with $k$ states accepts a string with at least$ $k characters, then the language $L(M$) is infinite

I need to prove that if finite automata $M$ with $k$ states accepts a string with at least $k$ characters, then the language $L(M)$ is infinite. I have no idea where to start. Any suggestions?

Source Link
Torppo
Torppo
  • 29
  • 1

Prove: If finite automata M with k states accepts a string with at least k characters, then the language L(M) is infinite

I need to prove that if finite automata M with k states accepts a string with at least k characters, then the language L(M) is infinite. I have no idea where to start. Any suggestions?