Is every infinite language the complement of a finite language?
Answers
Answered by
2
Indeed, for every non-empty finite set the language is regular and infinite. The fact that every finite language is regular answers your first question, as Hagen pointed out in the comments: if is a finite language, and is any language, then F ∩ L is a finite language and therefore regular.
Similar questions
Math,
7 months ago
English,
7 months ago
Computer Science,
1 year ago
Computer Science,
1 year ago
Science,
1 year ago