Find an NFA that accepts the language Li sigma 0 1 L1 0 0 0

Find an NFA that accepts the language Li, sigma = {0, 1} L_1 (0 0* (0 1 + 0)*) 3.1.13 (P76 of Linz\'s book) Construct a right-linear grammar for the languages: L_2 = {a^n b^n : n greaterthanorequalto 1, m greaterthanorequalto 2} Write a regular expression for the language accepted by the following automaton. (Q_0 is an initial and Q_1 is a final state) sigma = {a, b, c} Find Regular Expressions for the following languages. L_3 = {w: Na (w) mod 3 > 1} sigma = {a, b, c} L_4 = {all strings that do not begin with \"aa\"} = {a, b}

Solution

Answer:

4) To find a regular expression from a given DFA , we need to follow the rules as :

Now if we analyze the given DFA , one transition out of two will be removed. So there will be only one transition from start to final state with a , b , c

It will be generated like = abc

so repeating will give us = (abc)* = Regular Expression