in Theory of Computation
572 views
0 votes
0 votes
L1=ab*

L2=a(aa)*b(bb)*

Are the languages equal if not what relation do they satisfy?
in Theory of Computation
by
572 views

4 Comments

No it is not because 'a' is not present in set L2.
0
0
a is present at the start min string is ab for L2 and for L1 it is a.
0
0
A DFA accepting 'aa' cannot accept 'a' unless you form a final state that accepts 'a'.
0
0

1 Answer

0 votes
0 votes
L1 Is subset of L2

Related questions