New answers tagged dfa
9
votes
Accepted
Is DFA language inclusion decidable in quasi-linear time?
EDIT: the question has an answer by Michael Wehar. A better than quadratic running time contradicts the strong exponential time hypothesis.
https://cstheory.stackexchange.com/a/29166/2367
ORIGINAL ...
Top 50 recent answers are included
Related Tags
dfa × 56automata-theory × 36
fl.formal-languages × 14
regular-language × 12
reference-request × 8
regular-expressions × 8
cc.complexity-theory × 6
nfa × 6
graph-theory × 5
ds.algorithms × 3
lg.learning × 3
time-complexity × 2
graph-isomorphism × 2
space-bounded × 2
open-problem × 2
nondeterminism × 2
finite-model-theory × 2
homomorphism × 2
graph-algorithms × 1
co.combinatorics × 1
optimization × 1
soft-question × 1
machine-learning × 1
big-picture × 1
tree × 1