Amanote Research

Amanote Research

    RegisterSign In

Length-K-Overlap-Free Binary Infinite Words

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2012-682
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
Date

January 1, 2012

Authors
Patrice Séébold
Publisher

IOS Press


Related search

Activation of Words With Phonological Overlap

Frontiers in Psychology
Psychology
2013English

Drunken Man Infinite Words Complexity

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2008English

Periods and Binary Words

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

Decidability of Periodicity for Infinite Words

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1986English

Structure of Words With Short 2-Length in a Free Product of Groups

Journal of Algebra
Number TheoryAlgebra
2019English

Degrees of Infinite Words, Polynomials and Atoms

International Journal of Foundations of Computer Science
Computer Science
2018English

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

Finding K-Shortest Paths With Limited Overlap

VLDB Journal
HardwareInformation SystemsArchitecture
2020English

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy