default search action
Informatique Théorique et Applications, Volume 18
Volume 18, Number 1, 1984
- M. A. Nait Abdallah:
Data Types as Algorithms. 3-22 - Jean-Eric Pin:
Hiérarchies de Concaténation. 23-46 - Jürgen Avenhaus, Ronald V. Book, Craig C. Squier:
On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids. 47-52 - Karel Culík II, Arto Salomaa, Derick Wood:
Systolic Tree Acceptors. 53-69 - Piotr Bak:
A Fast Method of Deadlock Avoidance. 71-80
Volume 18, Number 2, 1984
- Bruno Courcelle, F. Lavandier:
Définitions Récursives Par Cas. 91-129 - Helmut Jürgensen, M. Kunze:
Charakterisierung Redundanzfreier Codes zur Datenverschlüsselung. 131-145 - Alberto Apostolico:
On Context Constrained Squares and Repetitions in a String. 147-159 - Luis Fariñas del Cerro:
Un Principe de Résolution en Logique Modale. 161-170 - Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood:
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. 171-183
Volume 18, Number 3, 1984
- Jean-Pierre Jouannaud, Hélène Kirchner:
Construction D'un Plus Petit Odre de Simplification. 191-208 - Klaus Indermark:
Reduction Semantics for Rational Schemes. 209-223 - Christiane Frougny:
Grammaires Algébriques et Monoïdes Simplifiables. 225-239 - Christiane Hespel:
Approximation de Séries Formelles Par des Séries Rationnelles. 241-258 - H. Alaiwan:
Langages Persistants. 259-278 - Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg:
On Ambiguity in Dos Systems. 279-295
Volume 18, Number 4, 1984
- Walter Bucher, Karel Culík II:
On Real Time and Linear Time Cellular Automata. 307-325 - Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues:
Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses. 327-344 - Susanne Graf:
On Lamport's Comparison Between Linear and Branching Time Temporal Logic. 345-353 - Jean Françon:
Sur Le Nombre de Registres Nécessaires a L'évaluation D'une Expression Arithmétique. 355-364 - Hans-Jürgen Stenger:
Algebraic Characterisations of Ntime(F) and NTime(F, A). 365-385 - Helmut Prodinger:
Analysis of an Algorithm to Construct Fibonacci Partitions. 387-394
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 2024-12-23 19:20 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: