Algebraic Combinatorics on Words: Index of Notation
By M. Lothaire. 2002
1,013 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/3e4a8301b525282afba1248d3f4653a1f7e527b9
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Val'erie Berth'e
- Charles Holton
- Luca Q. Zamboni
- Jean Berstel
- Nikolaos Galatos
- Sébastien Ferenczi
- Vincent Delecroix
Citations in the corpus
- mreps: efficient and flexible detection of tandem repeats in DNA (2003, background): “Note that terms period and exponent (sometimes called order ) are borrowed from the area of word combinatorics, where tandemly repeated structures (called periodicities) have been studied for a long time (see Chapter 8 in 26).”
- Diophantine properties of real numbers generated by finite automata (2006, neutral): “In that case, the sequence of finite words ( σ n ( a )) n ≥ 0 converges in A ∞ = A ∗ ∪ A N endowed with its usual topology (see for instance [23], Chap. to an 2) infinite word a denoted σ ∞ ( a ).”
- Minimal varieties of residuated lattices (2005, background): “For a more precise definition of the lower mechanical word associated with a line and for the proofs of the facts mentioned above, the reader is referred to [14].”
- Orthogonal polynomials on the unit circle: New results (2004, neutral): “shin [97] and Nevai [93]. 32 B. SIMON 6.2. Fibonacci Subshifts. For discrete Schr¨odinger operators, there is an extensive literature [4, 72, 99, 133, 8, 12, 18, 19, 17, 20, 78, 79] on subshifts (see [125, 111, 81] for a definition of subshifts). In [125, Section 12.8], we have analyzed the OPUC anal”
- Boundary of central tiles associated with Pisot beta-numeration and purely periodic expansions (2007, neutral): “[22, 11, 16, 21]): Theorem and Definition 2.”