Q. A state from which a deterministic finite state automata can never come out is called a____________. (Solved)
1. trape state
2. starting symbol
3. transition table
4. transition diagram
- a. trape state
1. trape state
2. starting symbol
3. transition table
4. transition diagram