default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRAIRO - Theoretical Informatics and Applications, Volume 44
Volume 44, Number 1, January 2010
- Véronique Bruyère, Michel Rigo
:
Foreword. 1
- Petr Ambroz, Zuzana Masáková, Edita Pelantová:
Morphisms fixing words associated with exchange of three intervals. 3-17 - Pierre-Yves Angrand, Jacques Sakarovitch:
Radix enumeration of rational languages. 19-36 - Eugene Asarin, Catalin Dima:
On the computation of covert channel capacity. 37-58 - Jean-Pierre Borel:
How to build billiard words using decimations. 59-77 - Thomas Brihaye, Véronique Bruyère, Elaine Render:
Formal language properties of hybrid systems with strong resets. 79-111 - James D. Currie, Narad Rampersad:
Infinite words containing squares at every position. 113-124 - Vesa Halava, Tero Harju, Tomi Kärki:
On the number of squares in partial words. 125-138 - Dalia Krieger:
The critical exponent of the Arshon words. 139-150 - Pascal Ochem:
Binary words avoiding the pattern AABBCABBA. 151-158 - Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Standard factors of Sturmian words. 159-174 - Arseny M. Shur, Irina A. Gorbunova:
On the growth rates of complexity of threshold languages. 175-192
Volume 44, Number 2, April 2010
- Johannes C. Schneider:
Unambiguous erasing morphisms in free monoids. 193-208 - Anton Cerný:
Generalizations of Parikh mappings. 209-228 - Henning Bordihn, Jürgen Dassow, Markus Holzer:
Extending regular expressions with homomorphic replacement. 229-255 - Symeon Bozapalidis, Antonios Kalampakas:
On the syntactic complexity of tree series. 257-279
Volume 44, Number 3, July 2010
- Ilya Goldstein:
On the D0L Repetition Threshold. 281-292 - Edson Norberto Cáceres, Siang Wun Song, Jayme Luiz Szwarcfiter:
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search. 293-311 - Ondrej Turek:
Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words. 313-337 - Sylvain Lombardy, Jacques Sakarovitch:
Corrigendum to our paper: How Expressions Can Code for Automata. 339-361 - Hans-Joachim Böckenhauer, Michal Forisek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová:
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification. 363-377 - Armin Hemmerling:
Function operators spanning the arithmetical and the polynomial hierarchy. 379-418
Volume 44, Number 4, October 2010
- Stefano Baratella:
Quantum coherent spaces and linear logic. 419-441 - L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Sturmian jungle (or garden?) on multiliteral alphabets. 443-470 - Marcella Anselmo, Maria Madonia:
Classes of two-dimensional languages and recognizability conditions. 471-488 - Michal Kolarz:
The code problem for directed figures. 489-506 - Viliam Geffert, Lubomíra Istonová:
Translation from classical two-way automata to pebble two-way automata. 507-523 - Paolo Massazza, Roberto Radicioni:
A CAT algorithm for the exhaustive generation of ice piles. 525-543
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.
last updated on 2025-11-06 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
