0 votes 0 votes 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. Theory of Computation ullman theory-of-computation regular-language descriptive + – admin asked Apr 6, 2019 • retagged Apr 6, 2019 by Lakshman Bhaiya admin 261 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.