What is meant by Chomsky Normal Form in Theory of Automata and Formal Languages?

Correct Answer: D

a CFG form where productions are mainly A -> BC or A -> a, with limited epsilon handling

The correct answer is a CFG form where productions are mainly A -> BC or A -> a, with limited epsilon handling.