Question 2746 – UGC NET CS 2017 Jan -paper-2
March 12, 2024Question 5375 – UGC NET CS 2012 June-Paper2
March 12, 2024Question 10324 – Theory-of-Computation
A grammar G is in Chomsky-Normal Form (CNF) if all its productions are of the form A → BC or A → a, where A, B and C, are non-terminals and a is a terminal.
Suppose G is a CFG in CNF and w is a string in L(G) of length, then how long is a derivation of w in G?
Correct Answer: A
Theory Explanation.
Subscribe
Login
0 Comments