regular languages section closure property

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

문제

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?

도움이 되었습니까?

해결책

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

Source

라이센스 : CC-BY-SA ~와 함께 속성
제휴하지 않습니다 StackOverflow
scroll top