Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.47K Points
Coach 

Q.) Grammars that can be translated to DFAs:

(A) Left linear grammar
(B) Right linear grammar
(C) Generic grammar
(D) All of these
Correct answer : Option (B) - Right linear grammar

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. Governance policies, rules, as well as authority structures apply to which key resource element of the organisation?

Q. . In FSM diagram what does circle represent?

Q. ... is the program run on a computer when the computer boots up

Q. The situation wherein the data of operands are not available is called

Q. In a positive edge triggered JK flip-flop, a low J and low K produces

Q. State true or false. i) Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation.

Q. In UNIX, each process is identified by its

Q. The difference between half adder and full adder is

Q. What is an AVL tree?

Q. Some people are using the term ___ instead of prediction only to avoid the weird idea that machine learning is a sort of modern magic.