1 2 5 points Myhill Nerode Versus The Pumping Lemma Consider the language F a i

1 2 5 points myhill nerode versus the pumping lemma

This preview shows page 1 - 2 out of 2 pages.

!1
Background image
2(5 points)Myhill-Nerode Versus The Pumping Lemma.Consider the languageF={aibjck|i, j, k0and ifi= 1,thenj=k}over the alphabet{a, b, c}.1. (2 points) Show thatFis not regular.2. (2 points) Show thatFacts like a regular language in the standard pumping lemma (slide 3, lecture 4). In otherwords, give a pumping lengthpand demonstrate thatFhas the three properties guaranteed by the pumpinglemma for this value ofp.3. (1 point) Explain why parts (a) and (b) do not contradict the standard pumping lemma.3(1 point)Streaming AlgorithmsRecall the Distinct Elements problem from lecture: we have ann-element data streamx:= (x0, . . . , xn-1)in which each elementxiis not a bit, but rather an element of the universeU={1, . . . ,2k}.When the streamxends, the goal is to output the number of distinct elements inx. We noted that Distinct Elementscan be computed using a trivial streaming algorithm which usesn×kbits of memory (storing the entire stream).Show that Distinct Elements can also be computed using a streaming algorithm which usesO(2k+ logn)bits ofmemory. You do not have to give formal proofs – just give the algorithm and explain informally how they work.4(3 points)Communication ComplexityIn this problem, letnbe a power of two for simplicity.Recall from lecture thedistributed version of the majority problem: for any integern1andx, y∈ {0,1}n,MAJORITY(x,y)= 1⇐⇒the number of1’s inxyexceeds the number of0’s.Prove that for alln= 2k, the communication complexity of MAJORITY onn-bit strings is at leastk= log2n.That is, the simple communication protocol for MAJORITY given in class is essentially optimal! (Again, you don’thave to be super-rigorous here; your answer will be perfectly fine if its formality is at the same level as our proof inclass of the communication lower bound for EQUALS.)2
Background image

You've reached the end of your free preview.

Want to read both pages?

  • Fall '19

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Stuck? We have tutors online 24/7 who can help you get unstuck.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes