adplus-dvertising

Welcome to the Theory of Computation(TOC) MCQs Page

Dive deep into the fascinating world of Theory of Computation(TOC) with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Theory of Computation(TOC), a crucial aspect of UGC CBSE NET Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Theory of Computation(TOC), from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within UGC CBSE NET Exam.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Theory of Computation(TOC). Test your knowledge, expand your horizons, and solidify your grasp on this vital area of UGC CBSE NET Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Theory of Computation(TOC). You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Theory of Computation(TOC) MCQs | Page 16 of 16

Discuss
Answer: (a).whether two given regular expressions are equivalent
Discuss
Answer: (d).Ambiguity problem for context free grammar
Q153.
Finite state machine can recognize language generated by ....................
Discuss
Answer: (c).Only regular grammar
Discuss
Answer: (c).recursive and is a deterministic context free language.
Discuss
Answer: (d).Recursive languages are not closed under intersection.
Q156.
Context free grammar is not closed under :
Discuss
Answer: (b).Complementation
Q157.
Consider the following languages :

L1 = {a^m b^n | m ≠ n}
L2 = {a^m b^n | m = 2n+1}
L3 = {a^m b^n | m ≠ 2n}

Which one of the following statement is correct?
Discuss
Answer: (d).L1, L2 and L3 are context free languages
Q158.
Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below. The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is

a.

5

b.

4

c.

3

d.

2

Discuss
Answer: (c).3

Suggested Topics

Are you eager to expand your knowledge beyond Theory of Computation(TOC)? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!