The Gateway to Computer Science Excellence
0 votes
29 views
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
in Theory of Computation by (307 points) | 29 views
0
A?

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,384 answers
198,541 comments
105,340 users