##### how to make a minimal deterministic finite atomation from regular expression

how to make a minimal deterministic finite atomation from regular expression.

eg (0+1)*(10) dfa of this?????

how to make a minimal deterministic finite atomation from regular expression.

eg (0+1)*(10) dfa of this?????

yr koi rply kr deo. m try to understand TOC grammar many time but its ........

@karmjitjoshi R.E is (0+1)*(10)

It is saying that DFA must end with 10.

Always try to derive some strings with the help of regular expression given.

Here some of the strings are as : {10, 010, 110, 010, 0110, 1010,1110,.....}

Now try to draw DFA,

Plz let me know if you have any doubt.

how to identify what the expressionmeans? like in above examples expression mean it end with 10.how to understand expression ?

(0+1)*0011(0+1)*+(0+1)*1100(0+1)* what this will be?/

nd thx sumitverma sir

(0+1)*0011(0+1)*+(0+1)*1100(0+1)* means string will contain either 0011 or 1100.

it mean which is not in () that contained by string?

Please do not take it wrong.

See, (0+1)*0011(0+1)*+(0+1)*1100(0+1)* has two cases, I am taking first one.

says that string can start will any symbol 0,1(Any combination of 0,1) as well as string can end with any symbol 0,1 (Any combination of 0,1) but in between, there must be a sequence as 0011.(0+1)*0011(0+1)*Example; {0011, 000110, 00001100111111,....}

(0+1)*(00(0+1)*11 mean start with any combination then

00again any combination nd end with11.like(11001111, 00001011.....) m right sir?@karmjitjoshi Taking this as (0+1)*00(0+1)*11, yes you are right.

thnku sir now m understand. thanku very much