Explore topic-wise MCQs in Automata Theory.

This section includes 4 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.	Choose the correct option: Statement: Unambiguity is the ideal structure of a language.
A.	true
B.	partially true
C.	false
D.	cant be said
Answer» B. partially true

Discussion

2.	If \|w\|>=2^h, then its parse tree s height is at least _____
A.	h
B.	h+1
C.	h-1
D.	2<sup>h</sup>
Answer» C. h-1

Discussion

3.	State true or false: Statement: A CNF parse tree s string yield (w) can no longer be 2h-1.
A.	true
B.	false
Answer» B. false

Discussion

4.	A symbol X is ________ if there exists : S->* aXb
A.	reachable
B.	generating
C.	context free
D.	none of the mentioned
Answer» B. generating

Discussion

Explore topic-wise MCQs in Automata Theory.

Choose the correct option:Statement: Unambiguity is the ideal structure of a language.

If |w|>=2h, then its parse tree s height is at least _____

State true or false:Statement: A CNF parse tree s string yield (w) can no longer be 2h-1.

A symbol X is ________ if there exists : S->* aXb

Choose the correct option:
Statement: Unambiguity is the ideal structure of a language.

If |w|>=2^h, then its parse tree s height is at least _____

State true or false:
Statement: A CNF parse tree s string yield (w) can no longer be 2h-1.