15th International Conference on Pattern Recognition (ICPR'00) - Volume 2
k-gram Extensions of Terminal Distinguishable Languages
Barcelona, Spain
September 03-September 08
ISBN: 0-7695-0750-6
We show how k-grams can be used to extend classes of terminal distinguishable right-linear 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.