I realize that the DFA is countable since the DFA for specific language is the subset of all DFAs. Just wonder how to prove that the number of DFAs accept specific language is infinite?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I realize that the DFA is countable since the DFA for specific language is the subset of all DFAs. Just wonder how to prove that the number of DFAs accept specific language is infinite?
Take any DFA for your language. It must contain some other cycle/loop. Add a new set of states corresponding to the cycle, and allow this set of states to represent odd-numbered passes through the cycle/loop (the original states represent even passes). If necessary, add nondeterminism and use the powerset construction to turn the NFA back into a DFA.
Either way, you end up with a DFA for the same language that has more states.