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 wrote a program which can generate DFAs. But the DFAs are slightly incorrect. That is, sometimes they can’t accept the correct strings.
My question is: is there any algorithm can correct the DFAs, so that they can accept the given correct strings?
More formally,
Suppose DFA D doesn’t accept string str.
Need an algorithm A, s.t. D’ = A( D, str) and D’ accepts str
You could represent the additional string(s) you want to accept as chain automata and then simply take the union of these chains with the DFA D. Afterwards you may also need to determinize the unioned machine.