![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Julien Cassaigne
Person information
- affiliation: University of Marseille, France
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j37]Julien Cassaigne, France Gheeraert, Antonio Restivo, Giuseppe Romana, Marinella Sciortino, Manon Stipulanti:
New string attractor-based complexities for infinite words. J. Comb. Theory, Ser. A 208: 105936 (2024) - 2022
- [j36]Julien Cassaigne, Idrissa Kaboré
:
On the Complexity of the Generalized Fibonacci Words. RAIRO Theor. Informatics Appl. 56: 5 (2022)
2010 – 2019
- 2019
- [j35]Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
:
On abelian saturated infinite words. Theor. Comput. Sci. 792: 154-160 (2019) - 2018
- [j34]Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina:
On k-abelian palindromes. Inf. Comput. 260: 89-98 (2018) - 2017
- [j33]Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
:
On growth and fluctuation of k-abelian complexity. Eur. J. Comb. 65: 92-105 (2017) - [j32]Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
:
k-Abelian Equivalence and Rationality. Fundam. Informaticae 154(1-4): 65-94 (2017) - [j31]Julien Cassaigne, Nicolas Ollinger, Rodrigo Torres-Avilés:
A small minimal aperiodic reversible Turing machine. J. Comput. Syst. Sci. 84: 288-301 (2017) - [j30]Julien Cassaigne, Gabriele Fici
, Marinella Sciortino, Luca Q. Zamboni:
Cyclic complexity of words. J. Comb. Theory A 145: 36-56 (2017) - [c17]Julien Cassaigne, Sébastien Labbé
, Julien Leroy:
A Set of Sequences of Complexity 2n+1 2 n + 1. WORDS 2017: 144-156 - [i14]Jean-Paul Allouche, Julien Cassaigne, Jeffrey O. Shallit, Luca Q. Zamboni:
A Taxonomy of Morphic Sequences. CoRR abs/1711.10807 (2017) - 2016
- [j29]Julien Cassaigne, Idrissa Kaboré:
Abelian Complexity and Frequencies of Letters in Infinite Words. Int. J. Found. Comput. Sci. 27(5): 631-650 (2016) - [j28]Julien Cassaigne, Éric Duchêne, Michel Rigo
:
Nonhomogeneous Beatty Sequences Leading to Invariant Games. SIAM J. Discret. Math. 30(3): 1798-1829 (2016) - [c16]Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
:
k-Abelian Equivalence and Rationality. DLT 2016: 77-88 - [i13]Boris Adamczewski, Julien Cassaigne, Marion Le Gonidec:
On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited. CoRR abs/1601.02771 (2016) - [i12]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Cost and dimension of words of zero topological entropy. CoRR abs/1607.04728 (2016) - 2015
- [c15]Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
:
On Growth and Fluctuation of k-Abelian Complexity. CSR 2015: 109-122 - 2014
- [j27]Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit:
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. J. ACM 61(2): 10:1-10:17 (2014) - [c14]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Subword Complexity and Decomposition of the Set of Factors. MFCS (1) 2014: 147-158 - [c13]Julien Cassaigne, Gabriele Fici
, Marinella Sciortino, Luca Q. Zamboni:
Cyclic Complexity of Words. MFCS (1) 2014: 159-170 - [i11]Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni:
Cyclic Complexity of Words. CoRR abs/1402.5843 (2014) - [i10]Julien Cassaigne, Vesa Halava, Tero Harju, François Nicolas:
Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More. CoRR abs/1404.0644 (2014) - [i9]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Subword complexity and decomposition of the set of factors. CoRR abs/1406.3974 (2014) - 2013
- [j26]Valérie Berthé, Julien Cassaigne, Wolfgang Steiner:
Balance Properties of Arnoux-Rauzy Words. Int. J. Algebra Comput. 23(4): 689-704 (2013) - [c12]Julien Cassaigne:
Which Arnoux-Rauzy Words Are 2-Balanced? WORDS 2013: 1-2 - [i8]Julien Cassaigne, Éric Duchêne, Michel Rigo:
Invariant games and non-homogeneous Beatty sequences. CoRR abs/1312.2233 (2013) - 2012
- [j25]Julien Cassaigne, François Nicolas:
On the decidability of semigroup freeness. RAIRO Theor. Informatics Appl. 46(3): 355-399 (2012) - [i7]Valérie Berthé, Julien Cassaigne, Wolfgang Steiner:
Balance properties of Arnoux-Rauzy words. CoRR abs/1212.5106 (2012) - 2011
- [j24]Julien Cassaigne, Sébastien Ferenczi, Luca Q. Zamboni:
Combinatorial trees arising in the study of interval exchange transformations. Eur. J. Comb. 32(8): 1428-1444 (2011) - [j23]Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. Int. J. Found. Comput. Sci. 22(4): 905-920 (2011) - [j22]Nicolas Bedaride, Julien Cassaigne:
Outer billiard outside regular polygons. J. Lond. Math. Soc. 84(2): 303-324 (2011) - [i6]Julien Cassaigne, James D. Currie, Luke Schaeffer, Jeffrey O. Shallit:
Avoiding Three Consecutive Blocks of the Same Size and Same Sum. CoRR abs/1106.5204 (2011) - 2010
- [i5]Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Avoiding Abelian powers in binary words with bounded Abelian complexity. CoRR abs/1005.2514 (2010)
2000 – 2009
- 2009
- [j21]Julien Cassaigne, Pedro V. Silva
:
Infinite Words and Confluent Rewriting Systems: Endomorphism Extensions. Int. J. Algebra Comput. 19(4): 443-490 (2009) - [j20]Julien Cassaigne, Juhani Karhumäki, Petri Salmela:
Conjugacy of finite biprefix codes. Theor. Comput. Sci. 410(24-25): 2345-2351 (2009) - [j19]Vincent D. Blondel, Julien Cassaigne, Raphaël M. Jungers:
On the number of alpha-power-free binary words for 2alpha<=7/3. Theor. Comput. Sci. 410(30-32): 2823-2833 (2009) - [i4]Julien Cassaigne, François Nicolas:
On the Morse-Hedlund complexity gap. CoRR abs/0903.1627 (2009) - [i3]Julien Cassaigne, François Nicolas:
On polynomial growth functions of D0L-systems. CoRR abs/0904.1752 (2009) - 2008
- [j18]Rudolf Ahlswede, Julien Cassaigne, András Sárközy
:
On the correlation of binary sequences. Discret. Appl. Math. 156(9): 1478-1487 (2008) - [j17]Julien Cassaigne:
On extremal properties of the Fibonacci word. RAIRO Theor. Informatics Appl. 42(4): 701-715 (2008) - [c11]Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni:
Relationally Periodic Sequences and Subword Complexity. Developments in Language Theory 2008: 196-205 - [i2]Julien Cassaigne, Christian Mauduit, François Nicolas:
Asymptotic behavior of growth functions of D0L-systems. CoRR abs/0804.1327 (2008) - [i1]Julien Cassaigne, François Nicolas:
On the decidability of semigroup freeness. CoRR abs/0808.3112 (2008) - 2007
- [j16]Julien Cassaigne, Anna E. Frid:
On the arithmetical complexity of Sturmian words. Theor. Comput. Sci. 380(3): 304-316 (2007) - 2006
- [j15]Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid:
Sequences of low arithmetical complexity. RAIRO Theor. Informatics Appl. 40(4): 569-582 (2006) - 2005
- [j14]Rudolf Ahlswede, Julien Cassaigne, András Sárközy
:
On the correlation of binary sequences. Electron. Notes Discret. Math. 21: 169-171 (2005) - 2003
- [j13]Jean-Paul Allouche
, Michael Baake, Julien Cassaigne, David Damanik:
Palindrome complexity. Theor. Comput. Sci. 292(1): 9-31 (2003) - 2002
- [j12]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) - [c10]Julien Cassaigne:
Constructing Infinite Words of Intermediate Complexity. Developments in Language Theory 2002: 173-184 - 2001
- [j11]Julien Cassaigne, Marc Espie, Daniel Krob, Jean-Christophe Novelli, Florent Hivert:
The Chinese Monoid. Int. J. Algebra Comput. 11(3): 301-334 (2001) - [j10]Julien Cassaigne, Juhani Karhumäki, Ján Manuch:
On Conjugacy of Languages. RAIRO Theor. Informatics Appl. 35(6): 535-550 (2001) - [c9]Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu:
On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations. MCU 2001: 165-176 - [c8]Julien Cassaigne:
Recurrence in Infinite Words. STACS 2001: 1-11
1990 – 1999
- 1999
- [j9]Julien Cassaigne, James D. Currie:
Words Strongly Avoiding Fractional Powers. Eur. J. Comb. 20(8): 725-737 (1999) - [j8]Julien Cassaigne, Tero Harju
, Juhani Karhumäki:
On the Undecidability of Freeness of Matrix Semigroups. Int. J. Algebra Comput. 9(3-4): 295-306 (1999) - [j7]Julien Cassaigne:
Double Sequences with Complexity mn+1. J. Autom. Lang. Comb. 4(3): 153-170 (1999) - [j6]Julien Cassaigne:
Limit Values of the Recurrence Quotient of Sturmian Sequences. Theor. Comput. Sci. 218(1): 3-12 (1999) - [c7]Julien Cassaigne:
Subword complexity and periodicity in two or more dimensions. Developments in Language Theory 1999: 14-21 - 1998
- [j5]Julien Cassaigne, Juhani Karhumäki:
Examples of Undecidable Problems for 2-Generator Matrix Semigroups. Theor. Comput. Sci. 204(1-2): 29-34 (1998) - 1997
- [j4]Julien Cassaigne, Juhani Karhumäki:
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms. Eur. J. Comb. 18(5): 497-510 (1997) - [c6]Julien Cassaigne:
Sequences with grouped factors. Developments in Language Theory 1997: 211-222 - [c5]Julien Cassaigne:
On a Conjecture of J. Shallit. ICALP 1997: 693-704 - 1995
- [j3]Julien Cassaigne, Steven R. Finch:
A Class of 1-Additive Sequences and Quadratic Recurrences. Exp. Math. 4(1): 49-60 (1995) - [c4]Julien Cassaigne, Juhani Karhumäki:
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). COCOON 1995: 244-253 - [c3]Julien Cassaigne:
Special Factors of Sequences with Linear Subword Complexity. Developments in Language Theory 1995: 25-34 - 1994
- [c2]Julien Cassaigne:
An Algorithm to Test if a Given Circular HDOL-Language Avoids a Pattern. IFIP Congress (1) 1994: 459-464 - 1993
- [j2]Julien Cassaigne:
Unavoidable Binary Patterns. Acta Informatica 30(4): 385-395 (1993) - [c1]Julien Cassaigne:
Counting Overlap-Free Binary Words. STACS 1993: 216-225 - 1992
- [j1]Julien Cassaigne, Sylviane R. Schwer, Patrice Séébold:
About Gauss codes. Bull. EATCS 48: 165-171 (1992)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-11 01:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint