Hi,If you want to create a DFA for ab*a*, then instead of going out and finding one on the internet, how about just sitting down and creating one yourself?
A proper DFA needs to show all transitions, so there needs to be an arrow leaving each state for each symbol in the input alphabet.
What is the shortest string that is in the language ab*a*? Does that DFA accept that string?
Is the string "ab" in that language? Does that DFA accept that string?
How many states does this DFA have?
Will this DFA accept the string "abab"? Is that string in the language ab*a*?
Yes it would accept abab and abab is not in the language. I have converted it into NFA, if its wrong please show me the correct one because I have spent the enough time.How many states does this DFA have?
Will this DFA accept the string "abab"? Is that string in the language ab*a*?
Yes it would accept abab and abab is not in the language. I have converted it into NFA, if its wrong please show me the correct one because I have spent the enough time.
Zulfi.View attachment 190741
Hi,Yes, that is an NFA that will work.
Now convert that to a DFA.