Strong inapproximability of the shortest reset word.

Pawel Gawrychowski Damian Straszak

Published in: CoRR (2014)

Keyphrases

co occurrence
approximation algorithms
n gram
shortest path
data sets
word recognition
learning algorithm
pattern matching