Volume 25, 1991
- I. Litovsky:
Minimal generators of submonoids of Ainfinity.
3-18
- Andreas Weber, Helmut Seidl:
On finitely generated monoids of matrices with entries in N.
19-38
- W. Forys:
On equality sets of morphisms in topological free monoids.
39-42
- Peter Kirschenhofer, Helmut Prodinger:
Approximate counting: an alternative approach.
43-48
- Marcella Anselmo:
Automates et code zigzag.
49-66
- Jean-Louis Krivine:
Lambda-calcul, évaluation paresseuse et mise en mémoire.
67-84
- U. Rösler:
A limit theorem for "Quicksort".
85-102
- Jirí Matousek:
Spanning trees with low crossing number.
103-124
- Uschi Heuter:
First-order properties of trees, star-free expressions, and aperiodicity.
125-146
- Walter Vogler:
A generalization of traces.
147-156
- Jocelyne Rouyer:
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.
157-170
- Pascal Lienhardt:
Subdivisions de surfaces et cartes généralisées de dimension 2.
171-204
- Francis Bossut, Bruno Warin:
On a code problem concerning planar acyclic graphs.
205-218
- Didier Arquès, Isabelle Jacques:
Solides non organisés: definition, implantation et plongement.
219-246
- Tom Head:
The topologies of sofic subshifts have computable Pierce invariants.
247-254
- Thomas Herbst:
On a subclass of context-free groups.
255-272
- Maylis Delest, Jean-Marc Fedou:
Introduction aux polyèdres en combinatoire d'apres E. Ehrhart et R. Stanley.
273-292
- Shouwen Tang, Ronald V. Book:
Reducibilities on tally and sparse sets.
293-304
- Marina Madonia, Sergio Salemi, Tecla Sportelli:
On z-submonoids and z-codes.
305-322
- Stephan Waack:
On the parallel complexity of linear groups.
323-354
- A. Arnold:
An extension of the notions of traces and of asynchronous automata.
355-396
- Solange Coupet-Grimal:
Prolog infinite trees and automata.
397-418
- M. Ito:
A note on the paper "Disjunctive languages and compatible orders".
419-422
- Daniel Krob:
Matrix versions of a aperiodic K-rational identities.
423-444
- Berthold Hoffmann, Detlef Plump:
Implementing term rewriting by jungle evaluation.
445-472
- Viliam Geffert:
Normal forms for phrase-structure grammars.
473-498
- Tomás Isakowitz:
Can we transform logic programs into attribute grammars?
499-544
- Gerhard Buntrock:
Some modifications of auxiliary pushdown automata.
545-556
- Jacqueline Vauzeilles:
Intuitionistic three-valued logic and logic programming.
557-
Last update Sat May 18 20:37:55 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
