in Theory of Computation
121 views
1 vote
1 vote

equivalence of two regular language can be tested in (worst case)?

  • polynomial time
  • sub linear time
  • exponential time
  • poly logarithmic time
in Theory of Computation
121 views

1 comment

1
1

Please log in or register to answer this question.

Related questions