Search the dblp DataBase
Julien Cassaigne :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Julien Cassaigne , Juhani Karhumäki Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:244-253 [Conf ] Julien Cassaigne Subword complexity and periodicity in two or more dimensions. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 1999, pp:14-21 [Conf ] Julien Cassaigne Special Factors of Sequences with Linear Subword Complexity. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 1995, pp:25-34 [Conf ] Julien Cassaigne Constructing Infinite Words of Intermediate Complexity. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2002, pp:173-184 [Conf ] Julien Cassaigne On a Conjecture of J. Shallit. [Citation Graph (0, 0)][DBLP ] ICALP, 1997, pp:693-704 [Conf ] Julien Cassaigne An Algorithm to Test if a Given Circular HDOL-Language Avoids a Pattern. [Citation Graph (0, 0)][DBLP ] IFIP Congress (1), 1994, pp:459-464 [Conf ] Vincent D. Blondel , Julien Cassaigne , Codrin M. Nichitiu On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations. [Citation Graph (0, 0)][DBLP ] MCU, 2001, pp:165-176 [Conf ] Julien Cassaigne Recurrence in Infinite Words. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:1-11 [Conf ] Julien Cassaigne Counting Overlap-Free Binary Words. [Citation Graph (0, 0)][DBLP ] STACS, 1993, pp:216-225 [Conf ] Julien Cassaigne Unavoidable Binary Patterns. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1993, v:30, n:4, pp:385-395 [Journal ] Julien Cassaigne , Sylviane R. Schwer , Patrice Séébold About Gauss codes. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1992, v:48, n:, pp:165-171 [Journal ] Julien Cassaigne , James D. Currie Words Strongly Avoiding Fractional Powers. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1999, v:20, n:8, pp:725-737 [Journal ] Julien Cassaigne , Juhani Karhumäki Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1997, v:18, n:5, pp:497-510 [Journal ] Julien Cassaigne , Marc Espie , Daniel Krob , Jean-Christophe Novelli , Florent Hivert The Chinese Monoid. [Citation Graph (0, 0)][DBLP ] IJAC, 2001, v:11, n:3, pp:301-334 [Journal ] Julien Cassaigne , Juhani Karhumäki , Ján Manuch On Conjugacy of Languages. [Citation Graph (0, 0)][DBLP ] ITA, 2001, v:35, n:6, pp:535-550 [Journal ] Julien Cassaigne Double Sequences with Complexity mn+1. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:153-170 [Journal ] Jean-Paul Allouche , Michael Baake , Julien Cassaigne , David Damanik Palindrome complexity. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:292, n:1, pp:9-31 [Journal ] Vincent D. Blondel , Julien Cassaigne , Codrin M. Nichitiu On the presence of periodic configurations in Turing machines and in counter machines. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:289, n:1, pp:573-590 [Journal ] Julien Cassaigne Limit Values of the Recurrence Quotient of Sturmian Sequences. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:218, n:1, pp:3-12 [Journal ] Julien Cassaigne , Juhani Karhumäki Examples of Undecidable Problems for 2-Generator Matrix Semigroups. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:204, n:1-2, pp:29-34 [Journal ] Julien Cassaigne , Anna E. Frid On the arithmetical complexity of Sturmian words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:380, n:3, pp:304-316 [Journal ] Relationally Periodic Sequences and Subword Complexity. [Citation Graph (, )][DBLP ] Sequences with grouped factors. [Citation Graph (, )][DBLP ] Asymptotic behavior of growth functions of D0L-systems [Citation Graph (, )][DBLP ] On the decidability of semigroup freeness [Citation Graph (, )][DBLP ] On the Morse-Hedlund complexity gap [Citation Graph (, )][DBLP ] On polynomial growth functions of D0L-systems [Citation Graph (, )][DBLP ] Avoiding Abelian powers in binary words with bounded Abelian complexity [Citation Graph (, )][DBLP ] On the correlation of binary sequences. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.306secs