948 views

1 Answer

Best answer
3 votes
3 votes
For string of length n

The no prefix and suffix is n+1

Prefixes

€ ,a ,ab , abb , abba , abbab

Suffixes

b , ab , bab , bbab , abbab ,€
selected by

Related questions

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