Register
Dark Mode

toc igate test series

in Theory of Computation
202 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
by
202 views

1 comment

by
1
1

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 vote
1 vote
1 answer
1
SKMAKM asked in Theory of Computation Jul 20, 2022
587 views
Igate Test Series
please explain all options with example
SKMAKM asked in Theory of Computation Jul 20, 2022
by SKMAKM
587 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!