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