Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Modern Database Management

Authors: Heikki Topi, Jeffrey A Hoffer, Ramesh Venkataraman

13th Edition

0134773659, 978-0134773650

More Books

Students also viewed these Databases questions

Question

If the r.v. X ( 0 and f X d = 0, then show that (X ( 0) = 0.

Answered: 1 week ago