Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/111961
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGorbunova, I. A.en
dc.contributor.authorShur, A. M.en
dc.date.accessioned2022-05-12T08:26:20Z-
dc.date.available2022-05-12T08:26:20Z-
dc.date.issued2011-
dc.identifier.citationGorbunova I. A. On Pansiot Words Avoiding 3-Repetitions / I. A. Gorbunova, A. M. Shur. — DOI 10.1038/s41598-022-07450-7 // Electronic Proceedings in Theoretical Computer Science, EPTCS. — 2011. — Vol. 63. — P. 138-146.en
dc.identifier.issn2075-2180-
dc.identifier.otherAll Open Access, Gold, Green3
dc.identifier.urihttp://hdl.handle.net/10995/111961-
dc.description.abstractThe recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable powers of words gave rise to interesting and challenging problems on the structure and growth of threshold words. Over any finite alphabet with k ≥ 5 letters, Pansiot words avoiding 3-repetitions forma regular language, which is a rather small superset of the set of all thresholdwords. Using cylindric and 2-dimensionalwords, we prove that, as k approaches infinity, the growth rates of complexity for these regular languages tend to the growth rate of complexity of some ternary 2-dimensional language. The numerical estimate of this growth rate is ≈ 1.2421. © 2011 I. A. Gorbunova, A. M. Shur.en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherOpen Publishing Associationen1
dc.publisherOpen Publishing Associationen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceElectron. Proc. Theor. Comput. Sci., EPTCS2
dc.sourceElectronic Proceedings in Theoretical Computer Science, EPTCSen
dc.subjectCOMPUTATIONAL METHODSen
dc.subjectCOMPUTER SCIENCEen
dc.subjectFINITE ALPHABETen
dc.subjectCONTEXT FREE LANGUAGESen
dc.titleOn Pansiot Words Avoiding 3-Repetitionsen
dc.typeConference Paperen
dc.typeinfo:eu-repo/semantics/conferenceObjecten
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.conference.name8th International Conference Words, WORDS 2011en
dc.conference.date12 September 2011 through 16 September 2011-
dc.identifier.doi10.1038/s41598-022-07450-7-
dc.identifier.scopus84870392115-
local.contributor.employeeGorbunova, I.A., Ural Federal University, Ekaterinburg, Russian Federation; Shur, A.M., Ural Federal University, Ekaterinburg, Russian Federationen
local.description.firstpage138-
local.description.lastpage146-
local.volume63-
local.contributor.departmentUral Federal University, Ekaterinburg, Russian Federationen
local.identifier.eid2-s2.0-84870392115-
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84870392115.pdf177,58 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.