Home > Theory Of Computation > DFA Example : Consider he Following DFA And Count The Number Of All The String Accepted By DFA Which Have Length 5

DFA Example : Consider he Following DFA And Count The Number Of All The String Accepted By DFA Which Have Length 5

Consider The Following DFA And Count The Number Of All The String Accepted By DFA Which Have Length 5

 

a) 29 b) 64 c) 26 d) 21

First Path Is You Have To See How Many Paths We Have To Reach Final State From Starting State.

15+7+4=26 Strings Are Possible.

 

8 thoughts on “DFA Example : Consider he Following DFA And Count The Number Of All The String Accepted By DFA Which Have Length 5

Leave a Reply