Question
In an automata or formal-language problem, which option best represents complement of a regular language?
Select an option. Your answer will be checked instantly.
Correct Answer: B. all strings over the alphabet not in the language
Explanation:
In this course context, complement of a regular language means all strings over the alphabet not in the language.
Leave a Reply