Journals
Seminars
Books
Lecture notes
Theses
Authors
OFF
Journals
Seminars
Books
Lecture notes
Theses
Authors
All
All
Author
Title
References
Keywords
Full text
Search
NOT
Between
and
Author
All
Author
Title
Date
References
Keywords
Full text
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Volume 43 (2009)
Issue no. 1
Table of Contents
Inf-datalog, modal logic and complexities
Foustoucos, Eugénie
;
Guessarian, Irène
p. 1-21
Equations on partial words
Blanchet-Sadri, Francine
;
Blair, D. Dakota
;
Lewis, Rebeca V.
p. 23-39
On critical exponents in fixed points of
k
-uniform binary morphisms
Krieger, Dalia
p. 41-68
Hyper-minimizing minimized deterministic finite state automata
Badr, Andrew
;
Geffert, Viliam
;
Shipman, Ian
p. 69-94
Hierarchies and reducibilities on regular languages related to modulo counting
Selivanov, Victor L.
p. 95-132
Cycle and path embedding on 5-ary N-cubes
Lin, Tsong-Jie
;
Hsieh, Sun-Yuan
;
Huang, Hui-Ling
p. 133-144
Palindromic complexity of infinite words associated with non-simple Parry numbers
Balková, L'ubomíra
;
Masáková, Zuzana
p. 145-163
Least periods of factors of infinite words
Currie, James D.
;
Saari, Kalle
p. 165-178
Issue no. 2
Table of Contents
Repetitions and permutations of columns in the semijoin algebra
Leinders, Dirk
;
Jan Van Den Bussche
p. 179-187
On the power of randomization for job shop scheduling with
k
-units length tasks
Mömke, Tobias
p. 189-207
The theorem of Fine and Wilf for relational periods
Halava, Vesa
;
Harju, Tero
;
Kärki, Tomi
p. 209-220
Minimal NFA and biRFSA languages
Latteux, Michel
;
Roos, Yves
;
Terlutte, Alain
p. 221-237
A note on dual approximation algorithms for class constrained bin packing problems
Xavier, Eduardo C.
;
Miyazawa, Flàvio Keidi
p. 239-248
Thread algebra for noninterference
Vu, Thuy Duong
p. 249-268
Polynomial languages with finite antidictionaries
Shur, Arseny M.
p. 269-279
Efficient validation and construction of border arrays and validation of string matching automata
Duval, Jean-Pierre
;
Lecroq, Thierry
;
Lefebvre, Arnaud
p. 281-297
Directive words of episturmian words : equivalences and normalization
Glen, Amy
;
Levé, Florence
;
Richomme, Gwénaël
p. 299-319
Tree automata and automata on linear orderings
Bruyère, Véronique
;
Carton, Olivier
;
Sénizergues, Géraud
p. 321-338
Highly undecidable problems for infinite computations
Finkel, Olivier
p. 339-364
On context-free rewriting with a simple restriction and its computational completeness
Masopust, Tomáš
;
Meduna, Alexander
p. 365-378
Nested sibling tree automata
Gire, Françoise
;
Talbot, Jean-Marc
p. 379-402
Issue no. 3
Table of Contents
Episturmian words : a survey
Glen, Amy
;
Justin, Jacques
p. 403-442
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : part I
Cabessa, Jérémie
;
Duparc, Jacques
p. 443-461
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : part II
Cabessa, Jérémie
;
Duparc, Jacques
p. 463-515
Dynamic overloading with copy semantics in object-oriented languages : a formal account
Bettini, Lorenzo
;
Capecchi, Sara
;
Venneri, Betti
p. 517-565
Labeled shortest paths in digraphs with negative and positive edge weights
Bradford, Phillip G.
;
Thomas, David A.
p. 567-583
Measuring the problem-relevant information in input
Dobrev, Stefan
;
Královič, Rastislav
;
Pardubská, Dana
p. 585-613
Squares and cubes in sturmian sequences
Dubickas, Artūras
p. 615-624
Inductive computations on graphs defined by clique-width expressions
Carrère, Frédérique
p. 625-651
Left-to-right regular languages and two-way restarting automata
Otto, Friedrich
p. 653-665
Issue no. 4
Table of Contents
On the proper intervalization of colored caterpillar trees
Àlvarez, Carme
;
Serna, Maria
p. 667-686
Palindromes in infinite ternary words
Balková, L'ubomíra
;
Pelantová, Edita
;
Starosta, Štěpán
p. 687-702
Two extensions of system
𝖥
with (co)iteration and primitive (co)recursion principles
Miranda-Perea, Favio Ezequiel
p. 703-766
A note on the number of squares in a partial word with one hole
Blanchet-Sadri, Francine
;
Mercaş, Robert
p. 767-774
Dejean’s conjecture holds for
𝖭
≥
27
Currie, James
;
Rampersad, Narad
p. 775-778
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
Carrasco, Rafael C.
;
Daciuk, Jan
p. 779-790