323 views
1 votes
1 votes

Is the following language regular? 

Please log in or register to answer this question.

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.