Compute the regular expression, Mathematics

1. Consider the following context free grammar G with start symbol S (we write E for the empty string, epsilon):

S ---> bB | aSS

A ---> aB | bAA

B ---> E | bA | aS

a. Describe L(G), i.e. complete the following definition: L(G) = { w ∈ {a, b}* | ...

b. Show that G is ambiguous.

2. Give a context free grammar for regular expressions over the alphabet Σ = {0, 1}.

Use the definition of a regular expression given on page 64 of the text.

3. Let L1 and L2 be regular languages and let L = {xy | x ∈ L1 and y ∈ L2 and |x| = |y|}.

a. Is L regular? Answer clearly YES or NO and justify/prove your answer.

b. Is L context free? Answer clearly YES or NO and justify/prove your answer.

4. Let L = {w ∈ {0, 1}* | (the number of 0's in w) mod 3 = 2}. Give a state diagram in the style of the text for a TM that recognizes, but does not decide, L.

5. Turing machines can be considered computers of functions and not just accepters of strings. The function parameter or input is what is written on the tape when the TM starts and its value or output is what is written on the tape when it halts. If it does not halt, the function it computes is not defined for that particular parameter.

Consider the function f(n) = 8n + 5. Assume that n is written on the tape in binary (just 0's and 1's, perhaps with leading 0's) and that the value computed is also written in binary. We don't care whether the value computed has unnecessary leading 0's or not. All numbers are considered unsigned.

Describe at a high level a TM to compute this function.

6. Let L = { | R is a regular expression describing a language that contains at least one string with the substring 111}.

Show that L is decidable.

Questions are shown in the order received.

1. Q: Should here be a * after the {0, 1} in question 2?

A: No. S is an alphabet, not a language. When we speak of a string over S that is the same as saying a string in S*

2. Q: In question 3, does "the number of 0's in w mod 3 = 2" mean you count the 0's in the string and mod that number by 3?

A: Yes. I've now put parentheses around part of it to make it clear; as in: (the number of 0's in w) mod 3

Posted Date: 3/6/2013 4:22:21 AM | Location : United States







Related Discussions:- Compute the regular expression, Assignment Help, Ask Question on Compute the regular expression, Get Answer, Expert's Help, Compute the regular expression Discussions

Write discussion on Compute the regular expression
Your posts are moderated
Related Questions
Mike sells on the average 15 newspapers per week (Monday – Friday). Find the probability that 2.1 In a given week he will sell all the newspapers


1. Using given data set (Assignment_1data in the folder) a) Make scatterplot between "Years since first marriage" and "Total children ever born" b) Make scatterplot between

y= -3x tell if it is linear or not. our teacher wants it graphed or something.

Properties of Vector Arithmetic If v, w and u are vectors (each with the same number of components) and a and b are two numbers then we have then following properties. v →

Two tanks initially contain 100 liter liquid each. Their initial concentration are listed in the Figure below. At time zero, the input and output valves are opened simultaneously w

in a class of 55 students, 35 take english, 40 take french, and 5 take other languages.present this information in a venn diagam and determine how many students take both languages

how to round off 42,999,523

Mathematical Problem Solving In 1945, mathematician George Polya (1887-1985) published a book titled How To Solve It in which he demonstrated his approach to solving problems.

Laura has a rectangular garden whose width is x 3 and whose length is x4. In terms of x, what is the area of her garden? Since the area of a rectangle is A = length times widt