search
Log In
0 votes
35 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.
in Theory of Computation 35 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
14 views
Give an algorithm to tell for two regular languages $L_{1}$ and $L_{2}$ over the same alphabet $\sum,$ whether there is any string in $\sum^{*}$ that is in neither $L_{1}$ nor $L_{2}.$
asked Apr 6, 2019 in Theory of Computation Lakshman Patel RJIT 14 views
0 votes
0 answers
2
0 votes
0 answers
4
...