TCS-ISE1 TE-AI&DS

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