Question: 1. Let L be a regular language. Is the corresponding DFA unique? 2. Given any DFA with exactly one accept state, must it always recognize
1. Let L be a regular language. Is the corresponding DFA unique?
2. Given any DFA with exactly one accept state, must it always recognize a finite language?
Please judge the answer and explain , thanks!
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
