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