1. ICALP 1972:
Paris,
France
Maurice Nivat (Ed.):
Automata,
Languages and Programming,
Colloquium,
Paris,
France,
July 3-7,
1972. North-Holland,
Amsterdam,
ISBN 0-7204-2074-1
- Philippe Butzbach:
Une famille de congruences de Thue pour lesquelles le problème de l'équivalence est décidable. Application á l'équivalence des grammaires séparées.
3-12
- Christian Choffrut:
Transducteurs conservant l'imprimitivité du langage d'entrée.
13-29
- Robert Cori:
Sur des langages vérifiant des équations avec opérateur.
31-43
- Frederick A. Hosch, Lawrence H. Landweber:
Finite Delay Solutions for Sequential Conditions.
45-60
- R. E. Kalman:
Realization Theory of Linear Systems over a Commutative Ring.
61-65
- A. Lentin:
Equations in Free Monoids.
67-85
- Matti Linna:
Finite Power Property of Regular Languages.
87-98
- Azaria Paz, Michael Rabinovich:
Linear Automata - Approximation Problem (Extended Abstract).
99-102
- Marcel Paul Schützenberger:
A propos du relation rationelles fonctionnelles.
103-114
- Guy Vidal-Naquet:
Quelques applications des automates à arbres infinis.
115-122
- Gérard Viennot:
Automates et bascules.
123-133
- Yechezkel Zalcstein:
Syntactic Semigroups of Some Classes of Star-Free Languages.
135-144
- Gianni Aguzzi, Renzo Pinzani, Renzo Sprugnoli:
An Algorithmic Approach to the Semantics of Programming Languages.
147-166
- J. W. de Bakker, Willem P. de Roever:
A Calculus for Recursive Program Schemes.
167-196
- Corrado Böhm:
Can Syntax Be Ignored during Translation?
197-207
- Volker Claus:
Assignment-Programs.
209-214
- Joost Engelfriet:
Translation of Simple Program Schemes.
215-223
- Peter Hitchcock, David Michael Ritchie Park:
Induction Rules and Termination Proofs.
225-251
- Denis J. Kfoury:
Comparing Algebraic Structures up to Algorithmic Equivalence.
253-263
- Jean Kott:
Remarques sur la structure des schémas de programmes.
265-271
- Zohar Manna, Jean Vuillemin:
Fixpoint Approach to the Theory of Computation.
273-291
- Maurice Nivat:
Langages algébriques sur le magma libre et sémantique des schémas de programme.
293-308
- Louis Nolin:
Systèmes algorithmiques, systèmes fonctionnels.
309-318
- Gilles Ruggiu:
Les types et les appels de procédures.
319-330
- Mitchell Wand:
A Concrete Approach to Abstract Recursion Definitions.
331-341
- Jean Berstel:
Sur la densité asymptotique de langages formels.
345-358
- Luc Boasson:
Un critère de rationnalité des langages algébriques.
359-365
- Stefano Crespi-Reghizzi:
Approximation of Phrase Markers by Regular Sets.
367-376
- J. P. Crestin:
Un langage non ambigu dont le carré est d'ambiguité non bornée.
377-390
- Peter van Emde Boas:
A Comparison of the Properties of Complexity Classes and Honesty Classes.
391-396
- Michel Fliess:
Automates stochastiques et séries rationnelles non commutatives.
397-411
- Michael A. Harrison, Ivan M. Havel:
On a Family of Deterministic Grammars (Extended Abstract).
413-441
- Pei Hsia, Raymond T. Yeh:
Finite Automata with Markers.
443-451
- Aravind K. Joshi, Leon S. Levy, Masako Takahashi:
A Tree Generating System.
453-465
- S.-Y. Kuroda:
On Structural Similarity of Phrase-Structure Languages.
467-474
- Masako Takahashi:
Primitive Tranformations of Regular Sets and Recognizable Sets.
475-480
- Gabriel Thierrin:
Convex Languages.
481-492
- Stephen F. Weiss, Gyula Magó, Donald F. Stanat:
Algebraic Parsing Techniques for Context-Free Languages.
493-498
- Brenda S. Baker:
Context-Sensitive Grammars Generating Context-Free Languages.
501-506
- Alberto Bertoni:
Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines.
507-516
- Ronald V. Book:
Complexity Classes of Formal Languages (Extended Abstract).
517-520
- Alex Dubinsky:
The Functions Computed by a Monadic Program Schema with One Location.
521-535
- Philippe Flajolet, Jean-Marc Steyaert:
Complexité des problèmes de décision relatifs aux algorithmes de tri.
537-548
- Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch:
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata.
549-561
- Rainer Kemp:
An Estimation of the Set of States of the Minimal LR(0)-Acceptor.
563-574
- Burkhard Monien:
Relationship between Pushdown Automata and Tape-Bounded Turing Machines.
575-583
- Claus-Peter Schnorr:
Does the Computational Speed-up Concern Programming?
585-591
- R. Turner:
An Infinite Hierarchy of Term Languages - An Approach to Mathematical Complexity.
593-608
- Bostjan Vilfan:
A Generalization of a Theorem of Specker and Some Applications.
609-622
Copyright © Mon Nov 2 20:41:02 2009
by Michael Ley (ley@uni-trier.de)
