The following pages link to Julien Cassaigne (Q340587):
Displaying 50 items.
- A small minimal aperiodic reversible Turing machine (Q340590) (← links)
- Cyclic complexity of words (Q507796) (← links)
- On possible growths of Toeplitz languages (Q536628) (← links)
- Properties and limits of recognition of sets of integers by countable automata (Q628831) (← links)
- Combinatorial trees arising in the study of interval exchange transformations (Q648999) (← links)
- (Q947091) (redirect page) (← links)
- Weak mixing and eigenvalues for Arnoux-Rauzy sequences (Q954812) (← links)
- Infinite periodic points of endomorphisms over special confluent rewriting systems (Q1013030) (← links)
- Conjugacy of finite biprefix codes (Q1019714) (← links)
- Examples of undecidable problems for 2-generator matrix semigroups (Q1275458) (← links)
- Complexity and special factors (Q1280227) (← links)
- Limit values of the recurrence quotient of Sturmian sequences (Q1292478) (← links)
- Unavoidable binary patterns (Q1323331) (← links)
- Toeplitz words, generalized periodicity and periodically iterated morphisms (Q1362993) (← links)
- On the transcendence of real numbers with a regular expansion. (Q1415365) (← links)
- Imbalances in Arnoux-Rauzy sequences (Q1572652) (← links)
- Heights of hypersurfaces and Igusa's zeta-functions (Q1581871) (← links)
- Complexity and growth for polygonal billiards (Q1613963) (← links)
- A set of sequences of complexity \(2n+1\) (Q1678348) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Some properties of substitutive words (Q1781918) (← links)
- On the presence of periodic configurations in Turing machines and in counter machines. (Q1853547) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← links)
- Almost everywhere balanced sequences of complexity \(2n + 1\) (Q2107735) (← links)
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) (Q2271420) (← links)
- On abelian saturated infinite words (Q2326392) (← links)
- Recurrence functions of Arnoux-Rauzy sequences, and answer to a question of Morse and Hedlund (Q2372775) (← links)
- On the arithmetical complexity of Sturmian words (Q2373754) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- Subword complexity and periodicity in two or more dimensions (Q2708947) (← links)
- (Q2762492) (← links)
- k-Abelian Equivalence and Rationality (Q2817377) (← links)
- Nonhomogeneous Beatty sequences leading to invariant games (Q2820861) (← links)
- Abelian complexity and frequencies of letters in infinite words (Q2833546) (← links)
- Balance properties of Arnoux-Rauzy words (Q2842015) (← links)
- Which Arnoux-Rauzy Words Are 2-Balanced? (Q2849971) (← links)
- On the decidability of semigroup freeness. (Q2905326) (← links)
- Subword Complexity and Decomposition of the Set of Factors (Q2922010) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224) (← links)
- Outer billiard outside regular polygons (Q3093414) (← links)
- (Q3104341) (← links)
- On Conjugacy of Languages (Q3147021) (← links)
- Avoiding Three Consecutive Blocks of the Same Size and Same Sum (Q3189645) (← links)
- On Growth and Fluctuation of k-Abelian Complexity (Q3194711) (← links)
- Cost and dimension of words of zero topological entropy (Q3299253) (← links)
- Diophantine properties of real numbers generated by finite automata (Q3413971) (← links)
- Sequences of low arithmetical complexity (Q3423138) (← links)
- Relationally Periodic Sequences and Subword Complexity (Q3533010) (← links)
