Abelian complexity of infinite words associated with quadratic Parry numbers
| Autor: | Ondrej Turek, Karel Brinda, L'ubomíra Balková |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Pure mathematics
Mathematics::Dynamical Systems General Computer Science Mathematics::Number Theory Abelian complexity PARRY Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) 68R15 Theoretical Computer Science Quadratic equation FOS: Mathematics Quadratic Parry numbers Mathematics - Combinatorics Binary quadratic form Binary infinite words Combinatorics (math.CO) Abelian group Algorithm Computer Science::Formal Languages and Automata Theory Computer Science(all) Mathematics |
| Zdroj: | Theoretical Computer Science. 412:6252-6260 |
| ISSN: | 0304-3975 |
| DOI: | 10.1016/j.tcs.2011.08.016 |
| Popis: | We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers. 12 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect