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
how long would it take if a submarine if it goes 3 feet per minute to get to 20000 answer

Calculate the edges in an undirected graph along with two vertices of degree 7, four vertices of degree 5, and the remaining four vertices of degree are 6? Ans: Total degree of

Convert measurements between the English system? To convert measurements between the English system and the metric system: 1. Look up the conversion between the two units of

find the coordinates of points of tri-section of the line joining the points (-3,0) and (6,6).

Demonstrate that Dijkstra's algorithm does not necessarily work if some of the costs are negative by finding a digraph with negative costs (but no negative cost dicircuits) for whi

theory about solving sequencing problem using graphical method

Variable stars are ones whose brightness varies periodically. One of the most visible is R Leonis; its brightness is modelled by the function where t is measured in days.

how you know that your first quadrilateral is an isosceles trapezoid

Jocelyn has 6 birds, Their mean age is 10. The mode of their ages is 8. What might their ages be? Show your work.

Laws of Set Algebra From the given Venn diagram where T is the universal set and A its subset that we can deduce a number of laws as: i. A υ Ø = A ii. A υ T = T