Register

Regular Language

228 views
0 votes
0 votes
Which of the following option is correct regarding dependability?
A.    Given a regular language R and context-free C. Is every string in R also in C, i.e., Is L(R)⊆L(C) decidable?
B.    Given a regular language R and context-free C. Is every string in C also in R, i.e., Is L(C)⊆L(R) decidable?

C.  Both (A) and (B)

D.    None of these
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Deepak9000 asked Nov 27, 2023
216 views
Not Regular language [find out]
Why is C is regular as it non regular as? Please help me with this confusion
Why is C is regular as it non regular as?Please help me with this confusion
User Avatar
0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
787 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
User Avatar
0 votes
0 votes
2 answers
4
R ji asked Dec 15, 2022
542 views
Every Regular language has an equivalent NFA ?? True/False
User Avatar
Link Copied!