Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Heitsch, Christine E.
2001.
Combinatorial Pattern Matching.
Vol. 2089,
Issue. ,
p.
219.
Allouche, J.-P.
Davison, J.L.
Queffélec, M.
and
Zamboni, L.Q.
2001.
Transcendence of Sturmian or Morphic Continued Fractions.
Journal of Number Theory,
Vol. 91,
Issue. 1,
p.
39.
Rosenfeld, Azriel
and
Klette, Reinhard
2001.
Digital Straightness.
Electronic Notes in Theoretical Computer Science,
Vol. 46,
Issue. ,
p.
1.
Damanik, David
2001.
Schrödinger operators with low-complexity potentials.
Ferroelectrics,
Vol. 250,
Issue. 1,
p.
143.
Schaefer, Marcus
Sedgwick, Eric
and
Štefankovič, Daniel
2002.
Recognizing string graphs in NP.
p.
1.
Harju, Tero
and
Nowotka, Dirk
2002.
Density of Critical Factorizations.
RAIRO - Theoretical Informatics and Applications,
Vol. 36,
Issue. 3,
p.
315.
Carpi, Arturo
and
de Luca, Aldo
2002.
On the distribution of characteristic parameters of words.
RAIRO - Theoretical Informatics and Applications,
Vol. 36,
Issue. 1,
p.
67.
Ilie, Lucian
Yu, Sheng
and
Zhang, Kaizhong
2002.
Computing and Combinatorics.
Vol. 2387,
Issue. ,
p.
320.
Frougny, Christiane
2002.
On multiplicatively dependent linear numeration systems, and periodic points.
RAIRO - Theoretical Informatics and Applications,
Vol. 36,
Issue. 3,
p.
293.
Hivert, Florent
Novelli, Jean-Christophe
and
Thibon, Jean-Yves
2002.
Un analogue du monoı̈de plaxique pour les arbres binaires de recherche.
Comptes Rendus. Mathématique,
Vol. 335,
Issue. 7,
p.
577.
Justin, Jacques
and
Pirillo, Giuseppe
2002.
On a characteristic property of ARNOUX–RAUZY sequences.
RAIRO - Theoretical Informatics and Applications,
Vol. 36,
Issue. 4,
p.
385.
Gaujal, B.
and
Hyon, E.
2002.
Optimal routing policies in deterministic queues in tandem.
p.
251.
Karhumäki, Juhani
and
Petre, Ion
2002.
Conway's problem for three-word sets.
Theoretical Computer Science,
Vol. 289,
Issue. 1,
p.
705.
Karhumäki, Juhani
2002.
Mathematical Foundations of Computer Science 2002.
Vol. 2420,
Issue. ,
p.
40.
Karhumäki, Juhani
2003.
Implementation and Application of Automata.
Vol. 2759,
Issue. ,
p.
3.
Tan, Bo
Wen, Zhi-Xiong
and
Zhang, Yiping
2003.
Invertible substitutions on a three-letter alphabet.
Comptes Rendus. Mathématique,
Vol. 336,
Issue. 2,
p.
111.
Bo, Tan
Zhixiong, Wen
and
Yiping, Zhang
2003.
The structure of invertible substitutions on a three-letter alphabet.
Analysis in Theory and Applications,
Vol. 19,
Issue. 4,
p.
365.
Baba, Kensuke
Tsuruta, Satoshi
Shinohara, Ayumi
and
Takeda, Masayuki
2003.
Mathematical Foundations of Computer Science 2003.
Vol. 2747,
Issue. ,
p.
189.
Harju, T.
and
Nowotka, D.
2003.
Developments in Language Theory.
Vol. 2710,
Issue. ,
p.
316.
Cao, Wei-Ting
and
Wen, Zhi-Ying
2003.
Some properties of the factors of Sturmian sequences.
Theoretical Computer Science,
Vol. 304,
Issue. 1-3,
p.
365.