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
prove that every non-trivial ingetral solution (x,y,z)of the diophantine equation Xsquare +Ysquare=Zsquare satisfies gcd(x,y)=gcd(x,z)=gcd(y,z)

In the adjoining figure a dart is thrown at the dart board and lands in the interior of the circle. What is the probability that the dart will land in the shaded region. A


example with solution of quadratic polynomial

SQUARE 12 IN

In a periscope, a pair of mirrors is mounted parallel to each other as given. The path of light becomes a transversal. If ∠2 evaluate 50°, what is the evaluation of ∠3? a. 50°

Q. What is the probability of tossing a head? List the sample space for tossing a coin once. What is the probability of tossing a head? Solution:  If you tossed a coin once

How to Dividing Rational Expressions ? To divide two fractions, or rational expressions, keep in Mind that division is the same as multiply by the Reciprocal of the second fra

weather prediction on monsoon past data on project

Pre-operational Stage :  This period of a child's cognitive development usually begins at the age of 2, and lasts until about the age of 6. Thus, it usually coincides with the pre