Let L be the set of all strings that are not in the English language. Is L regular?
From textbook, would like some help?
Someone recommended to me to think about how regular and regular languages are closed under complement. I am not sure what he means and how this helps me.
Also strings are a series of letters not broken up by spaces. So a string cannot be a sentence, it has to a be a group of letters. I hope this clarifies any confusion.