517 views
2 votes
2 votes
L = $\left \{a^{*}b \right \}$

what is $L^{2} - L $

1 Answer

Best answer
5 votes
5 votes

L = {a*b} has exactly one b in each string

L2 ={a*b}{a*b} has exactly 2 b's in each string

L2 and L has no common strings

So L2 - L = L2 ={a*b}{a*b} 

selected by

Related questions

776
views
1 answers
1 votes
Naveen Kumar 3 asked Mar 19, 2019
776 views
Are the two grammars with respective productions $S \rightarrow aSb|ab|λ$,and $S \rightarrow aAb|ab$, $A \rightarrow aAb|λ$,equivalent? Assume that $S$ is the start symbol in both cases.
857
views
2 answers
2 votes
Apoorva Jain asked Jun 30, 2018
857 views
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$.
477
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 17, 2019
477 views
It is possible to define the term simplification precisely by introducing the concept of complexity of a grammar. This can be done in many ways; one of them is ... What can you say about the removal of $λ$-productions and unit-productions?
664
views
1 answers
0 votes
Naveen Kumar 3 asked Apr 14, 2019
664 views
Consider the derivation tree below.Find a grammar $G$ for which this is the derivation tree of the string $aab$. Then find two more sentences of $L(G)$. Find a sentence in $L(G)$ that has a derivation tree of height five or larger.