computer science

posted by .

Prove that the following language is not context free:
L = {a^3^n : n >= 0}

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. English

    Let's write down what you can do with the computer. 1. I use the computer to chat with netizens in chatrooms. 2. I use the computer to do paper work. 3. I use the computer to make documents with the word processor, Excel. 4. I use …
  2. Computer(Math)

    Let C { x#y| x,y ∈ {0,1}* and x ≠ y} show that C is a context free Language...
  3. computer science

    write a program to select the classes that you are taking(Ex. Computer Science) .When the button is clicked, the program should print the names of the computer language studied. If no, check boxes have been selected, the sentence "No …
  4. Science

    How do I read this: "Robotic" World of Computer Science. Gale, 2002. Gale Science in Context. web 8 Aug. 2012. i know this is a ciation but I need to incorporate it into asummary paragraph
  5. Computer Science

    I need some help about Turing Machines, and prove by reductions. Here are the 2 questions: 1. Sketch the construction of a Turing Machine that decides the language L = a^i where i is not prime. 2. Show that the language 2Strings is …
  6. Theory of Computation- Math - Context free grammar

    Write a context-free grammar for the following language. Start with an English statement of the language, and give five good strings. x1#x2# .. #xk, k ≥ 1, for some i and j: xi = xj^R, Σ = {a, b, #} (notes: xi’s contain …
  7. Computer Science

    Define a language that is not a regular language using a context-free grammar that is not ambiguous. The alphabet of the language must contain at least five characters. Describe in English the strings of the language. Choose any string …
  8. Computer Science

    Define an unambiguous context free grammar that generates the language of strings containing a series of a's followed by a series of b's followed by a series of c's concluding with a series of d's. The number of a's must be exactly …
  9. Computer Science (please help )

    Prove that if A is any language over the alphabet {0}, then A* is regular.
  10. Computer science

    Show that L2 = {a^n b^m c^max(n,m) d^min(n,m)} | m, n ≥ 0} ∈/ Context Free

More Similar Questions