Geodesic

Sommaire du Fascicule no. 1

Succession rules and deco polyominoes
p. 1-14
Encoding fix in object calculi
p. 15-38
Threshold circuits for iterated matrix product and powering
p. 39-46
On codes with finite interpreting delay : a defect theorem
p. 47-59
Construction of very hard functions for multiparty communication complexity
p. 61-75
A characterization of poly-slender context-free languages
p. 77-86

Sommaire du Fascicule no. 2

Perfect matching in general vs. cubic graphs : a note on the planar and bipartite cases
p. 87-97
Iteration of rational transductions
p. 99-129
Three generators for minimal writing-space computations
p. 131-138
Asynchronous sliding block maps
p. 139-156
On the decidability of the equivalence problem for monadic recursive programs
p. 157-171

Sommaire du Fascicule no. 3

Approximation algorithms for the traveling salesman problem with range condition
p. 173-181
Closure under union and composition of iterated rational transductions
p. 183-212
Improved lower bounds on the approximability of the traveling salesman problem
p. 213-255

Sommaire du Fascicule no. 4

Computing ε-free NFA from regular expressions in O(nlog 2 (n)) time
p. 257-277
On the Horton-Strahler number for combinatorial tries
p. 279-296
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
p. 297-305
Semi-commutations and partial commutations
p. 307-330

Sommaire du Fascicule no. 5

A lower bound for reversible automata
p. 331-341
Return words in sturmian and episturmian words
p. 343-356
A space lower bound for acceptance by one-way Π 2 -alternating machines
p. 357-372
On a paper by Castelli, Mignosi, Restivo
p. 373-377
Local transition functions of quantum Turing machines
p. 379-402
Complexité et automates cellulaires linéaires
p. 403-423

Sommaire du Fascicule no. 6

Finite presentability of strongly finite dilators
p. 425-431
Domain-free λμ-calculus
p. 433-466
Two-variable word equations
p. 467-501
Computing the prefix of an automaton
p. 503-514
Cutwidth of the r-dimensional mesh of d-ary trees
p. 515-519
Galois lattice as a framework to specify building class hierarchies algorithms
p. 521-548
A compositional approach to synchronize two dimensional networks of processors
p. 549-564
Characteristic formulae for timed automata
p. 565-584
Codes générateurs minimaux de langages de mots bi-infinis
p. 585-596