A

Admin • 833K Points
Coach

Q. A class of machine which accepts a ________ language is called finite state automata.

  • (A) type 0
  • (B) type 1
  • (C) type 2
  • (D) type 3

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.

Be the first to start discuss.