On an Algorithm for Multiperiodic Words

dc.contributor.author	Holub , Štepán
dc.date.accessioned	2017-02-09T08:17:46Z
dc.date.available	2017-02-09T08:17:46Z
dc.date.issued	2013
dc.identifier.citation	Acta Polytechnica. 2013, vol. 53, no. 4.
dc.identifier.issn	1210-2709 (print)
dc.identifier.issn	1805-2363 (online)
dc.identifier.uri	http://hdl.handle.net/10467/67069
dc.description.abstract	We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1, . . . , pr, and the richest possible alphabet. We show that this algorithm can be easilystated and its correctness briefly proved using the class equivalence approach.	en
dc.format.mimetype	application/pdf
dc.language.iso	eng
dc.publisher	České vysoké učení technické v Praze	cs
dc.publisher	Czech Technical University in Prague	en
dc.relation.ispartofseries	Acta Polytechnica
dc.relation.uri	https://ojs.cvut.cz/ojs/index.php/ap/article/view/1827
dc.rights	Creative Commons Attribution 4.0 International License	en
dc.rights.uri	http://creativecommons.org/licenses/by/4.0/
dc.subject	periodicity	en
dc.subject	combinatorics on words	en
dc.title	On an Algorithm for Multiperiodic Words
dc.type	article	en
dc.date.updated	2017-02-09T08:17:46Z
dc.rights.access	openAccess
dc.type.status	Peer-reviewed
dc.type.version	publishedVersion

Kromě případů, kde je uvedeno jinak, licence tohoto záznamu je Creative Commons Attribution 4.0 International License