Pages that link to "Item:Q1292479"
From MaRDI portal
The following pages link to On the combinatorics of finite words (Q1292479):
Displaying 47 items.
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Generalized trapezoidal words (Q490909) (← links)
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- Combinatorial properties of infinite words associated with cut-and-project sequences (Q558162) (← links)
- A periodicity result of partial words with one hole (Q597324) (← links)
- On average sequence complexity (Q703547) (← links)
- A generalized palindromization map in free monoids (Q714817) (← links)
- On factorially balanced sets of words (Q719290) (← links)
- Combinatorial properties of smooth infinite words (Q818144) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Rich, Sturmian, and trapezoidal words (Q955036) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Complexity for finite factors of infinite sequences (Q1292491) (← links)
- Problems in combinatorics on words originating from discrete dynamical systems (Q1293446) (← links)
- Three distance theorems and combinatorics on words (Q1594925) (← links)
- A combinatorial problem on trapezoidal words. (Q1605325) (← links)
- A combinatorial property of the factor poset of a word (Q1847375) (← links)
- Conjugacy on partial words. (Q1853530) (← links)
- Semiperiodic words and root-conjugacy. (Q1853735) (← links)
- Uniform words (Q1883404) (← links)
- Local periods and binary partial words: an algorithm (Q1884922) (← links)
- Periods in partial words: an algorithm (Q1932359) (← links)
- Compatibility and conjugacy on partial arrays (Q2013016) (← links)
- Algorithms for subsequence combinatorics (Q2378518) (← links)
- Sublinear algorithms for approximating string compressibility (Q2392931) (← links)
- Some characterizations of finite Sturmian words. (Q2490813) (← links)
- Pseudopalindrome closure operators in free monoids (Q2508984) (← links)
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089) (← links)
- The power of commuting with finite sets of words (Q2643146) (← links)
- Special factors in some combinatorial structures (Q2708946) (← links)
- Binomial coefficients and enumeration of restricted words (Q2830494) (← links)
- Efficient Reconstruction of RC-Equivalent Strings (Q3000522) (← links)
- Counting occurrences for a finite set of words (Q3189073) (← links)
- Combinatorics, Words and Symbolic Dynamics (Q3448924) (← links)
- Rich and Periodic-Like Words (Q3637220) (← links)
- (Q4341774) (← links)
- (Q4529991) (← links)
- (Q4665742) (← links)
- On the distribution of characteristic parameters of words (Q4800266) (← links)
- (Q4907314) (← links)
- The geometric properties of an infinitary line and plane languages (Q5036684) (← links)
- Amendable automaton for the language of finite strings of rectangular hilbert curve (Q5036756) (← links)
- (Q5155518) (← links)
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES (Q5483374) (← links)
- Machines, Computations, and Universality (Q5710891) (← links)
- Words and special factors (Q5941274) (← links)
- Partial words and a theorem of Fine and Wilf revisited (Q5958314) (← links)