CT Module1
Across
- 3. The theorem used to solve regular expression equations
- 4. Study of abstract machines and formal languages
- 6. Property indicating a problem can be solved by an algorithm
- 9. Epsilon acts as this element for concatenation
- 11. A finite sequence of symbols from an alphabet
- 13. Method to convert NFA to DFA
- 15. Operation representing L1 ∪ L2
- 16. Set of all possible strings over an alphabet
- 18. Number of symbols in a string
- 20. The theoretical foundation of computer science
- 21. Symbol commonly used to denote an alphabet
- 23. Operation that joins two strings or languages end to end
- 24. Operation that allows zero or more repetitions of a language
- 25. A finite non-empty set of symbols used to form strings
- 27. A set containing no elements
- 29. Technique used to prove that a language is not regular
- 31. A language that can be expressed by a regular expression
- 32. Property that ensures result remains regular after operations
- 33. Decision property that checks whether a language contains no strings
- 34. Deterministic finite automaton
- 35. Operation representing L1 ∩ L2
Down
- 1. Mathematical notation used to describe regular languages
- 2. Closure property where all strings not in the language are included
- 5. Condition when a string is recognized by an automaton
- 7. Function that defines state changes in an automaton
- 8. A set of strings over an alphabet
- 10. Property of regular operations over union
- 12. Process of reducing number of states in a DFA
- 14. Nondeterministic finite automaton
- 17. Property satisfied by union and concatenation
- 19. The empty string
- 22. Abstract machine that recognizes regular languages
- 26. Decision problem of checking whether two regular languages are equal
- 28. Operation L1 minus L2
- 30. Decision property that checks whether a string belongs to a language
- 31. Operation that reverses all strings of a language