InterviewSolution
Saved Bookmarks
| 1. |
A regular language corresponds to __________(a) An alphabet(b) Set of strings over an alphabet(c) A DFA only(d) A DFA or an NFA |
|
Answer» Right answer is (b) Set of strings over an alphabet To explain: A regular grammar takes in all strings over an alphabet. |
|