Geodesic

Sommaire du Fascicule no. 1

Minimal generators of submonoids of A ∞
p. 3-17
On finitely generated monoids of matrices with entries in ℕ
p. 19-38
On equality sets of morphisms in topological free monoids
p. 39-42
Approximate counting : an alternative approach
p. 43-48
Automates et codes zigzag
p. 49-66
Lambda-calcul, évaluation paresseuse et mise en mémoire
p. 67-84
A limit theorem for “quicksort”
p. 85-100

Sommaire du Fascicule no. 2

Spanning trees with low crossing number
p. 103-123
First-order properties of trees, star-free expressions, and aperiodicity
p. 125-145
A generalization of traces
p. 147-156
Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm
p. 157-169
Subdivisions de surfaces et cartes généralisées de dimension 2
p. 171-202

Sommaire du Fascicule no. 3

On a code problem concerning planar acyclic graphs
p. 205-218
Solides non organisés : définition, implantation et plongement
p. 219-246
The topologies of sofic subshifts have computable Pierce invariants
p. 247-254
On a subclass of context-free groups
p. 255-272
Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley
p. 273-292
Reducibilities on tally and sparse sets
p. 293-302

Sommaire du Fascicule no. 4

On z-submonoids and z-codes
p. 305-322
On the parallel complexity of linear groups
p. 323-354
An extension of the notions of traces and of asynchronous automata
p. 355-393

Sommaire du Fascicule no. 5

Prolog infinite trees and automata
p. 397-418
A note on the paper “disjunctive languages and compatible orders”
p. 419-421
Matrix versions of aperiodic K-rational identities
p. 423-444
Implementing term rewriting by jungle evaluation
p. 445-472
Normal forms for phrase-structure grammars
p. 473-496

Sommaire du Fascicule no. 6

Can we transform logic programs into attribute grammars ?
p. 499-543
Some modifications of auxiliary pushdown automata
p. 545-556
Intuitionistic three-valued logic and logic programming
p. 557-587