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
A survey of 400 of recently qualified chartered Accountant revealed that 112 joined industry, 120 stated practice & 160 joined the firms of practicing chartered accountants as paid

The volume of grains in a silo at a particular time (measured in hours) is given by V (t) = 4t(3-t) m3. Find the rate of change of the volume of grains in the silo from first princ

Kara brought $23 with her when she went shopping. She spent $3.27 for lunch and $14.98 on a shirt. How much money does she have left? The two items that Kara bought must be sub

QUESTION (a) Draw a graph model with the following adjacency matrix.                         (b) The diagram below shows different cities labelled a to g and z. Also sh

The augmented matrix from a system of linear equations has the following  reduced row-echelon form (a)  How many equations are there in the system?  (b)  How many variab

write as a percent 6/10

1) let R be the triangle with vertices (0,0), (pi, pi) and (pi, -pi). using the change of variables formula u = x-y and v = x+y , compute the double integral (cos(x-y)sin(x+y) dA a

A man invest ?13500 partly in shares paying 6% at ?140 and partly in 5% at 125.If he is tolal income is 560, how much has he invested in each?

1. Using suffix trees, give an algorithm to find a longest common substring shared among three input strings: s 1 of length n 1 , s 2 of length n 2 and s 3 of length n 3 .