Explore topic-wise MCQs in Automata Theory.

This section includes 1 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.

1.

The __________ running time of CYK is O(n3 .|G|)
where n is the length of the parse string and |G| is the size of the context free grammar G.

A. worst
B. best
C. average
D. none of the mentioned
Answer» B. best