Draw a DFA for words ending with two a's only, that is 'aa', over the alphabet {a,b}.

Draw a DFA for words ending with two a's only, that is 'aa', over the alphabet {a,b}.

From the BUET MSC (CSE) 2018 – Written exam, question 4 of 15.

More from this paper

Previous: Why left recursion has to be eliminated to build a parser?
Next: What will be the output of this following program? #include<stdio.h> #include<string.h> int main(int argc, const char *argv[]){ int…
All questions in BUET MSC (CSE) 2018 – Written