TCS-ISE1 TE -AI&DS

Edit Answers
12345678910
Across
  1. 1. LEMMA The process of proving a language is not regular
  2. 3. Machine where output depends only on current state
  3. 6. The set of all strings over an alphabet
  4. 8. A deterministic model that accepts or rejects strings
  5. 9. PROPERTIES Property stating that regular languages are closed under union, concatenation, etc.
  6. 10. Symbol that represents “no symbol” or empty transition
Down
  1. 2. The process of reducing a DFA to the smallest number of states.
  2. 4. EXPRESSION The algebraic notation to describe regular languages
  3. 5. The machine type where output is associated with transitions
  4. 7. STAR Operation that repeats a language zero or more times