Question: 1. Draw a deterministic finite automata which accepts string over the alphabet {a,b} which don't contain the substring aa. So for example the strings: ,

1. Draw a deterministic finite automata which accepts string over the alphabet {a,b} which don't contain the substring aa. So for example the strings: , aba, bbabba would be in this language. Then write down this automata formally using our 5-tuple notation.

2. Argue using the pigeonhole principle, that any time your automata above accepts a string longer than some fixed length, it must repeat a state. For the automata you drew, what is this fixed length?

I need the answer of question 2 only., thank you so much!!

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!