Maurice Nivat
Proceedings of the Colloquium on Automata, Languages and Programming
ICALP, 1972.

@proceedings{ICALP-1972,
	address       = "Amsterdam, Noord-Holland, The Netherlands",
	editor        = "Maurice Nivat",
	isbn          = "0-7204-2074-1",
	title         = "{Proceedings of the Colloquium on Automata, Languages and Programming}",
	year          = 1972,
}

Contents (49 items)

15 ×#french
4 ×#approach
4 ×#automaton
4 ×#complexity
3 ×#approximate
3 ×#finite
3 ×#recursion
3 ×#set
2 ×#algebra
2 ×#algorithm

ICALP-1972-Butzbach #french

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 (PB), pp. 3–12.

ICALP-1972-Choffrut #french

Transducteurs conservant l’imprimitivité du langage d’entrée (CC), pp. 13–29.

ICALP-1972-Cori #french

Sur des langages vérifiant des équations avec opérateur (RC), pp. 31–43.

ICALP-1972-HoschL #finite

Finite Delay Solutions for Sequential Conditions (FAH, LHL), pp. 45–60.

ICALP-1972-Kalman #commutative #linear

Realization Theory of Linear Systems over a Commutative Ring (REK), pp. 61–65.

ICALP-1972-Lentin #equation #monad

Equations in Free Monoids (AL), pp. 67–85.

ICALP-1972-Linna #finite #regular expression

Finite Power Property of Regular Languages (ML), pp. 87–98.

ICALP-1972-PazR #approximate #automaton #linear #problem

Linear Automata — Approximation Problem (AP, MR), pp. 99–102.

ICALP-1972-Schutzenberger #french

A propos du relation rationelles fonctionnelles (MPS), pp. 103–114.

ICALP-1972-Vidal-Naquet #french

Quelques applications des automates à arbres infinis (GVN), pp. 115–122.

ICALP-1972-Viennot #french

Automates et bascules (GV), pp. 123–133.

ICALP-1972-Zalcstein

Syntactic Semigroups of Some Classes of Star-Free Languages (YZ), pp. 135–144.

ICALP-1972-AguzziPS #algorithm #approach #programming language #semantics

An Algorithmic Approach to the Semantics of Programming Languages (GA, RP, RS), pp. 147–166.

ICALP-1972-BakkerR #calculus #recursion

A Calculus for Recursive Program Schemes (JWdB, WPdR), pp. 167–196.

ICALP-1972-Bohm #question #syntax

Can Syntax Be Ignored during Translation? (CB, MDC), pp. 197–207.

ICALP-1972-Claus

Assignment-Programs (VC), pp. 209–214.

ICALP-1972-Engelfriet

Translation of Simple Program Schemes (JE), pp. 215–223.

ICALP-1972-HitchcockP #induction #proving #termination

Induction Rules and Termination Proofs (PH, DMRP), pp. 225–251.

ICALP-1972-Kfoury #algebra #algorithm #equivalence

Comparing Algebraic Structures up to Algorithmic Equivalence (DJK), pp. 253–263.

ICALP-1972-Kott #french

Remarques sur la structure des schémas de programmes (JK), pp. 265–271.

ICALP-1972-MannaV #approach #fixpoint #formal method

Fixpoint Approach to the Theory of Computation (ZM, JV), pp. 273–291.

ICALP-1972-Nivat #french

Langages algébriques sur le magma libre et sémantique des schémas de programme (MN), pp. 293–308.

ICALP-1972-Nolin #french

Systèmes algorithmiques, systèmes fonctionnels (LN), pp. 309–318.

ICALP-1972-Ruggiu #french

Les types et les appels de procédures (GR), pp. 319–330.

ICALP-1972-Wand #approach #recursion

A Concrete Approach to Abstract Recursion Definitions (MW), pp. 331–341.

ICALP-1972-Berstel #french

Sur la densité asymptotique de langages formels (JB), pp. 345–358.

ICALP-1972-Boasson #french

Un critère de rationnalité des langages algébriques (LB), pp. 359–365.

ICALP-1972-Reghizzi #approximate #set

Approximation of Phrase Markers by Regular Sets (SCR), pp. 367–376.

ICALP-1972-Crestin #french

Un langage non ambigu dont le carré est d’ambiguité non bornée (JPC), pp. 377–390.

ICALP-1972-Boas #comparison #complexity

A Comparison of the Properties of Complexity Classes and Honesty Classes (PvEB), pp. 391–396.

ICALP-1972-Fliess #commutative #french

Automates stochastiques et séries rationnelles non commutatives (MF), pp. 397–411.

ICALP-1972-HarrisonH #on the #product line

On a Family of Deterministic Grammars (MAH, IMH), pp. 413–441.

ICALP-1972-HsiaY #automaton #finite

Finite Automata with Markers (PH, RTY), pp. 443–451.

ICALP-1972-JoshiLT #generative

A Tree Generating System (AKJ, LSL, MT), pp. 453–465.

ICALP-1972-Kuroda #on the #similarity

On Structural Similarity of Phrase-Structure Languages (SYK), pp. 467–474.

ICALP-1972-Takahashi #set

Primitive Tranformations of Regular Sets and Recognizable Sets (MT), pp. 475–480.

ICALP-1972-Thierrin

Convex Languages (GT), pp. 481–492.

ICALP-1972-WeissMS #algebra #context-free grammar #parsing

Algebraic Parsing Techniques for Context-Free Languages (SFW, GM, DFS), pp. 493–498.

ICALP-1972-Baker #context-free grammar #context-sensitive grammar #generative

Context-Sensitive Grammars Generating Context-Free Languages (BSB), pp. 501–506.

ICALP-1972-Bertoni #approximate #complexity #probability #problem

Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines (AB), pp. 507–516.

ICALP-1972-Book #complexity #formal method

Complexity Classes of Formal Languages (RVB), pp. 517–520.

ICALP-1972-Dubinsky #monad

The Functions Computed by a Monadic Program Schema with One Location (AD), pp. 521–535.

ICALP-1972-FlajoletS #french

Complexité des problèmes de décision relatifs aux algorithmes de tri (PF, JMS), pp. 537–548.

ICALP-1972-HenkeIW #automaton #recursion

Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata (FWvH, KI, KW), pp. 549–561.

ICALP-1972-Kemp #estimation #lr #set

An Estimation of the Set of States of the Minimal LR(0)-Acceptor (RK), pp. 563–574.

ICALP-1972-Monien #automaton #bound #turing machine

Relationship between Pushdown Automata and Tape-Bounded Turing Machines (BM), pp. 575–583.

ICALP-1972-Schnorr #programming #question

Does the Computational Speed-up Concern Programming? (CPS), pp. 585–591.

ICALP-1972-Turner #approach #complexity #infinity

An Infinite Hierarchy of Term Languages — An Approach to Mathematical Complexity (RT), pp. 593–608.

ICALP-1972-Vilfan #theorem

A Generalization of a Theorem of Specker and Some Applications (BV), pp. 609–622.