1.

There exists a language L. We define a string w such that w∈L and w=xyz and |w| >=n for some constant integer n.What can be the maximum length of the substring xy i.e. |xy|<=?

A. n
B. |y|
C. |x|
D. none of the mentioned
Answer» B. |y|


Discussion

No Comment Found