Decidability — true or false?
Exercise and reference answers
- Questions
- Statement is true
- Yes
- Statement
- The Halting Problem is undecidable.
- Statement is true
- Yes
- Statement
- Equivalence of two DFAs is decidable.
- Statement is true
- No
- Statement
- Equivalence of two CFGs is decidable.
- Statement is true
- Yes
- Statement
- The intersection of two regular languages is regular.
Continue learning with Quill →Browse more GATE CSE questions and exercises →