\newcommand\etalchar[1]$^#1$
Literatur
- [Cas94]
Julien Cassaigne.
Motifs \'evitables et r\'egulariti\'es dans le mots.
PhD thesis, Universit\'e Paris 6, 1994.
- [CDG\etalchar+97]
Hubert Comon, Max Dauchet, R\'emi Gilleron, Denis Lugiez, Sophie Tison, and
Marc Tommasi.
Tree Automata Techniques and Applications.
http://www.grappa.univ-lille3.fr/tata/, 1997.
- [CG95]
John~H. Conway and Richard~K. Guy.
The Book of Numbers.
Copernicus/Springer, 1995.
- [CIH84]
Karel Culik~II and Tero Harju.
The $\omega$ sequence equivalence problem for d0l systems is
decidable.
Journal ACM, 31(2):282--298, April 1984.
- [CK97]
Christian Choffrut and Juhani Karhum\"aki.
Combinatorics of Words, pages 329--428.
Volume~1 of Rozenberg and Salomaa \citeHFL, 1997.
- [Die97]
Volker Diekert.
Makanin's Algorithm, pages 344--391.
In \citelothaire:acw, 1997.
- [HH01]
Vesa Havala and Tero Harju.
Some new results on post correspondence problem and its
modifications.
TUCS Technical Report 338, Turku Centre for Computer Science, January
2001.
http://www.tucs.fi/publications/techreports/TR338.html.
- [HK97]
Tero Harju and Juhani Karhum\"aki.
Morphisms, pages 439--510.
Volume~1 of Rozenberg and Salomaa \citeHFL, 1997.
- [KRS97]
Lila Kari, Grzegorz Rozenberg, and Arto Salomaa.
L Systems, pages 253--328.
Volume~1 of Rozenberg and Salomaa \citeHFL, 1997.
- [Kur99]
Winfriend Kurth.
Die Simulation der Baumarchitektur mit Wachstumsgrammatiken.
Wissenschaftlicher Verlag Berlin, 1999.
http://www.uni-forst.gwdg.de/~wkurth/public.html.
- [Lin68]
Aristid Lindenmayer.
Mathematical models for cellular interaction in development.
J. Theoret. Biology, 18:280--315, 1968.
- [Lin71]
Aristid Lindenmayer.
Developmental systems without cellular interactions, their languages
and grammars.
J. Theoret. Biology, 30:455--484, 1971.
- [Lot97a]
M.~Lothaire.
Algebraic Combinatorics on Words.
http://www-igm.univ-mlv.fr/~berstel/Lothaire/, 1997.
- [Lot97b]
M.~Lothaire.
Combinatorics on Words.
Cambridge Mathematical Library. Cambridge University Press, 1997.
- [MH38]
Marston Morse and Gustav Hedlund.
Symbolic dynamics.
Amer. J. Mathematics, LX:815--866, 1938.
- [MH44]
Marston Morse and Gustav Hedlund.
Unending chess, symbolic dynamics and a problem in semigroups.
Duke Mathem. J., 11, 1944.
- [MR98]
Sabrina Mantaci and Antonio Restivo.
Codes and equations for trees.
Technical Report 194, Turku Centre for Computer Science, August 1998.
http://altair.math.unipa.it/CSG/sabrina/publications.html.
- [OR00]
John~J. O'Connor and Edmund~F. Robertson.
The MacTutor History of Mathematics Archive.
http://www-groups.dcs.st-and.ac.uk:80/~history/, 2000.
- [Pau98]
Gheorghe Paun.
Computing with membranes.
Technical Report 208, Turku Centre for Computer Science, November
1998.
http://www.tucs.fi/publications/techreports/TR208.html.
- [PL90]
P.~Prusinkiewicz and A.~Lindenmayer.
The Algorithmic Beauty of Plants.
Springer, Berlin, 1990.
- [PWZ96]
Marko Petkovsek, Herbert Wilf, and Doron Zeilberger.
$A = B$.
A. K. Peters, 1996.
http://www.akpeters.com/book.asp?bID=100.
- [RS80]
G.~Rozenberg and A.~Salomaa.
The Mathematical Theory of L Systems.
Academic Press, New York, 1980.
- [RS85]
G.~Rozenberg and A.~Salomaa, editors.
The Book of L.
Springer, Berlin, 1985.
- [RS97]
G.~Rozenberg and A.~Salomaa, editors.
Handbook of Formal Languages.
Springer, 1997.
- [Sal81]
Arto Salomaa.
Jewels of Formal Language Theory.
Computer Science Press, Rockville, 1981.
- [Sch95]
Uwe Sch\"oning.
Perlen der Theoretischen Informatik.
B I Wissenschaftsverlag; Mannheim, 1995.
- [Thu06]
Axel Thue.
Über unendliche zeichenreihen.
Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl. Christiana,
(7), 1906.
- [Thu12]
Axel Thue.
Über die gegenseitige lage gleicher teile gewisser zeichenreihen.
Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl. Christiana,
(10), 1912.