Solve the following problem. Please write your answer in readable and clean form

Question

Solve the following problem. Please write your answer in readable and clean form Consier a set of simbols Sigma = {a, b} Find all strings in Sigma* shorter than 3. Let L = {lambda, a, bb}. Is L a language on Sigma? Why? Write L degree and L^3 What language does the grammar with the following productions generated? Write the language. S rightarrow AB A rightarrow b A a/ba B rightarrow Bb/lambda Find a grammar that generates language L = {b^n:n greaterthanorequalto 0}. Find a grammar that generates language L = {b^m a^n m, n greaterthanorequalto 10}. Find a grammar that generates language L = {b^n + 2 a^n: n greaterthanorequalto 0 Draw a transition graph for the dfa M = {Q, Sigma, delta, q_0.F). where Q = (q_0, q_1, q_2), Sigma = {a, b}, F = {q_0, q_2} and delta is definded as S(q_0, a) = delta(q_0, b) = delta (q_1, b) = q_2 delta (q_2, a) = q_2, delta (q_2, b) = q_2 Give the language accepted by the above dfa.

Explanation / Answer

Answer (1)

(a)

strings shorter than 3 are : , a, b, aa, bb, ab, ba

(b)

No, because this language will not generate string 'b' which is generated by

(c)

L0 =

L3 = { abb, bba }

Answer (2)

grammer: ba(b*a*)b*

Answer (3)

a)

S-> bS |

b)

S-> bSa |

S-> bS | Sa

c)

S-> bbSa|

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.