Sommaire

Preface

Choffrut, Christian ; Colson, Loïc

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

Numdam
Efficiency of automata in semi-commutation verification techniques

Cécé, Gérard ; Héam, Pierre-Cyrille ; Mainier, Yann

Access to full text
Full (PDF)
Full (DJVU)
p. 197-215

Numdam
Preface

Caucal, Didier ; Siegel, Anne

Access to full text
Full (PDF)
Full (DJVU)
p. 415

Numdam
Preface

Berstel, J. ; Harju, T. ; Karhumäki, J.

Access to full text
Full (PDF)
Full (DJVU)
p. 657

Numdam
Tree inclusion problems

Cégielski, Patrick ; Guessarian, Irène ; Matiyasevich, Yuri

Access to full text
Full (PDF)
Full (DJVU)
p. 5-20

Numdam
Binary operations on automatic functions

Karhumäki, Juhani ; Kari, Jarkko ; Kupke, Joachim

Access to full text
Full (PDF)
Full (DJVU)
p. 217-236

Numdam
A hierarchy of automatic ω-words having a decidable MSO theory

Bárány, Vince

Access to full text
Full (PDF)
Full (DJVU)
p. 417-450

Numdam
A note on univoque self-sturmian numbers

Allouche, Jean-Paul

Access to full text
Full (PDF)
Full (DJVU)
p. 659-662

Numdam
About the domino problem in the hyperbolic plane from an algorithmic point of view

Margenstern, Maurice

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

Numdam
Parallel approximation to high multiplicity scheduling problems via smooth multi-valued quadratic programming

Serna, Maria ; Xhafa, Fatos

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

Numdam
Some algebraic properties of machine poset of infinite words

Belovs, Aleksandrs

Access to full text
Full (PDF)
Full (DJVU)
p. 451-466

Numdam
Study of irreducible balanced pairs for substitutive languages

Bernat, Julien

Access to full text
Full (PDF)
Full (DJVU)
p. 663-678

Numdam
Exemples de classes d'automates cellulaires

Delorme, Marianne ; Mazoyer, Jacques

Access to full text
Full (PDF)
Full (DJVU)
p. 37-53

Numdam
Hierarchies of function classes defined by the first-value operator

Hemmerling, Armin

Access to full text
Full (PDF)
Full (DJVU)
p. 253-270

Numdam
From bi-ideals to periodicity

Buls, Jānis ; Lorencs, Aivars

Access to full text
Full (PDF)
Full (DJVU)
p. 467-475

Numdam
On some problems related to palindrome closure

Bucci, Michelangelo ; Luca, Aldo de ; Luca, Alessandro De ; Zamboni, Luca Q.

Access to full text
Full (PDF)
Full (DJVU)
p. 679-700

Numdam
An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem

Yunès, Jean-Baptiste

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

Numdam
Calculi of net structures and sets are similar

Czaja, Ludwik

Access to full text
Full (PDF)
Full (DJVU)
p. 271-284

Numdam
Dejean's conjecture and letter frequency

Chalopin, Jérémie ; Ochem, Pascal

Access to full text
Full (PDF)
Full (DJVU)
p. 477-480

Numdam
On extremal properties of the Fibonacci word

Cassaigne, Julien

Access to full text
Full (PDF)
Full (DJVU)
p. 701-715

Numdam
A complete characterization of primitive recursive intensional behaviours

Valarcher, P.

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

Numdam
Efficient weighted expressions conversion

Ouardi, Faissal ; Ziadi, Djelloul

Access to full text
Full (PDF)
Full (DJVU)
p. 285-307

Numdam
A new algebraic invariant for weak equivalence of sofic subshifts

Chaubard, Laura ; Costa, Alfredo

Access to full text
Full (PDF)
Full (DJVU)
p. 481-502

Numdam
A hierarchy for circular codes

Pirillo, Giuseppe

Access to full text
Full (PDF)
Full (DJVU)
p. 717-728

Numdam
When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P. J. Cameron

Pouzet, Maurice

Access to full text
Full (PDF)
Full (DJVU)
p. 83-103

Numdam
Census algorithms for chinese remainder pseudorank

Laing, David ; Litow, Bruce

Access to full text
Full (PDF)
Full (DJVU)
p. 309-322

Numdam
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid

Giambruno, Laura ; Restivo, Antonio

Access to full text
Full (PDF)
Full (DJVU)
p. 503-524

Numdam
Look and Say Fibonacci

Séébold, Patrice

Access to full text
Full (PDF)
Full (DJVU)
p. 729-746

Numdam
Arithmetization of the field of reals with exponentiation extended abstract

Boughattas, Sedki ; Ressayre, Jean-Pierre

Access to full text
Full (PDF)
Full (DJVU)
p. 105-119

Numdam
Phenotype space and kinship assignment for the Simpson index

Litow, Bruce ; Konovalov, Dmitry

Access to full text
Full (PDF)
Full (DJVU)
p. 323-333

Numdam
Parikh test sets for commutative languages

Holub, Štěpán

Access to full text
Full (PDF)
Full (DJVU)
p. 525-537

Numdam
Periodicity problem of substitutions over ternary alphabets

Tan, Bo ; Wen, Zhi-Ying

Access to full text
Full (PDF)
Full (DJVU)
p. 747-762

Numdam
Deciding whether a relation defined in Presburger logic can be defined in weaker logics

Choffrut, Christian

Access to full text
Full (PDF)
Full (DJVU)
p. 121-135

Numdam
State complexity of cyclic shift

Jirásková, Galina ; Okhotin, Alexander

Access to full text
Full (PDF)
Full (DJVU)
p. 335-360

Numdam
Compatibility relations on codes and free monoids

Kärki, Tomi

Access to full text
Full (PDF)
Full (DJVU)
p. 539-552

Numdam
Weakly maximal decidable structures

Bès, Alexis ; Cégielski, Patrick

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

Numdam
D0L sequence equivalence is in P for fixed alphabets

Ruohonen, Keijo

Access to full text
Full (PDF)
Full (DJVU)
p. 361-374

Numdam
A burnside approach to the termination of Mohri's algorithm for polynomially ambiguous Min-Plus-automata

Kirsten, Daniel

Access to full text
Full (PDF)
Full (DJVU)
p. 553-581

Numdam
Computing the jth solution of a first-order query

Bagan, Guillaume ; Durand, Arnaud ; Grandjean, Etienne ; Olive, Frédéric

Access to full text
Full (PDF)
Full (DJVU)
p. 147-164

Numdam
A morphic approach to combinatorial games : the Tribonacci case

Duchêne, Eric ; Rigo, Michel

Access to full text
Full (PDF)
Full (DJVU)
p. 375-393

Numdam
On varieties of literally idempotent languages

Klíma, Ondřej ; Polák, Libor

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

Numdam
Learning discrete categorial grammars from structures

Besombes, Jérôme ; Marion, Jean-Yves

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

Numdam
On an algorithm to decide whether a free group is a free factor of another

Silva, Pedro V. ; Weil, Pascal

Access to full text
Full (PDF)
Full (DJVU)
p. 395-414

Numdam
Drunken man infinite words complexity

Gonidec, Marion Le

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

Numdam
On the continuity set of an Omega rational function

Carton, Olivier ; Finkel, Olivier ; Simonnet, Pierre

Access to full text
Full (PDF)
Full (DJVU)
p. 183-196

Numdam
Traces of term-automatic graphs

Meyer, Antoine

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

Numdam
Two sided sand piles model and unimodal sequences

Thi Ha Duong Phan

Access to full text
Full (PDF)
Full (DJVU)
p. 631-646

Numdam
Comparing complexity functions of a language and its extendable part

Shur, Arseny M.

Access to full text
Full (PDF)
Full (DJVU)
p. 647-655

Numdam