Results 21 to 30 of about 73,359 (215)

Combinatorics on words, facrordynamics and normal forms

Чебышевский сборник, 2021
Ivan Reshetnikov
openalex   +3 more sources

Fuzzy Approximating Metrics, Approximating Parametrized Metrics and Their Relations with Fuzzy Partial Metrics

Mathematics, 2023
We generalize the concept of a fuzzy metric by introducing its approximating counterpart in order to make it more appropriate for the study of some problems related to combinatorics on words.
Raivis Bēts, Alexander Šostak
doaj   +1 more source

Almost Optimal Searching of Maximal Subrepetitions in a Word

Mathematics, 2022
For some fixed δ such that ...
Roman Kolpakov
doaj   +1 more source

What Dynamic Approaches Have Taught Us About Cognition and What They Have Not: On Values in Motion and the Importance of Replicable Forms

Topics in Cognitive Science, EarlyView., 2023
Abstract Over the past several decades, research in the cognitive sciences has foregrounded the importance of active bodies and their continuous dependence on the changing environment, strengthening the relevance of dynamical models. These models have been steadily developed within the ecological psychology approach to cognition, which arguably ...
Joanna Rączaszek‐Leonardi
wiley   +1 more source

On the Contribution of WORDS to the Field of Combinatorics on Words

Words, 2015
Jean Néraud
openalex   +3 more sources

Prefixes of the Fibonacci word that end with a cube

Comptes Rendus. Mathématique, 2023
The Fibonacci word $\mathbf{f} = 010010100100101\cdots $ is one of the most well-studied words in the area of combinatorics on words. It is not periodic, but nevertheless contains many highly periodic factors (contiguous subwords).
Rampersad, Narad
doaj   +1 more source

The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis [PDF]

Discrete Mathematics & Theoretical Computer Science, 2023
The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words.
Guy Louchard, Werner Schachinger, Mark Daniel Ward   +2 more
doaj   +1 more source

Sweep maps for lattice paths [PDF]

Discrete Mathematics & Theoretical Computer Science, 2014
Sweep maps are a family of maps on words that, while simple to define, are not yet known to be injective in general. This family subsumes many of the "zeta maps" that have arisen in the study of q,t-Catalan numbers in the course of relating the three ...
Nicholas Loehr, Gregory Warrington
doaj   +1 more source

Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks [PDF]

, 2020
The main goal of this article is to present a direct approach for the formula giving the long-term apparent hashrates of Selfish Mining strategies using only elementary probabilities and combinatorics, more precisely, Dyck words.
Grunspan, Cyril
core   +1 more source

On morphisms preserving infinite Lyndon words [PDF]

Discrete Mathematics & Theoretical Computer Science, 2007
In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words.
Gwenael Richomme
doaj   +1 more source