Across
- 2. for every DFA there exists a corresponding RE
- 5. lemma used to prove that language is NOT Regular
- 7. If you create DFA for this language then it is _______
- 9. used to represent Regular language in short
Down
- 1. union of two regular languages is ____
- 3. for every RE there exists a DFA
- 4. More poerful than DFA and uses stack for implementaion
- 6. zero or more transitions allowed but no exclusive ^ transitions
- 8. every symbol has exactly one transition from each state