255 views
1 votes
1 votes
if L1 ={a^n | n>=0}

then L1^R  is?

1 Answer

Related questions

0 votes
0 votes
0 answers
2
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.