M

Mr. Dubey • 100.69K Points
Coach

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
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.


Question analytics