1.

If there are more than 2 LMD for a string then it is said to be ___________.

A. Ambigious
B. unambigious
C. language
D. finite state automata
Answer» B. unambigious


Discussion

No Comment Found