Log in

Relevant bibliographies by topics / Combinatorics on words

Contents

Journal articles

Academic literature on the topic 'Combinatorics on words'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Combinatorics on words.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Combinatorics on words"

1

Chen, Herman Z. Q., and Sergey Kitaev. "On universal partial words for word-patterns and set partitions." RAIRO - Theoretical Informatics and Applications 54 (2020): 5. http://dx.doi.org/10.1051/ita/2020004.

Full text

Abstract:

Universal words are words containing exactly once each element from a given set of combinatorial structures admitting encoding by words. Universal partial words (u-p-words) contain, in addition to the letters from the alphabet in question, any number of occurrences of a special “joker” symbol. We initiate the study of u-p-words for word-patterns (essentially, surjective functions) and (2-)set partitions by proving a number of existence/non-existence results and thus extending the results in the literature on u-p-words and u-p-cycles for words and permutations. We apply methods of graph theory and combinatorics on words to obtain our results.

APA, Harvard, Vancouver, ISO, and other styles

2

Keränen, Veikko. "Combinatorics on Words." Mathematica Journal 11, no. 3 (2010): 358–75. http://dx.doi.org/10.3888/tmj.11.3-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Carpi, Arturo, and Clelia De Felice. "Combinatorics on words." Theoretical Computer Science 412, no. 27 (2011): 2909–10. http://dx.doi.org/10.1016/j.tcs.2011.01.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Allouche, J. P. "Algebraic Combinatorics on Words." Semigroup Forum 70, no. 1 (2004): 154–55. http://dx.doi.org/10.1007/s00233-004-0146-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

BUCCI, MICHELANGELO, SVETLANA PUZYNINA, and LUCA Q. ZAMBONI. "Central sets generated by uniformly recurrent words." Ergodic Theory and Dynamical Systems 35, no. 3 (2013): 714–36. http://dx.doi.org/10.1017/etds.2013.69.

Full text

Abstract:

AbstractA subset $A$ of $ \mathbb{N} $ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $\mathop{({x}_{n} )}\nolimits_{n\in \mathbb{N} } $ of natural numbers. Central sets, first introduced by Furstenberg using notions from topological dynamics, constitute a special class of IP-sets possessing rich combinatorial properties: each central set contains arbitrarily long arithmetic progressions and solutions to all partition regular systems of homogeneous linear equations. In this paper we investigate central sets in the framework of combinatorics on words. Using various families of uniformly recurrent words, including Sturmian words, the Thue–Morse word and fixed points of weak mixing substitutions, we generate an assortment of central sets which reflect the rich combinatorial structure of the underlying words. The results in this paper rely on interactions between different areas of mathematics, some of which have not previously been directly linked. They include the general theory of combinatorics on words, abstract numeration systems, and the beautiful theory, developed by Hindman, Strauss and others, linking IP-sets and central sets to the algebraic/topological properties of the Stone-Čech compactification of $ \mathbb{N} $.

APA, Harvard, Vancouver, ISO, and other styles

6

Manea, Florin, and Dirk Nowotka. "TCS Special Issue: Combinatorics on Words – WORDS 2015." Theoretical Computer Science 684 (July 2017): 1–2. http://dx.doi.org/10.1016/j.tcs.2017.05.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lecroq, Thierry, and Svetlana Puzynina. "TCS special issue: Combinatorics on Words – WORDS 2021." Theoretical Computer Science 952 (March 2023): 113688. http://dx.doi.org/10.1016/j.tcs.2023.113688.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

BLANCHET-SADRI, F. "ALGORITHMIC COMBINATORICS ON PARTIAL WORDS." International Journal of Foundations of Computer Science 23, no. 06 (2012): 1189–206. http://dx.doi.org/10.1142/s0129054112400473.

Full text

Abstract:

Algorithmic combinatorics on partial words, or sequences of symbols over a finite alphabet that may have some do-not-know symbols or holes, has been developing in the past few years. Applications can be found, for instance, in molecular biology for the sequencing and analysis of DNA, in bio-inspired computing where partial words have been considered for identifying good encodings for DNA computations, and in data compression. In this paper, we focus on two areas of algorithmic combinatorics on partial words, namely, pattern avoidance and subword complexity. We discuss recent contributions as well as a number of open problems. In relation to pattern avoidance, we classify all binary patterns with respect to partial word avoidability, we classify all unary patterns with respect to hole sparsity, and we discuss avoiding abelian powers in partial words. In relation to subword complexity, we generate and count minimal Sturmian partial words, we construct de Bruijn partial words, and we construct partial words with subword complexities not achievable by full words (those without holes).

APA, Harvard, Vancouver, ISO, and other styles

9

Lothaire, M. "Review of applied combinatorics on words." ACM SIGACT News 39, no. 3 (2008): 28–30. http://dx.doi.org/10.1145/1412700.1412706.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

de Luca, Aldo. "On the combinatorics of finite words." Theoretical Computer Science 218, no. 1 (1999): 13–39. http://dx.doi.org/10.1016/s0304-3975(98)00248-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!