On the Generative Power of Quasiperiods

Show simple item record

dc.contributor.author Staiger, L en
dc.date.accessioned 2022-01-14T03:42:10Z
dc.date.available 2022-01-14T03:42:10Z
dc.date.issued 2020 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-548 (2020) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri https://hdl.handle.net/2292/58010
dc.description.abstract It is shown that, for every length l ≥ 3, a quasiperiod of the form an ban (or an bban if l is even) generates the largest language Q of words having this word as quasiperiod. As a means of comparison we use the growth of the function which counts the number of words of length l in the language Q. Moreover, we give the exact ordering of the lengths l with respect to the largest language Q generated by a quasiperiod of length l.
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.source.uri https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php en
dc.title On the Generative Power of Quasiperiods en
dc.type Technical Report en
dc.subject.marsden Fields of Research en
dc.rights.holder Copyright: The author(s) en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace