


default search action
Theoretical Computer Science, Volume 273
Volume 273, Number 1-2, February 2002
- Jean Néraud

:
WORDS '99 - Preface. 1-3 - Tom C. Brown:

Applications of standard Sturmian words to elementary number theory. 5-9 - Flavio D'Alessandro:

A combinatorial problem on Trapezoidal words. 11-33 - Alex Heinis:

The P(n)/n-function for bi-infinite words. 35-46 - Jean Berstel, Luc Boasson:

Shuffle factorization is unique. 47-67 - Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger:

The commutation of finite sets: a challenging problem. 69-79 - Juhani Karhumäki, Ján Manuch:

Multiple factorizations of words and defect effect. 81-97 - Filippo Mignosi, Antonio Restivo, Marinella Sciortino:

Words and forbidden factors. 99-117 - Gwénaël Richomme, Francis Wlazinski:

Some results on k-power-free morphisms. 119-142 - Aldo de Luca:

Some combinatorial results on Bernoulli sets and codes. 143-165 - Yannick Guesnet:

On maximal codes with a finite interpreting delay. 167-183 - Jean Néraud

, Carla Selmi:
Locally complete sets and finite decomposable codes. 185-196 - Valérie Berthé, Robert Tijdeman:

Balance properties of multi-dimensional words. 197-224 - Zoltán Ésik:

Axiomatizing the subsumption and subword preorders on finite and infinite partial words. 225-248 - Christian Mauduit

:
Finite and infinite pseudorandom binary words. 249-261 - V. Malyshev:

Quantum evolution of words. 263-269 - Michael Bigotte, Gérard Jacob, Nour-Eddine Oussous, Michel Petitot:

Lyndon words and shuffle algebras for generating the coloured multiple zeta values relations tables. 271-282 - Gérard Duchamp, Éric Laugerotte, Jean-Gabriel Luque:

On the support of graph Lie algebras. 283-294 - Sylvia B. Encheva, Gérard D. Cohen:

Frameproof codes against limited coalitions of pirates. 295-304

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














