Theory of Computation MCQ with Answers

all strings

no string

ε- alone

none of these

one to one not onto

one to one and onto

not one to one and not onto

not one to one and onto

M cannot be transformed to N

M can be transformed to N, merely re-labelling its edges

M can be transformed to N, merely re-labelling its states

none of these

(0+1(1 + 01)* 00)*

(1 + 0 (0 + 10) 00)*

(0 + 1 (1 + 10) 00)*

(1 + 0(1 + 00) 11)*

have same number of states

have same number of edges

have same number of states and edges

recognize same set of tokens