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