regular languages section closure property

StackOverflow https://stackoverflow.com/questions/21505629

Question

Let L be a language and R an infinite regular one. If L intersection R is a regular language, then L is a regular one too?

Was it helpful?

Solution

No. Let L = {1^p: p is prime} and R = {1^(2n) : n belongs to N}.

Source

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top