Home > Theory Of Computation > DFA Example : Consider The Following DFA And Find Out How Many Strings It Accepted Of Length ‘7’ Which Start From 10

DFA Example : Consider The Following DFA And Find Out How Many Strings It Accepted Of Length ‘7’ Which Start From 10

Consider The Following DFA And Find Out How Many Strings It Accepted Of Length ‘7’ Which Start From 10

a) 16 b) 32 c) 48 d) NONE

Solution:-

Question Is Seven Length _ _ _ _ _ _ _

Starts With 10

First Two Bits I Cant Change, 10 Will Be There.

Lets See In Diagram Where I’m Reaching By Starting With 1 0

 

I’m Reaching To ‘q2

I Already Accept 10 On ‘q2

Question Asked Is Length ‘7’

This Is Not Length  Seven(7)

This Is Length ‘2’

To Complete Length ‘7’

If You Observe ‘q2‘, It Has Self Loop Means, We Can Get 0 To 1

 

How Many Combinations I Can Create With 5 Bits.

25

25

Strings Are Possible With DFA Given Which Starts With 10

25=32

 

Leave a Reply