Question

draw determininistic finite automataof a language-{w|w has an even number of a's and one or two b's}}

Answer 1

GOOGLE it :P

Answer 2

which is the final state here?? the state which has +-, that one?

Answer 3

yes

Answer 4

+ is for final , and - is for start state , in this +- is both , start as well as end state , hope so it will help u out

Answer 5

even no. of a's and one or two b's--- so a string can be "aaaab" ,"bbaa".In this case i think this strings are not accepting .Here only "abba" or"aaabba" or "baa" are accepting, again here "babba" is creating which is not acceptible

Answer 6

try this

Answer 7

aktly this one , previous is not valid for aaabba, i thnk now it will work

Answer 8

aababaaa...check this one

Answer 9

check this one , n telme is it working for all strings or not having even a's and 1 or 2 b;s???

Answer 10

thnx really, u did a grt job.Finally the strings of tht condition are accepted as per as i am concerning.

Answer 11

can u plzz check whether its correct or not? i found this one from ur previous dfa.

Answer 12

no its not correct , aktly its not dfa , its ndfa non-detrminstic fa , dfa 4 ur lang is the last one i posted

Answer 13

sry, yes you are right.its NFA.thnx you really.last one was shortest DFA

Answer 14

:-)