Sommaire

Inf-datalog, modal logic and complexities

Foustoucos, Eugénie ; Guessarian, Irène

Access to full text
Full (PDF)
Full (DJVU)
p. 1-21

Numdam
Repetitions and permutations of columns in the semijoin algebra

Leinders, Dirk ; Jan Van Den Bussche

Access to full text
Full (PDF)
Full (DJVU)
p. 179-187

Numdam
Episturmian words : a survey

Glen, Amy ; Justin, Jacques

Access to full text
Full (PDF)
Full (DJVU)
p. 403-442

Numdam
On the proper intervalization of colored caterpillar trees

Àlvarez, Carme ; Serna, Maria

Access to full text
Full (PDF)
Full (DJVU)
p. 667-686

Numdam
Equations on partial words

Blanchet-Sadri, Francine ; Blair, D. Dakota ; Lewis, Rebeca V.

Access to full text
Full (PDF)
Full (DJVU)
p. 23-39

Numdam
On the power of randomization for job shop scheduling with k-units length tasks

Mömke, Tobias

Access to full text
Full (PDF)
Full (DJVU)
p. 189-207

Numdam
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : part I

Cabessa, Jérémie ; Duparc, Jacques

Access to full text
Full (PDF)
Full (DJVU)
p. 443-461

Numdam
Palindromes in infinite ternary words

Balková, L'ubomíra ; Pelantová, Edita ; Starosta, Štěpán

Access to full text
Full (PDF)
Full (DJVU)
p. 687-702

Numdam
On critical exponents in fixed points of k-uniform binary morphisms

Krieger, Dalia

Access to full text
Full (PDF)
Full (DJVU)
p. 41-68

Numdam
The theorem of Fine and Wilf for relational periods

Halava, Vesa ; Harju, Tero ; Kärki, Tomi

Access to full text
Full (PDF)
Full (DJVU)
p. 209-220

Numdam
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : part II

Cabessa, Jérémie ; Duparc, Jacques

Access to full text
Full (PDF)
Full (DJVU)
p. 463-515

Numdam
Two extensions of system 𝖥 with (co)iteration and primitive (co)recursion principles

Miranda-Perea, Favio Ezequiel

Access to full text
Full (PDF)
Full (DJVU)
p. 703-766

Numdam
Hyper-minimizing minimized deterministic finite state automata

Badr, Andrew ; Geffert, Viliam ; Shipman, Ian

Access to full text
Full (PDF)
Full (DJVU)
p. 69-94

Numdam
Minimal NFA and biRFSA languages

Latteux, Michel ; Roos, Yves ; Terlutte, Alain

Access to full text
Full (PDF)
Full (DJVU)
p. 221-237

Numdam
Dynamic overloading with copy semantics in object-oriented languages : a formal account

Bettini, Lorenzo ; Capecchi, Sara ; Venneri, Betti

Access to full text
Full (PDF)
Full (DJVU)
p. 517-565

Numdam
A note on the number of squares in a partial word with one hole

Blanchet-Sadri, Francine ; Mercaş, Robert

Access to full text
Full (PDF)
Full (DJVU)
p. 767-774

Numdam
Hierarchies and reducibilities on regular languages related to modulo counting

Selivanov, Victor L.

Access to full text
Full (PDF)
Full (DJVU)
p. 95-132

Numdam
A note on dual approximation algorithms for class constrained bin packing problems

Xavier, Eduardo C. ; Miyazawa, Flàvio Keidi

Access to full text
Full (PDF)
Full (DJVU)
p. 239-248

Numdam
Labeled shortest paths in digraphs with negative and positive edge weights

Bradford, Phillip G. ; Thomas, David A.

Access to full text
Full (PDF)
Full (DJVU)
p. 567-583

Numdam
Dejean’s conjecture holds for 𝖭≥27

Currie, James ; Rampersad, Narad

Access to full text
Full (PDF)
Full (DJVU)
p. 775-778

Numdam
Cycle and path embedding on 5-ary N-cubes

Lin, Tsong-Jie ; Hsieh, Sun-Yuan ; Huang, Hui-Ling

Access to full text
Full (PDF)
Full (DJVU)
p. 133-144

Numdam
Thread algebra for noninterference

Vu, Thuy Duong

Access to full text
Full (PDF)
Full (DJVU)
p. 249-268

Numdam
Measuring the problem-relevant information in input

Dobrev, Stefan ; Královič, Rastislav ; Pardubská, Dana

Access to full text
Full (PDF)
Full (DJVU)
p. 585-613

Numdam
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata

Carrasco, Rafael C. ; Daciuk, Jan

Access to full text
Full (PDF)
Full (DJVU)
p. 779-790

Numdam
Palindromic complexity of infinite words associated with non-simple Parry numbers

Balková, L'ubomíra ; Masáková, Zuzana

Access to full text
Full (PDF)
Full (DJVU)
p. 145-163

Numdam
Polynomial languages with finite antidictionaries

Shur, Arseny M.

Access to full text
Full (PDF)
Full (DJVU)
p. 269-279

Numdam
Squares and cubes in sturmian sequences

Dubickas, Artūras

Access to full text
Full (PDF)
Full (DJVU)
p. 615-624

Numdam
Least periods of factors of infinite words

Currie, James D. ; Saari, Kalle

Access to full text
Full (PDF)
Full (DJVU)
p. 165-178

Numdam
Efficient validation and construction of border arrays and validation of string matching automata

Duval, Jean-Pierre ; Lecroq, Thierry ; Lefebvre, Arnaud

Access to full text
Full (PDF)
Full (DJVU)
p. 281-297

Numdam
Inductive computations on graphs defined by clique-width expressions

Carrère, Frédérique

Access to full text
Full (PDF)
Full (DJVU)
p. 625-651

Numdam
Directive words of episturmian words : equivalences and normalization

Glen, Amy ; Levé, Florence ; Richomme, Gwénaël

Access to full text
Full (PDF)
Full (DJVU)
p. 299-319

Numdam
Left-to-right regular languages and two-way restarting automata

Otto, Friedrich

Access to full text
Full (PDF)
Full (DJVU)
p. 653-665

Numdam
Tree automata and automata on linear orderings

Bruyère, Véronique ; Carton, Olivier ; Sénizergues, Géraud

Access to full text
Full (PDF)
Full (DJVU)
p. 321-338

Numdam
Highly undecidable problems for infinite computations

Finkel, Olivier

Access to full text
Full (PDF)
Full (DJVU)
p. 339-364

Numdam
On context-free rewriting with a simple restriction and its computational completeness

Masopust, Tomáš ; Meduna, Alexander

Access to full text
Full (PDF)
Full (DJVU)
p. 365-378

Numdam
Nested sibling tree automata

Gire, Françoise ; Talbot, Jean-Marc

Access to full text
Full (PDF)
Full (DJVU)
p. 379-402

Numdam