Title :
k-gram extensions of terminal distinguishable languages
Author_Institution :
Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany
Abstract :
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
Keywords :
formal languages; grammars; inference mechanisms; grammars; inference model; k-TDRL languages; k-reversible languages; k-testable languages; terminal distinguishable languages; DNA; Data compression; Encoding; Genetic algorithms; Gold; Inference algorithms; Natural languages; Pattern recognition; Proteins; Sequences;
Conference_Titel :
Pattern Recognition, 2000. Proceedings. 15th International Conference on
Conference_Location :
Barcelona
Print_ISBN :
0-7695-0750-6
DOI :
10.1109/ICPR.2000.906031
