Sommaire

Minimal generators of submonoids of A ∞

Litovsky, I.

Access to full text
Full (PDF)
Full (DJVU)
p. 3-17

Numdam
Spanning trees with low crossing number

Matoušek, Jiří

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

Numdam
On a code problem concerning planar acyclic graphs

Bossut, F. ; Warin, B.

Access to full text
Full (PDF)
Full (DJVU)
p. 205-218

Numdam
On z-submonoids and z-codes

Madonia, M. ; Salemi, S. ; Sportelli, T.

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

Numdam
Prolog infinite trees and automata

Coupet-Grimal, Solange

Access to full text
Full (PDF)
Full (DJVU)
p. 397-418

Numdam
Can we transform logic programs into attribute grammars ?

Isakowitz, T.

Access to full text
Full (PDF)
Full (DJVU)
p. 499-543

Numdam
On finitely generated monoids of matrices with entries in ℕ

Weber, Andreas ; Seidl, Helmut

Access to full text
Full (PDF)
Full (DJVU)
p. 19-38

Numdam
First-order properties of trees, star-free expressions, and aperiodicity

Heuter, Uschi

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

Numdam
Solides non organisés : définition, implantation et plongement

Arques, Didier ; Jacques, Isabelle

Access to full text
Full (PDF)
Full (DJVU)
p. 219-246

Numdam
On the parallel complexity of linear groups

Waack, St.

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

Numdam
A note on the paper “disjunctive languages and compatible orders”

Ito, M.

Access to full text
Full (PDF)
Full (DJVU)
p. 419-421

Numdam
Some modifications of auxiliary pushdown automata

Buntrock, G. ; Drewes, F. ; Lautemann, C. ; Mossakowski, T.

Access to full text
Full (PDF)
Full (DJVU)
p. 545-556

Numdam
On equality sets of morphisms in topological free monoids

Foryś, Wit

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

Numdam
A generalization of traces

Vogler, Walter

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

Numdam
The topologies of sofic subshifts have computable Pierce invariants

Head, Tom

Access to full text
Full (PDF)
Full (DJVU)
p. 247-254

Numdam
An extension of the notions of traces and of asynchronous automata

Arnold, A.

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

Numdam
Matrix versions of aperiodic K-rational identities

Krob, Daniel

Access to full text
Full (PDF)
Full (DJVU)
p. 423-444

Numdam
Intuitionistic three-valued logic and logic programming

Vauzeilles, J. ; Strauss, A.

Access to full text
Full (PDF)
Full (DJVU)
p. 557-587

Numdam
Approximate counting : an alternative approach

Kirschenhofer, Peter ; Prodinger, Helmut

Access to full text
Full (PDF)
Full (DJVU)
p. 43-48

Numdam
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

Rouyer, Jocelyne

Access to full text
Full (PDF)
Full (DJVU)
p. 157-169

Numdam
On a subclass of context-free groups

Herbst, Thomas

Access to full text
Full (PDF)
Full (DJVU)
p. 255-272

Numdam
Implementing term rewriting by jungle evaluation

Hoffmann, Berthold ; Plump, Detlef

Access to full text
Full (PDF)
Full (DJVU)
p. 445-472

Numdam
Automates et codes zigzag

Anselmo, Marcella

Access to full text
Full (PDF)
Full (DJVU)
p. 49-66

Numdam
Subdivisions de surfaces et cartes généralisées de dimension 2

Lienhardt, Pascal

Access to full text
Full (PDF)
Full (DJVU)
p. 171-202

Numdam
Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley

Delest, M. ; Fedou, J. M.

Access to full text
Full (PDF)
Full (DJVU)
p. 273-292

Numdam
Normal forms for phrase-structure grammars

Geffert, Viliam

Access to full text
Full (PDF)
Full (DJVU)
p. 473-496

Numdam
Lambda-calcul, évaluation paresseuse et mise en mémoire

Krivine, Jean-Louis

Access to full text
Full (PDF)
Full (DJVU)
p. 67-84

Numdam
Reducibilities on tally and sparse sets

Tang, Shouwen ; Book, Ronald V.

Access to full text
Full (PDF)
Full (DJVU)
p. 293-302

Numdam
A limit theorem for “quicksort”

Rösler, Uwe

Access to full text
Full (PDF)
Full (DJVU)
p. 85-100

Numdam