The following pages link to (Q4529547):
Displaying 50 items.
- Some properties of the Tribonacci sequence (Q2372431) (← links)
- Dynamical directions in numeration (Q2372766) (← links)
- Palindromic complexity of infinite words associated with simple Parry numbers (Q2372771) (← links)
- Fractal representation of the attractive lamination of an automorphism of the free group. (Q2372772) (← links)
- Substitutions, abstract number systems and the space filling property (Q2372779) (← links)
- Diffraction spectra of weighted Delone sets on beta-lattices with beta a quadratic unitary Pisot number (Q2372781) (← links)
- On the complexity of infinite words generated by countable \(q\)-automata (Q2372782) (← links)
- Substitutions with cofinal fixed points (Q2372785) (← links)
- On gaps in Rényi \(\beta\)-expansions of unity for \(\beta>1\) an algebraic number (Q2372786) (← links)
- Reversals and palindromes in continued fractions (Q2373747) (← links)
- On alpha-adic expansions in Pisot bases (Q2373748) (← links)
- Functional stepped surfaces, flips, and generalized substitutions (Q2373749) (← links)
- Discrete rotations and symbolic dynamics (Q2373752) (← links)
- A note on the number of squares in a word (Q2373759) (← links)
- Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words (Q2373762) (← links)
- On the set of uniquely decodable codes with a given sequence of code word lengths (Q2374158) (← links)
- Deciding the boundedness and dead-beat stability of constrained switching systems (Q2374570) (← links)
- Algorithms for subsequence combinatorics (Q2378518) (← links)
- A palindromization map for the free group (Q2378526) (← links)
- Quasiperiodic and Lyndon episturmian words (Q2378539) (← links)
- A note on the Markov condition and central words (Q2380082) (← links)
- Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499) (← links)
- The number of runs in a string (Q2381507) (← links)
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms (Q2381820) (← links)
- The equality problem for infinite words generated by primitive morphisms (Q2389351) (← links)
- Minimal complexity of equidistributed infinite permutations (Q2400969) (← links)
- Counting Lyndon factors (Q2401409) (← links)
- Polynomial identities and algebraic combinatorics on words (Q2404199) (← links)
- A characterization of free pairs of upper triangular free monoid morphisms (Q2417854) (← links)
- The number of valid factorizations of Fibonacci prefixes (Q2419114) (← links)
- A Pascal-like bound for the number of necklaces with fixed density (Q2420574) (← links)
- Fractional parts of powers of large rational numbers (Q2421860) (← links)
- Balancedness and coboundaries in symbolic systems (Q2422021) (← links)
- On generalized Lyndon words (Q2422029) (← links)
- Critical exponents of infinite balanced words (Q2422043) (← links)
- Structure of Chinese algebras. (Q2428069) (← links)
- Iterated periodicity over finite aperiodic semigroups (Q2434750) (← links)
- Extremal words in morphic subshifts (Q2436834) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- A generalization of the Fibonacci word fractal and the Fibonacci snowflake (Q2437854) (← links)
- A note on abelian returns in rotation words (Q2437858) (← links)
- On the irrationality exponent of the regular paperfolding numbers (Q2442368) (← links)
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
- Counting minimal semi-Sturmian words (Q2446875) (← links)
- A coloring problem for infinite words (Q2451905) (← links)
- On Dejean's conjecture over large alphabets (Q2456366) (← links)
- Languages with mismatches (Q2456367) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055) (← links)
- An extension of the Burrows-Wheeler transform (Q2465062) (← links)
