edited by
952 views
0 votes
0 votes
Let L={aba}. Prefix and suffix operations over the language L is used to perform the following.

X=(prefix(L) intersection suffix (L))/L

Quotient operation (/) is also used in the above.how many strings exist in the language X?
edited by

1 Answer

Best answer
1 votes
1 votes

The answer will be 1.

Let Language G = {aba}.

prefix(G) = { ε, a, ab, aba}

suffix(G) = {ε, a , ba, aba}

(prefix(G) ∩ suffix(G) ) = { ε, a, aba}

(prefix(G) ∩ suffix(G) ) / G = { ε}

==> { ε, a, aba} / { aba} ( when we divide aba to aba it will be result ε)

Some exa:

1. { cat, rat, chat} / {at}  ===> { c, r,ch}.

2.{cat, rat, group} / { at} ===> { c, r}

3.{cat, rat} / {cat} ===> { ε}.

4.{apple} / {e, le}  ==> { appl, app}

 

 

So, the number of string = 1.

 

selected by

Related questions

0 votes
0 votes
0 answers
2
baofbuiafbi asked Nov 14, 2023
152 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.