FLA_Unit I_FA

123456789101112131415
Across
  1. 3. table in which we demonstrated the source states and end states after generating the transitions in a tabular form.
  2. 5. Q * Σ -> Q
  3. 7. the operator ‘*’ represents
  4. 8. combination of a finite number of letters from the alphabet
  5. 10. nodes represents
  6. 11. if we reach on a state where machine can’t move further to its final state, then this state is called _______ state
  7. 13. finite state machine is a ______ tuple machine
  8. 14. Represent the start of the machine
  9. 15. When it is not fixed that with a specific input where to go next on which state, then it is called?
Down
  1. 1. ε (epsilon) represents __________
  2. 2. finite non-empty set of symbols or letters
  3. 4. ______________ language is strict with its rules
  4. 6. An application of Finite Automaton
  5. 9. Represents the reading of the alphabets from the finite state machine
  6. 12. For each symbolic representation of the alphabet, there is only one state transition in?