default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 25
Volume 25, 1991
- I. Litovsky:
Minimal generators of submonoids of Ainfinity. 3-17 - 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-100 - Jirí Matousek:
Spanning trees with low crossing number. 103-123 - Uschi Heuter:
First-order properties of trees, star-free expressions, and aperiodicity. 125-145 - 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-169 - Pascal Lienhardt:
Subdivisions de surfaces et cartes généralisées de dimension 2. 171-202 - 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-302 - 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-393 - Solange Coupet-Grimal:
Prolog infinite trees and automata. 397-418 - Masami Ito:
A note on the paper "Disjunctive languages and compatible orders". 419-421 - 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-496 - Tomás Isakowitz:
Can we transform logic programs into attribute grammars? 499-543 - Gerhard Buntrock, Frank Drewes, Clemens Lautemann, Till Mossakowski:
Some modifications of auxiliary pushdown automata. 545-556 - Jacqueline Vauzeilles:
Intuitionistic three-valued logic and logic programming. 557-587
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-24 17:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
