FLA_Unit I_FA

3. table in which we demonstrated the source states and end states after generating the transitions in a tabular form.
5. Q * Σ -> Q
7. the operator ‘*’ represents
8. combination of a finite number of letters from the alphabet
10. nodes represents
11. if we reach on a state where machine can’t move further to its final state, then this state is called _______ state
13. finite state machine is a ______ tuple machine
14. Represent the start of the machine
15. When it is not fixed that with a specific input where to go next on which state, then it is called?

1. ε (epsilon) represents __________
2. finite non-empty set of symbols or letters
4. ______________ language is strict with its rules
6. An application of Finite Automaton
9. Represents the reading of the alphabets from the finite state machine
12. For each symbolic representation of the alphabet, there is only one state transition in?