menu-iconExamlexExamLexServices

Discover

Ask a Question
  1. All Topics
  2. Topic
    Computing
  3. Study Set
    Theory of Computation
  4. Exam
    Exam 2: Formal Languages and Automata Theory: Part B
  5. Question
    Which of the Following Are Decidable
Solved

Which of the Following Are Decidable

Question 50

Question 50

Multiple Choice

Which of the following are decidable?
1) Whether the intersection of two regular language is infinite.
2) Whether a given context free language is regular.
3) Whether two push down automata accept the same language.
4) Whether a given grammar is context free.


A) 1 and 2
B) 1 and 4
C) 2 and 3
D) 2 and 4

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q40: The PDA is called non-deterministic PDA when

Q41: FSM can recognize<br>A)Any grammar<br>B)Only CG<br>C)Both (a) and

Q42: Consider the following Finite State Automaton The

Q43: PCP is:<br>A)Decidable<br>B)Undecidable<br>C)Sometimes Decidable<br>D)None of the

Q44: Which one of the following is true

Q45: Recursively enumerable languages are not closed under<br>A)Union<br>B)homomorphism<br>C)complementation<br>D)concatenation

Q46: Given A = {0,1} and L =

Q47: A minimum state deterministic finite automation accepting

Q48: Let L={w (0 + 1)* w has

Q49: Which of the following statements is/are FALSE?<br>(1)

Examlex

ExamLex

About UsContact UsPerks CenterHomeschoolingTest Prep

Work With Us

Campus RepresentativeInfluencers

Links

FaqPricingChrome Extension

Download The App

Get App StoreGet Google Play

Policies

Privacy PolicyTerms of ServiceHonor CodeCommunity Guidelines

Scan To Download

qr-code

Copyright © (2025) ExamLex LLC.

Privacy PolicyTerms Of ServiceHonor CodeCommunity Guidelines