default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 26
Volume 26, 1992
- Walter J. Gutjahr, Georg Ch. Pflug:
The limiting common distribution of two leaf heights in a random brinary tree. 1-18 - Elisabeth Pelz:
Normalization of place/transition-systems preserves net behaviour. 19-44 - Bertrand Le Saëc, Igor Litovsky:
Rebootable and suffix-closed omega-power languages. 45-58 - Chantal Berline:
Rétractions et interprétation interne du polymorphisme: problème de la rétraction universelle. 59-91 - Jürgen Duske, Martin Middendorf, Rainer Parchmann:
Indexed counter languages. 93-113 - Andrea Masini, Andrea Maggiolo-Schettini:
TTL: A formalism to describe local and global properties of distributed systems. 115-149 - C. P. Rupert:
Crossability of cancellative Kleene semigroups. 151-161 - Ulrich Schmid:
On a tree collision resolution algorithm in presence of capture. 163-197 - Filippo Mignosi, Giuseppe Pirillo:
Repetitions in the Fibonacci infinite word. 199-204 - Mireille Bousquet-Mélou:
Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères. 205-219 - Georges Blanc, Noëlle Bleuzen-Guernalec:
Algèbres effectives dans la programmation logique avec constraintes. 221-242 - Tero Harju
, H. C. M. Kleijn, Michel Latteux:
Compositional representation of rational functions. 243-255 - Bruno Courcelle:
The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. 257-286 - Juha Honkala, Arto Salomaa:
Characterization results about L codes. 287-301 - Mireille Régnier:
Enumeration of bordered words. Le langage de la vache-qui-rit. 303-317 - Zhi-Xiong Wen, Zhi-Ying Wen:
Mots infinis et produits de matrices à coefficents polynomiaux. 319-343 - Matthias Krause, Christoph Meinel, Stephan Waack:
Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. 345-362 - Jeanne Devolder, E. Timmerman:
Finitary codes for biinfinite words. 363-386 - Danièle Gardy, Dominique Gouyou-Beauchamps:
Enumerating Davenport-Schinzel sequences. 387-402 - Bernhard Steffen, C. Barry Jay, Michael Mendler:
Compositional characterization of observable program properties. 403-424 - Jean-Luc Lambert:
The local catenativity of DOL-sequences in free communitative monoids is decidable in the binary case. 425-437 - Victor J. Rayward-Smith, Djamal Rebaine:
Open shop scheduling with delays. 439-447 - Mustapha Kabil, Maurice Pouzet:
Une extension d'un théorème de P. Jullien sur les âges de mots. 449-482 - Odile Simon:
Algorithme de multiplicativité des sommes des carrés. 485-506 - Matthias Krause:
Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access. 507-522 - L. Lacaze:
Parties reconnaissables de monoïdes déinis par générateurs et relations. 541-552 - Pierre Péladeau:
Sur le produit avec compteur modulo un nombre entier. 553-564 - Do Long Van, Bertrand Le Saëc, Igor Litovsky:
On coding morphisms for zigzag codes. 565-580
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 2026-02-11 23:50 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:
