مؤتمر
Automaticity and Parikh-collinear Morphisms
العنوان: | Automaticity and Parikh-collinear Morphisms |
---|---|
المؤلفون: | Rigo, Michel, Stipulanti, Manon, Whiteland, Markus |
المصدر: | urn:isbn:978-3-031-33179-4 Words 2023, 247-260 (2023); Words 2023 14th international conference, Umea, Sweden [SE], from 12 to 16 June 2023 |
بيانات النشر: | Springer, 2023. |
سنة النشر: | 2023 |
مصطلحات موضوعية: | combinatorics on words, Automatic sequences, Morphic words, Abelian complexity, Automated theorem proving, Walnut, Physical, chemical, mathematical & earth Sciences, Mathematics, Physique, chimie, mathématiques & sciences de la terre, Mathématiques |
الوصف: | Parikh-collinear morphisms have recently received a lot of attention. They are defined by the property that the Parikh vectors of the images of letters are collinear. We first show that any fixed point of such a morphism is automatic. Consequently, we get under some mild technical assumption that the abelian complexity of a binary fixedpoint of a Parikh-collinear morphism is also automatic, and we discuss a generalization to arbitrary alphabets. Then, we consider the abelian complexity function of the fixed point of the Parikh-collinear morphism $0\mapsto 010011$, $1\mapsto 1001$. This $5$-automatic sequence is shown to be aperiodic, answering a question of Salo and Sportiello. |
نوع الوثيقة: | conference paper http://purl.org/coar/resource_type/c_5794 conferenceObject peer reviewed |
اللغة: | English |
Relation: | https://link.springer.com/chapter/10.1007/978-3-031-33180-0_19 |
URL الوصول: | https://orbi.uliege.be/handle/2268/302523 |
حقوق: | open access http://purl.org/coar/access_right/c_abf2 info:eu-repo/semantics/openAccess |
رقم الأكسشن: | edsorb.302523 |
قاعدة البيانات: | ORBi |
كن أول من يترك تعليقا!