k-gram extensions of terminal distinguishable languages
Henning Fernau · 2002
We show how k-grams can be used to extend classes of terminal distinguishable right-liner languages (k-TDRL). Moreover, we present an efficient identification algorithm for k-TDRL languages. Our approach not only generalizes the class TDRL, but also the k-testable languages, as well as the k-reversible languages.