*-Sturmian Words and Complexity

Journal de Theorie des Nombres de Bordeaux - France
doi 10.5802/jtnb.426
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cellule MathDoc/CEDRAM

Related search

A Geometric Proof of the Enumeration Formula for Sturmian Words

International Journal of Algebra and Computation
Mathematics
1993English

Word Complexity and Repetitions in Words

International Journal of Foundations of Computer Science
Computer Science
2004English

Drunken Man Infinite Words Complexity

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2008English

On the Character of Words of Sublinear Complexity

Acta Arithmetica
Number TheoryAlgebra
2018English

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

On Lazy Representations and Sturmian Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Avoiding Abelian Powers in Binary Words With Bounded Abelian Complexity

International Journal of Foundations of Computer Science
Computer Science
2011English

The Index of Sturmian Sequences

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2002English

Halo nucleiHe6andHe8with the Coulomb-Sturmian Basis

Physical Review C
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy