1 votes 1 votes equivalence of two regular language can be tested in (worst case)? polynomial time sub linear time exponential time poly logarithmic time Theory of Computation theory-of-computation + – jugnu1337 asked Jul 27, 2022 jugnu1337 203 views answer comment Share Follow See 1 comment See all 1 1 comment reply jugnu1337 commented Jul 27, 2022 reply Follow Share @GO Classes 1 votes 1 votes Please log in or register to add a comment.