Automata Theory

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