0 votes
21 views
Give an algorithm to tell whether a regular language $L$ is infinite. Hint$:$Use the pumping lemma to show that if the language contains any string whose length is above a certain lower limit, then the language must be infinite.
| 21 views

0 votes
0 answers
1
0 votes
0 answers
2
0 votes
0 answers
3
0 votes
0 answers
4