Across
- 3. Type-3 grammar representing regular languages
- 5. Church-_____ Thesis: foundation of computability
- 6. Type of language accepted by a Pushdown Automaton
- 9. Machine that accepts regular languages
- 10. Mathematical model of computation using states and transitions
Down
- 1. Used to prove that a language is not regular
- 2. Famous undecidable problem related to Turing Machines
- 4. Temporary memory used by Pushdown Automata
- 7. Set of input symbols a machine can read
- 8. A problem for which no algorithmic solution exists