FACTOR AND PALINDROMIC COMPLEXITY OF THUE-MORSE’S AVATARS
dc.contributor.author | Frougny , Christiane | |
dc.contributor.author | Klouda , Karel | |
dc.date.accessioned | 2017-02-09T08:23:51Z | |
dc.date.available | 2017-02-09T08:23:51Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Acta Polytechnica. 2013, vol. 53, no. 6. | |
dc.identifier.issn | 1210-2709 (print) | |
dc.identifier.issn | 1805-2363 (online) | |
dc.identifier.uri | http://hdl.handle.net/10467/67095 | |
dc.description.abstract | Two infinite words that are connected with some significant univoque numbers are studied. It is shown that their factor and palindromic complexities almost coincide with the factor and palindromic complexities of the famous Thue-Morse word. | 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/2015 | |
dc.rights | Creative Commons Attribution 4.0 International License | en |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
dc.title | FACTOR AND PALINDROMIC COMPLEXITY OF THUE-MORSE’S AVATARS | |
dc.type | article | en |
dc.date.updated | 2017-02-09T08:23:51Z | |
dc.identifier.doi | 10.14311/AP.2013.53.0868 | |
dc.rights.access | openAccess | |
dc.type.status | Peer-reviewed | |
dc.type.version | publishedVersion |
Soubory tohoto záznamu
Tento záznam se objevuje v následujících kolekcích
Kromě případů, kde je uvedeno jinak, licence tohoto záznamu je Creative Commons Attribution 4.0 International License