Reports

 

On the Subword Complexity of Square-Free DOL Languages ; CU-CS-174-80 Public Deposited

Analytics

Downloadable Content

Download PDF
Citations
https://scholar.colorado.edu/concern/reports/rj4305320
Abstract
  • The subword complexity of a language K is the function which to every positive integer n assigns the number of different subwords of length n occurring in words of K. A language K is square-free if no word in it contains a subword of the form xx where x is a nonempty word. The (best) upper and lower bounds on the subword complexity of infinite square-free DOL languages are established.
Creator
Date Issued
  • 1980-04-01
Academic Affiliation
Last Modified
  • 2019-12-21
Resource Type
Rights Statement
Language

Relationships

Items

Thumbnail Title Date Uploaded Visibility Actions
Gx41mj58q?file=thumbnail onTheSubwordComplexityOfSquareFreeDolLanguagesCuCs17.pdf 2019-12-21 Public Download