Julien Cassaigne

According to our database1, Julien Cassaigne
  • authored at least 63 papers between 1992 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Cyclic complexity of words.
J. Comb. Theory, Ser. A, 2017

A small minimal aperiodic reversible Turing machine.
J. Comput. Syst. Sci., 2017

k-Abelian Equivalence and Rationality.
Fundam. Inform., 2017

On growth and fluctuation of k-abelian complexity.
Eur. J. Comb., 2017

A Set of Sequences of Complexity 2n+1 2 n + 1.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
Nonhomogeneous Beatty Sequences Leading to Invariant Games.
SIAM J. Discrete Math., 2016

Abelian Complexity and Frequencies of Letters in Infinite Words.
Int. J. Found. Comput. Sci., 2016

Cost and dimension of words of zero topological entropy.
CoRR, 2016

On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited.
CoRR, 2016

k-Abelian Equivalence and Rationality.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
On Growth and Fluctuation of k-Abelian Complexity.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
Avoiding Three Consecutive Blocks of the Same Size and Same Sum.
J. ACM, 2014

Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More.
CoRR, 2014

Cyclic Complexity of Words.
CoRR, 2014

Subword complexity and decomposition of the set of factors.
CoRR, 2014

Cyclic Complexity of Words.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Subword Complexity and Decomposition of the Set of Factors.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Balance Properties of Arnoux-Rauzy Words.
IJAC, 2013

Invariant games and non-homogeneous Beatty sequences.
CoRR, 2013

Which Arnoux-Rauzy Words Are 2-Balanced?
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012
On the decidability of semigroup freeness.
RAIRO - Theor. Inf. and Applic., 2012

Balance properties of Arnoux-Rauzy words
CoRR, 2012

2011
Outer billiard outside regular polygons.
J. London Math. Society, 2011

Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity.
Int. J. Found. Comput. Sci., 2011

Combinatorial trees arising in the study of interval exchange transformations.
Eur. J. Comb., 2011

Avoiding Three Consecutive Blocks of the Same Size and Same Sum
CoRR, 2011

2010
Avoiding Abelian powers in binary words with bounded Abelian complexity
CoRR, 2010

2009
Conjugacy of finite biprefix codes.
Theor. Comput. Sci., 2009

On the number of alpha-power-free binary words for 2alpha<=7/3.
Theor. Comput. Sci., 2009

Infinite Words and Confluent Rewriting Systems: Endomorphism Extensions.
IJAC, 2009

On polynomial growth functions of D0L-systems
CoRR, 2009

On the Morse-Hedlund complexity gap
CoRR, 2009

2008
On extremal properties of the Fibonacci word.
ITA, 2008

On the correlation of binary sequences.
Discrete Applied Mathematics, 2008

On the decidability of semigroup freeness
CoRR, 2008

Asymptotic behavior of growth functions of D0L-systems
CoRR, 2008

Relationally Periodic Sequences and Subword Complexity.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
On the arithmetical complexity of Sturmian words.
Theor. Comput. Sci., 2007

2006
Sequences of low arithmetical complexity.
ITA, 2006

2005
On the correlation of binary sequences.
Electronic Notes in Discrete Mathematics, 2005

2003
Palindrome complexity.
Theor. Comput. Sci., 2003

2002
On the presence of periodic configurations in Turing machines and in counter machines.
Theor. Comput. Sci., 2002

Constructing Infinite Words of Intermediate Complexity.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
On Conjugacy of Languages.
ITA, 2001

The Chinese Monoid.
IJAC, 2001

Recurrence in Infinite Words.
Proceedings of the STACS 2001, 2001

On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations.
Proceedings of the Machines, 2001

1999
Limit Values of the Recurrence Quotient of Sturmian Sequences.
Theor. Comput. Sci., 1999

Double Sequences with Complexity mn+1.
Journal of Automata, Languages and Combinatorics, 1999

On the Undecidability of Freeness of Matrix Semigroups.
IJAC, 1999

Words Strongly Avoiding Fractional Powers.
Eur. J. Comb., 1999

Subword complexity and periodicity in two or more dimensions.
Proceedings of the Developments in Language Theory, 1999

1998
Examples of Undecidable Problems for 2-Generator Matrix Semigroups.
Theor. Comput. Sci., 1998

1997
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms.
Eur. J. Comb., 1997

On a Conjecture of J. Shallit.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Sequences with grouped factors.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1995
A Class of 1-Additive Sequences and Quadratic Recurrences.
Experimental Mathematics, 1995

Special Factors of Sequences with Linear Subword Complexity.
Proceedings of the Developments in Language Theory II, 1995

Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
An Algorithm to Test if a Given Circular HDOL-Language Avoids a Pattern.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
Unavoidable Binary Patterns.
Acta Inf., 1993

Counting Overlap-Free Binary Words.
Proceedings of the STACS 93, 1993

1992
About Gauss codes.
Bulletin of the EATCS, 1992


  Loading...