Homework_7

# Homework_7 - 2 | 1 | 1 n n n n L a b n a b a n b = ≥ ≥...

This preview shows page 1. Sign up to view the full content.

Theory of Computing Homework 7 CS 3810, Fall 2009 Due Friday, October 23 General guidelines: You may work with other people, as long as you write up your solution in your own words and understand everything you turn in. Make sure to justify your answers—they should be clear and concise, with no irrelevant information. Each problem should be submitted on a separate piece of paper. Please put your netid on your homework! 1. What is the difference between the language { } 1 | 1 * n n L a b n = and the language
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: { } { } 2 | 1 * * | 1 * * n n n n L a b n a b a n b = ≥ ≥ I ? Explain in words and also give a string that is in one of the languages but not in the other. 2. Let { } | where there are n blocks of a's n n n n n n L a b a b a b = L . Express L as the intersection of two context-free languages. Give context-free grammars for each of the two languages. 3. Write a context-free grammar for the complement of the language ( ) { } | * L ww w a b = ∈ + 4. 6.2.1 (c) 5. 6.2.3 (b)...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online