800 views
1 votes
1 votes
L (ab (a + ab)* (a + aa))

can someone convert this to dfa and then regular grammer?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
3 answers
1
1 votes
1 votes
1 answer
2
ANJALI SAWARKAR asked Jul 29, 2017
319 views
Is it true that for every nfa M = (Q, Σ,δ,q0,F)the complement of L (M)is equal to the set {w ∈ Σ* :δ*; (q0,w) ∈ (Q – F) = Ø}? If so, prove it; if not, give a c...
1 votes
1 votes
0 answers
3
1 votes
1 votes
0 answers
4
ANJALI SAWARKAR asked Jul 31, 2017
242 views
Find a regular grammar that generates the language L (aa* (ab+ a)*).how to convert this into finite automata?? and also how to form regular grammer ?