You can prepare effectively for Computer Science Engineering (CSE) GATE Computer Science Engineering(CSE) 2027 Mock Test Series with this dedicated MCQ Practice Test (available with solutions) on the important topic of "Test: Theory of Computation - 2". These 15 questions have been designed by the experts with the latest curriculum of Computer Science Engineering (CSE) 2026, to help you master the concept.
Test Highlights:
Sign up on EduRev for free to attempt this test and track your preparation progress.
The minimum number of states required to recognize an octal number divisible by 3 are/is
Detailed Solution: Question 1
If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________
Detailed Solution: Question 2
Given: ∑= {a, b}
L= {xϵ∑*|x is a string combination}
∑4 represents which among the following?
Detailed Solution: Question 3
Detailed Solution: Question 4
For a give Moore Machine, Given Input=’101010’, thus the output would be of length:
Detailed Solution: Question 5
Detailed Solution: Question 6
Detailed Solution: Question 7
Detailed Solution: Question 8
The ratio of number of input to the number of output in a mealy machine can be given as:
Detailed Solution: Question 9
The major difference between Mealy and Moore machine is about:
Detailed Solution: Question 10
Which of the following not an example Bounded Information?
Detailed Solution: Question 11
A DFA cannot be represented in the following format
Detailed Solution: Question 12
Detailed Solution: Question 13
Which of the following is not an example of finite state machine system?
Detailed Solution: Question 14
The complement of a language will only be defined when and only when the __________ over the language is defined.
Detailed Solution: Question 15