Across
- 3. The smallest unit of input to an automaton.
- 5. The process of reducing the number of states in an automaton
- 8. output depends on both present state and input symbol
- 9. The condition where no input leads to acceptance
- 10. - The set of all strings over an alphabet
- 12. Mathematical model of computation with states and transitions
- 13. Machine for context sensitive grammar
- 14. The heirarchy of languages
- 15. Unrestricted grammar machine
Down
- 1. Type of automaton used to recognize regular languages
- 2. To find the language is not regular
- 4. A grammar type where production rules are of the form A → aB or A → a
- 6. finite automata with stack
- 7. One of the properties on regular sets
- 9. one transition for a state with the input symbol
- 11. Machine for context free grammar
- 14. the length on LHS is <= the length on RHS