Skip to main content
Conference Proceedings

On uniform DOL words

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1373 LNCS 544-554
DOI: 10.1007/BFb0028589
18Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce the wide class of marked uniform DOL words and study their structure. The criterium of circularity of a marked uniform DOL word is given, and the subword complexity function is found for the uncircular case as well as for the circular one. The same technique is valid for a wider class of uniform DOL sequences which includes (p, 1)-Toeplitz words (see [4]). © 1998 Springer-Verlag.

Cite

CITATION STYLE

APA

Frid, A. E. (1998). On uniform DOL words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1373 LNCS, pp. 544–554). https://doi.org/10.1007/BFb0028589

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free