: Draw deterministic finite automata of the following languages over alphabets {a, b} and also give regular expression.

i. The language of all strings containing even number of a’s and each a is followed by at least one b.

Question

: Draw deterministic finite automata of the following languages over alphabets {a, b} and also give regular expression.

i.	The language of all strings containing even number of a’s and each a is followed by at least one b.

anonymous · Answer

please help

anonymous · Answer

r u learning frm http://www.csc.kth.se/utbildning/kth/kurser/DD2372/automat10/old-exam-problems.pdf

anonymous · Answer

no. but can you help me with this question ?

anonymous · Answer

What is it that you need help with? Where are you stuck at? Here are a few links to get you started http://en.wikipedia.org/wiki/Deterministic_finite-state_machine#Example Are you needing to program this in c/c++?? http://www.daniweb.com/software-development/c/threads/100090

anonymous · Answer

no i don't have to program this. I just have  to draw the DFA which i'm unable to. I have made separate DFA's for even number of a's and each a followed by b but i'm unable to combine them. Please can you draw the dfa here ?

anonymous · Answer

the regular expresion can be somthing like this:

(b*abb*abb*)* , am not sure, but i think i cosidered all cases, still i can left some cases, hope it helps u. Transforming that to an DFA its simple, if i remember when i saw this u just need to follow some deterministic steps.