Results 171 to 180 of about 73,517 (203)
Some of the next articles are maybe not open access.
Combinatorics on Infinite Words
2004We consider several problems of infinite words over a finite alphabet. In particular, we describe a few automata-theoretic methods to define infinite words. Properties of infinite words studied in more details are repetition-freeness, periodicity and different kinds of complexity issues.
Juhani Karhumäki, Arto Lepistö
openaire +1 more source
Contributions to combinatorics on words in an abelian context and covering problems in graphs
, 2015Cette dissertation se divise en deux parties, distinctes mais connexes, qui sont le reflet de la cotutelle. Nous étudions et résolvons des problèmes concernant d'une part la combinatoire des mots dans un contexte abélien et d'autre part des problèmes ...
Élise Vandomme
semanticscholar +1 more source
Mini-Workshop: Combinatorics on Words
Oberwolfach Reports, 2011The area of combinatorics on words is concerned with properties of sequences of symbols. It is characteristic to the field that questions arise from various mathematical problems, and hence, many fundamental results on words have been established in different areas.
Valerie Berthe +3 more
openaire +1 more source
Formalization of Basic Combinatorics on Words
International Conference on Interactive Theorem Proving, 2021S. Holub, Štěpán Starosta
semanticscholar +1 more source
Combinatorics on words, facrordynamics and normal forms
Чебышевский сборник, 2021I. Reshetnikov
semanticscholar +1 more source
Mini-Workshop: Combinatorics on Words
2010The area of combinatorics on words is concerned with properties of sequences of symbols. It is characteristic to the field that questions arise from various mathematical problems, and hence, many fundamental results on words have been established in different areas.
openaire +2 more sources
THREE DISTANCE THEOREMS AND COMBINATORICS ON WORDS
1998This paper is first a very nice survey on the three distance theorem [see \textit{V. Turán-Sos}, Ann. Univ. Sci. Budapest. Rolando Eötvös, Sect. Math. 1, 127-134 (1958; Zbl 0094.02903) and \textit{S. Świerczkowski}, Fundam. Math. 46, 187-189 (1959; Zbl 0085.27203)] and its generalizations, going from codings of rotations to block complexities of ...
Alessandri, Pascal, Berthé, Valérie
openaire +2 more sources
Enumerative combinatorics on words
2015Combinatorics on words is a field which has both historical roots and a substantial growth. Its roots are to be found in the early results of Axel Thue on square free words and the development of combinatorial group theory. The present interest in the field is pushed by its links with several connexions with other topics external to pure mathematics ...
Perrin, Dominique, Restivo, Antonio
openaire +1 more source
Review of applied combinatorics on words
ACM SIGACT News, 2008Text manipulations play an important part in various kinds of computations. The subject of text manipulations, is a well developed subject in computer science. The book deals with algorithms, and theoretical properties of texts. Most of algorithms are expressed in pseudo code. They are accompanied by their proofs of correctness, and complexity analysis.
openaire +1 more source