Top 150+ Solved Theory of Computation MCQ Questions Answer

Previous
From 136 to 137 of 137

Q. Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is

a. 10

b. 01

c. 101

d. 110

  • a. 10
View Details

Q. The set that can be recognized by a deterministic finite state automaton is

a. The set {1, 101, 11011, 1110111, …….}

b. The set of binary string in which the number of 0’s is same as the number of1’s

c. 1, 2, 4, 8……2n ….. written in binary

d. 1, 2, 4, 8……2n ….. written in unary

  • c. 1, 2, 4, 8……2n ….. written in binary
View Details

Related Topics

Subscribe Now

Get All Updates & News