| 1972 | A Calculus for Recursive Program Schemes. J. W. de Bakker, Willem P. de Roever |
| 1972 | A Comparison of the Properties of Complexity Classes and Honesty Classes. Peter van Emde Boas |
| 1972 | A Concrete Approach to Abstract Recursion Definitions. Mitchell Wand |
| 1972 | A Generalization of a Theorem of Specker and Some Applications. Bostjan Vilfan |
| 1972 | A Tree Generating System. Aravind K. Joshi, Leon S. Levy, Masako Takahashi |
| 1972 | A propos du relation rationelles fonctionnelles. Marcel Paul Schützenberger |
| 1972 | Algebraic Parsing Techniques for Context-Free Languages. Stephen F. Weiss, Gyula Magó, Donald F. Stanat |
| 1972 | An Algorithmic Approach to the Semantics of Programming Languages. Gianni Aguzzi, Renzo Pinzani, Renzo Sprugnoli |
| 1972 | An Estimation of the Set of States of the Minimal LR(0)-Acceptor. Rainer Kemp |
| 1972 | An Infinite Hierarchy of Term Languages - An Approach to Mathematical Complexity. R. Turner |
| 1972 | Approximation of Phrase Markers by Regular Sets. Stefano Crespi-Reghizzi |
| 1972 | Assignment-Programs. Volker Claus |
| 1972 | Automata, Languages and Programming, Colloquium, Paris, France, July 3-7, 1972 Maurice Nivat |
| 1972 | Automates et bascules. Gérard Viennot |
| 1972 | Automates stochastiques et séries rationnelles non commutatives. Michel Fliess |
| 1972 | Can Syntax Be Ignored during Translation? Corrado Böhm, Mariangiola Dezani-Ciancaglini |
| 1972 | Comparing Algebraic Structures up to Algorithmic Equivalence. Denis J. Kfoury |
| 1972 | Complexity Classes of Formal Languages (Extended Abstract). Ronald V. Book |
| 1972 | Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines. Alberto Bertoni |
| 1972 | Complexité des problèmes de décision relatifs aux algorithmes de tri. Philippe Flajolet, Jean-Marc Steyaert |
| 1972 | Context-Sensitive Grammars Generating Context-Free Languages. Brenda S. Baker |
| 1972 | Convex Languages. Gabriel Thierrin |
| 1972 | Does the Computational Speed-up Concern Programming? Claus-Peter Schnorr |
| 1972 | Equations in Free Monoids. André Lentin |
| 1972 | Finite Automata with Markers. Pei Hsia, Raymond T. Yeh |
| 1972 | Finite Delay Solutions for Sequential Conditions. Frederick A. Hosch, Lawrence H. Landweber |
| 1972 | Finite Power Property of Regular Languages. Matti Linna |
| 1972 | Fixpoint Approach to the Theory of Computation. Zohar Manna, Jean Vuillemin |
| 1972 | Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata. Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch |
| 1972 | Induction Rules and Termination Proofs. Peter Hitchcock, David Michael Ritchie Park |
| 1972 | Langages algébriques sur le magma libre et sémantique des schémas de programme. Maurice Nivat |
| 1972 | Les types et les appels de procédures. Gilles Ruggiu |
| 1972 | Linear Automata - Approximation Problem (Extended Abstract). Azaria Paz, Michael Rabinovich |
| 1972 | On Structural Similarity of Phrase-Structure Languages. Sige-Yuki Kuroda |
| 1972 | On a Family of Deterministic Grammars (Extended Abstract). Michael A. Harrison, Ivan M. Havel |
| 1972 | Primitive Tranformations of Regular Sets and Recognizable Sets. Masako Takahashi |
| 1972 | Quelques applications des automates à arbres infinis. Guy Vidal-Naquet |
| 1972 | Realization Theory of Linear Systems over a Commutative Ring. Rudolf E. Kálmán |
| 1972 | Relationship between Pushdown Automata and Tape-Bounded Turing Machines. Burkhard Monien |
| 1972 | Remarques sur la structure des schémas de programmes. Jean Kott |
| 1972 | Sur des langages vérifiant des équations avec opérateur. Robert Cori |
| 1972 | Sur la densité asymptotique de langages formels. Jean Berstel |
| 1972 | Syntactic Semigroups of Some Classes of Star-Free Languages. Yechezkel Zalcstein |
| 1972 | Systèmes algorithmiques, systèmes fonctionnels. Louis Nolin |
| 1972 | The Functions Computed by a Monadic Program Schema with One Location. Alex Dubinsky |
| 1972 | Transducteurs conservant l'imprimitivité du langage d'entrée. Christian Choffrut |
| 1972 | Translation of Simple Program Schemes. Joost Engelfriet |
| 1972 | Un critère de rationnalité des langages algébriques. Luc Boasson |
| 1972 | Un langage non ambigu dont le carré est d'ambiguité non bornée. J. P. Crestin |
| 1972 | 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. Philippe Butzbach |