Call Support +91-85588-96644

Exam Categories

International Tests

View More

Defence & Para Military

Assessment-I

View More

Assessment-II

View More

Placement & IT Sector

Assessment-III

View More

Aptitude/GK/Vocational Skill Tests

View More
TCYonline

Login

Sign Up

Please enter a Username or Email ID
Please enter a password
Keep me logged in
Forgot Password?
Please enter your name
Please enter your mobile number
You can't leave Captcha Code empty
By submitting this form, you agree to the Terms & Privacy Policy.
Already Registered? Login Here
OR

Sign Up via Facebook

Sign Up via Google

Sign Up via Twitter

Download Software
Tests given

Download TCY App

App Image
Subscribe to Unlock Test Prep Material close
Choose Exam Category

Unlock All Services And Enjoy The Premium Benefits

1 Month Plan

US$ 10

Subscribe Now

Valid For 1 Month

2 Month Plan

US$ 13

Subscribe Now

Valid For 2 Months

3 Month Plan

US$ 15

Subscribe Now

Valid For 3 Months

4 Month Plan

US$ 17

Subscribe Now

Valid For 4 Months

5 Month Plan

US$ 19

Subscribe Now

Valid For 5 Months

6 Month Plan

US$ 20

Subscribe Now

Valid For 6 Months

7 Month Plan

US$ 21

Subscribe Now

Valid For 7 Months

8 Month Plan

US$ 22

Subscribe Now

Valid For 8 Months

9 Month Plan

US$ 23

Subscribe Now

Valid For 9 Months

10 Month Plan

US$ 24

Subscribe Now

Valid For 10 Months

11 Month Plan

US$ 25

Subscribe Now

Valid For 11 Months

12 Month Plan

US$ 26

Subscribe Now

Valid For 12 Months

  • Payment made in INR entitles you to use Test in INDIA only
  • Each test can be attempted only once
Discussion

General Information Technology Discussion
(54)

Share

Let G1 and G2 be arbitrary CFG's and R an arbitrary regular set. Which of the following problems is undecidable?

 
L(G1) ≠ L(G2)
L(G2) = L(G1)
L(G1) = R
L(G1) ≠ R

Reply


Please type your answer before submitting.
Submit
Saurabh Singh

Why not B

Sgayathri

C