Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=273
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Applications of standard Sturmian words to elementary number theory
Tom C. Brown
Theoretical Computer Science
273
(1-2), 2002, pp. 5-9
A combinatorial problem on trapezoidal words
Flavio D'Allessandro
Theoretical Computer Science
273
(1-2), 2002, pp. 11-33
The
P(n)/n
-function for bi-infinite words
Alex Heinis
Theoretical Computer Science
273
(1-2), 2002, pp. 35-46
Shuffle factorization is unique
Jean Berstel
,
Luc Boasson
Theoretical Computer Science
273
(1-2), 2002, pp. 47-67
The commutation of finite sets: A challenging problem
Christian Choffrut
,
Juhani Karhumäki
,
Nicolas Ollinger
Theoretical Computer Science
273
(1-2), 2002, pp. 69-79
Multiple factorizations of words and defect effect
Juhani Karhumäki
,
Ján Man̑uch
Theoretical Computer Science
273
(1-2), 2002, pp. 81-97
Words and forbidden factors
F. Mignosi
,
A. Rstivo
,
M. Sciortino
Theoretical Computer Science
273
(1-2), 2002, pp. 99-117
Some results on
k
-power-free morphisms
G. Richomme
,
F. Wlazinski
Theoretical Computer Science
273
(1-2), 2002, pp. 119-142
Some combinatorial results on Bernoulli sets and codes
Aldo de Luca
Theoretical Computer Science
273
(1-2), 2002, pp. 143-165
On maximal codes with a finite interpreting delay
Yannick Guesnet
Theoretical Computer Science
273
(1-2), 2002, pp. 167-183
Locally complete sets and finite decomposable codes
Jean Néraud
,
Carla Selmi
Theoretical Computer Science
273
(1-2), 2002, pp. 185-196
Balance properties of multi-dimensional words
Valérie Berthé
,
Robert Tijdeman
Theoretical Computer Science
273
(1-2), 2002, pp. 197-224
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Zoltán Ésik
Theoretical Computer Science
273
(1-2), 2002, pp. 225-248
Finite and infinite pseudorandom binary words
Christian Mauduit
Theoretical Computer Science
273
(1-2), 2002, pp. 249-261
Quantum evolution of words
V. Malyshev
Theoretical Computer Science
273
(1-2), 2002, pp. 263-269
Lyndon words and shuffle algebras for generating the coloured multiple zeta values relations tables
M. Bigotte
,
G. Jacob
,
N.E. Oussous
,
M. Petitot
Theoretical Computer Science
273
(1-2), 2002, pp. 271-282
On the support of graph Lie algebras
G. Duchamp
,
É. Laugerotte
,
J.-G. Luque
Theoretical Computer Science
273
(1-2), 2002, pp. 283-294
Frameproof codes against limited coalitions of pirates
Sylvia Encheva
,
Gérard Cohen
Theoretical Computer Science
273
(1-2), 2002, pp. 295-304