For the given Regular expression, the minimum number of terminals required to derive its grammar (011+1)(01) is

3,6,2,5,4 Correct

Similar CS-6205 questions

IT generate recursively enumerable languages. The productions have no restrictions and phase structu...
Z2 uses electricity to convey letters and transmit information quickly in 1844.
An order rooted tree that graphically represents the semantic information a string derived from a co...
IT generate recursively enumerable languages. The productions have no restrictions and phase structu...
It generate context-free languages. The productions must be in the form A → γ
A general purpose, programmable, information processor with input and output.