Q.

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» A. Ambigious
4.3k
0
Do you find this helpful?
30

View all MCQs in

Discrete Mathematics

Discussion

No comments yet