loading...
k-gram Extensions of Terminal Distinguishable Languages
Barcelona, Spain September 03-September 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2000.90603115th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Henning Fernau, Universit?t Tbingen
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.
Citation:
Henning Fernau, "k-gram Extensions of Terminal Distinguishable Languages," icpr, vol. 2, pp.2125, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 2, 2000
Usage of this product signifies your acceptance of the Terms of Use.