Volume 43,
Number 1,
January-March 2009
- Eugénie Foustoucos, Irène Guessarian:
Inf-datalog, Modal Logic and Complexities.
1-21
- Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis:
Equations on partial words.
23-39
- Dalia Krieger:
On Critical exponents in fixed points of k-uniform binary morphisms.
41-68
- Andrew Badr, Viliam Geffert, Ian Shipman:
Hyper-minimizing minimized deterministic finite state automata.
69-94
- Victor L. Selivanov:
Hierarchies and reducibilities on regular languages related to modulo counting.
95-132
- Tsong-Jie Lin, Sun-Yuan Hsieh, Hui-Ling Huang:
Cycle and Path Embedding on 5-ary N-cubes.
133-144
- Lubomíra Balková, Zuzana Masáková:
Palindromic complexity of infinite words associated with non-simple Parry numbers.
145-163
- James D. Currie, Kalle Saari:
Least Periods of Factors of Infinite Words.
165-178
Volume 43,
Number 2,
April-June 2009
- Dirk Leinders, Jan Van den Bussche:
Repetitions and permutations of columns in the semijoin algebra.
179-187
- Tobias Mömke:
On the power of randomization for job shop scheduling with k-units length tasks.
189-207
- Vesa Halava, Tero Harju, Tomi Kärki:
The theorem of Fine and Wilf for relational periods.
209-220
- Michel Latteux, Yves Roos, Alain Terlutte:
Minimal NFA and biRFSA Languages.
221-237
- Eduardo C. Xavier, Flávio Keidi Miyazawa:
A note on dual approximation algorithms for class constrained bin packing problems.
239-248
- Thuy Duong Vu:
Thread algebra for noninterference.
249-268
- Arseny M. Shur:
Polynomial languages with finite antidictionaries.
269-279
- Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Efficient validation and construction of border arrays and validation of string matching automata.
281-297
- Amy Glen, Florence Levé, Gwénaël Richomme:
Directive words of episturmian words: equivalences and normalization.
299-319
- Véronique Bruyère, Olivier Carton, Géraud Sénizergues:
Tree Automata and Automata on Linear Orderings.
321-338
- Olivier Finkel:
Highly Undecidable Problems For Infinite Computations.
339-364
- Tomás Masopust, Alexander Meduna:
On context-free rewriting with a simple restriction and its computational completeness.
365-378
- Françoise Gire, Jean-Marc Talbot:
Nested Sibling Tree Automata.
379-402
Volume 43,
Number 3,
July-September 2009
Volume 43,
Number 4,
October-December 2009
Last update Mon Feb 13 04:50:59 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
