Redirected
edited by
722 views
2 votes
2 votes
Let L be the language accepted by the automaton $L = ${$(a^{n})b:n≥0$}. 
 
Find a dfa that accepts the language $L^{2}  - L$.
edited by

2 Answers

1 votes
1 votes

L and L2 both do not have common strings. Because L = anb and L2= (anb)(amb)|n,m>=0

L2 contains 2 b's while L contains 1 b's. So there is no common string 

L2-L= L2

 

edited by
0 votes
0 votes

Here, L={b,ab,aab,aaab,...................}

Now,

L={bb,bab,baab,..........................}

As we can see there is no common element 

Related questions

0 votes
0 votes
0 answers
4