The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
Let L1 and L2 be two languages such that L1≤mL2. Consider the following statements
S1: If L1 is non-regular then L2 is also non-regular
S2: If L1 is non-CFL then L2 is also non-CFL
Which of the following is correct?
A. S1 is true but S2 is false
B. S2 is true but S1 is false
C. Both S1 and S2 are true
D. Both S1 and S2 are false
asked in Theory of Computation by (135 points) | 68 views
Please specify source of question

Please log in or register to answer this question.

No related questions found

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

28,839 questions
36,693 answers
34,642 users