Amanote Research

Amanote Research

    RegisterSign In

Drunken Man Infinite Words Complexity

RAIRO - Theoretical Informatics and Applications - France
doi 10.1051/ita:2008012
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer Science ApplicationsSoftware
Date

June 3, 2008

Authors
Marion Le Gonidec
Publisher

EDP Sciences


Related search

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

Song of the Drunken Man

The Iowa Review
1974English

*-Sturmian Words and Complexity

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2003English

Decidability of Periodicity for Infinite Words

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1986English

Degrees of Infinite Words, Polynomials and Atoms

International Journal of Foundations of Computer Science
Computer Science
2018English

Length-K-Overlap-Free Binary Infinite Words

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

Drunken Head

ti<
2012English

Word Complexity and Repetitions in Words

International Journal of Foundations of Computer Science
Computer Science
2004English

Complexity of Infinite Sequences With Zero Entropy

Acta Arithmetica
Number TheoryAlgebra
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy