2009 |
29 | EE | Julien Cassaigne,
François Nicolas:
On the Morse-Hedlund complexity gap
CoRR abs/0903.1627: (2009) |
28 | EE | Julien Cassaigne,
François Nicolas:
On polynomial growth functions of D0L-systems
CoRR abs/0904.1752: (2009) |
2008 |
27 | EE | Julien Cassaigne,
Tomi Kärki,
Luca Q. Zamboni:
Relationally Periodic Sequences and Subword Complexity.
Developments in Language Theory 2008: 196-205 |
26 | EE | Julien Cassaigne,
Christian Mauduit,
François Nicolas:
Asymptotic behavior of growth functions of D0L-systems
CoRR abs/0804.1327: (2008) |
25 | EE | Julien Cassaigne,
François Nicolas:
On the decidability of semigroup freeness
CoRR abs/0808.3112: (2008) |
24 | EE | Rudolf Ahlswede,
Julien Cassaigne,
András Sárközy:
On the correlation of binary sequences.
Discrete Applied Mathematics 156(9): 1478-1487 (2008) |
2007 |
23 | EE | Julien Cassaigne,
Anna E. Frid:
On the arithmetical complexity of Sturmian words.
Theor. Comput. Sci. 380(3): 304-316 (2007) |
2005 |
22 | EE | Rudolf Ahlswede,
Julien Cassaigne,
András Sárközy:
On the correlation of binary sequences.
Electronic Notes in Discrete Mathematics 21: 169-171 (2005) |
2003 |
21 | | Jean-Paul Allouche,
Michael Baake,
Julien Cassaigne,
David Damanik:
Palindrome complexity.
Theor. Comput. Sci. 292(1): 9-31 (2003) |
2002 |
20 | EE | Julien Cassaigne:
Constructing Infinite Words of Intermediate Complexity.
Developments in Language Theory 2002: 173-184 |
19 | | Vincent D. Blondel,
Julien Cassaigne,
Codrin M. Nichitiu:
On the presence of periodic configurations in Turing machines and in counter machines.
Theor. Comput. Sci. 289(1): 573-590 (2002) |
2001 |
18 | EE | Vincent D. Blondel,
Julien Cassaigne,
Codrin M. Nichitiu:
On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations.
MCU 2001: 165-176 |
17 | EE | Julien Cassaigne:
Recurrence in Infinite Words.
STACS 2001: 1-11 |
16 | EE | Julien Cassaigne,
Marc Espie,
Daniel Krob,
Jean-Christophe Novelli,
Florent Hivert:
The Chinese Monoid.
IJAC 11(3): 301-334 (2001) |
15 | EE | Julien Cassaigne,
Juhani Karhumäki,
Ján Manuch:
On Conjugacy of Languages.
ITA 35(6): 535-550 (2001) |
1999 |
14 | | Julien Cassaigne:
Subword complexity and periodicity in two or more dimensions.
Developments in Language Theory 1999: 14-21 |
13 | EE | Julien Cassaigne,
James D. Currie:
Words Strongly Avoiding Fractional Powers.
Eur. J. Comb. 20(8): 725-737 (1999) |
12 | | Julien Cassaigne:
Double Sequences with Complexity mn+1.
Journal of Automata, Languages and Combinatorics 4(3): 153-170 (1999) |
11 | EE | Julien Cassaigne:
Limit Values of the Recurrence Quotient of Sturmian Sequences.
Theor. Comput. Sci. 218(1): 3-12 (1999) |
1998 |
10 | EE | Julien Cassaigne,
Juhani Karhumäki:
Examples of Undecidable Problems for 2-Generator Matrix Semigroups.
Theor. Comput. Sci. 204(1-2): 29-34 (1998) |
1997 |
9 | | Julien Cassaigne:
Sequences with grouped factors.
Developments in Language Theory 1997: 211-222 |
8 | | Julien Cassaigne:
On a Conjecture of J. Shallit.
ICALP 1997: 693-704 |
7 | EE | Julien Cassaigne,
Juhani Karhumäki:
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms.
Eur. J. Comb. 18(5): 497-510 (1997) |
1995 |
6 | | Julien Cassaigne,
Juhani Karhumäki:
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract).
COCOON 1995: 244-253 |
5 | | Julien Cassaigne:
Special Factors of Sequences with Linear Subword Complexity.
Developments in Language Theory 1995: 25-34 |
1994 |
4 | | Julien Cassaigne:
An Algorithm to Test if a Given Circular HDOL-Language Avoids a Pattern.
IFIP Congress (1) 1994: 459-464 |
1993 |
3 | | Julien Cassaigne:
Counting Overlap-Free Binary Words.
STACS 1993: 216-225 |
2 | | Julien Cassaigne:
Unavoidable Binary Patterns.
Acta Inf. 30(4): 385-395 (1993) |
1992 |
1 | | Julien Cassaigne,
Sylviane R. Schwer,
Patrice Séébold:
About Gauss codes.
Bulletin of the EATCS 48: 165-171 (1992) |