2. ICALP 1974: Saarbrücken, Germany

Jacques Loeckx (Ed.): Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974, Proceedings. Lecture Notes in Computer Science 14 Springer 1974, ISBN 3-540-06841-4 BibTeX

@proceedings{DBLP:conf/icalp/1974,
  editor    = {Jacques Loeckx},
  title     = {Automata, Languages and Programming, 2nd Colloquium, University
               of Saarbr{\"u}cken, July 29 - August 2, 1974, Proceedings},
  booktitle = {ICALP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {14},
  year      = {1974},
  isbn      = {3-540-06841-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Monday Morning

Adriaan van Wijngaarden: The Generative Power of Two-Level Grammars. 9-16 BibTeX
Jan van Leeuwen: A Generalisation of Parikh's Theorem in Formal Language Theory. 17-26 BibTeX
E. Shamir, Catriel Beeri: Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages. 27-33 BibTeX

Monday Afternoon

Willem P. de Roever: Recursion and Parameter Mechanisms: An Axiomatic Approach. 34-65 BibTeX
Alberto Martelli, Ugo Montanari: Dynamic Programming Schemata. 66-80 BibTeX
Giorgio De Michelis, Carla Simone: Semantic Characterization of Flow Diagrams and Their Decomposability. 81-96 BibTeX
Peter Kandzia: On the Most Recent Property of Algol-Like Programs. 97-111 BibTeX
Jacques J. Arsac: Langages sans Etiquettes et Transformations de Programmes. 112-128 BibTeX

Tuesday Morning

Giorgio Ausiello: Relations between Semantics and Complexity of Recursive Programs. 129-140 BibTeX
John C. Reynolds: On the Relation between Direct and Continuation Semantics. 141-156 BibTeX
Giuliano Pacini, Carlo Montangero, Franco Turini: Graph Representation and Computation Rules for Typeless Recursive Languages. 157-169 BibTeX
Mariangiola Dezani-Ciancaglini, Maddalena Zacchi: Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms. 170-184 BibTeX
Corrado Böhm, Mariangiola Dezani-Ciancaglini: Combinatorial Problems, Combinator Equations and Normal Forms. 185-199 BibTeX
Bruno Courcelle, Gilles Kahn, Jean Vuillemin: Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples. 200-213 BibTeX

Tuesday Afternoon

David B. Lomet: Automatic Generation of Multiple Exit Parsing Subroutines. 214-231 BibTeX
Matthew M. Geller, Susan L. Graham, Michael A. Harrison: Production Prefix Parsing (Extended Abstract). 232-241 BibTeX
David Pager: On Eliminating Unit Productions from LR(k) Parsers. 242-254 BibTeX
Bernard Lang: Deterministic Techniques for Efficient Non-Deterministic Parsers. 255-269 BibTeX
Witold Lipski Jr., V. Wiktor Marek: File Organization, An Application of Graph Theory. 270-279 BibTeX

Wednesday Morning

Burkhard Monien: Characterizations of Time-Bounded Computations by Limited Primitive Recursion. 280-293 BibTeX
Claus-Peter Schnorr: On Maximal Merging of Information in Boolean Computations. 294-300 BibTeX
Juris Hartmanis, Theodore P. Baker: On Simple Goedel Numberings and Translations. 301-316 BibTeX
Kurt Mehlhorn: The "Almost All" Theory of Subrecursive Degrees is Decidable. 317-325 BibTeX
Klaus Weihrauch: The Compuational Complexity of Program Schemata. 326-334 BibTeX

Thursday Morning

Max Fontet: Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d'automorphismes d'un automate fini. 335-341 BibTeX
Yves Césari: Sur l'application du theoreme de Suschkewitsch a l'etude des codes rationnets complets. 342-350 BibTeX
Marcel Paul Schützenberger: Sur une propriete syntactique des relations rationnelles. 612-619 BibTeX
Ferenc Gécseg: Composition of Automata. 351-363 BibTeX
Armin B. Cremers, Seymour Ginsburg: Context-Free Grammar Forms. 364-382 BibTeX
Jean Berstel, Luc Boasson: Une suite decroissante de cônes rationnels. 383-397 BibTeX

Thursday Afternoon

Günter Hotz: Komplexitätsmaße für Ausdrücke. 398-412 BibTeX
Patrick C. Fischer, Robert L. Probert: Efficient Procedures for Using Matrix Algorithms. 413-427 BibTeX
Patrick C. Fischer: Further Schemes for Combining Matrix Algorithms. 428-436 BibTeX
Ronald V. Book: On the Structure of Complexity Classes. 437-445 BibTeX
Philippe Flajolet, Jean-Marc Steyaert: On Sets Having Only Hard Subsets. 446-457 BibTeX
Reinhold Weicker: Turing Machines with Associative Memory Access. 458-472 BibTeX

Friday Morning

Andrzej Ehrenfeucht, Grzegorz Rozenberg: Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems. 473-480 BibTeX
Miroslav Novotný: Operators Reducing Generalized OL-Systems. 481-494 BibTeX
Karel Culik II, T. S. E. Maibaum: Parallel Rewriting Systems on terms. 495-510 BibTeX
Meera Blattner: Transductions of Context-Free Languages into Sets of Sentential Forms. 511-522 BibTeX
Arto Salomaa: Parallelism in Rewriting Systems. 523-533 BibTeX
Rainer Kemp: Mehrdeutigkeiten Kontextfreier Grammatiken. 534-546 BibTeX

Friday Afternoon

Werner Dilger, Peter Raulefs: Monadic Program Schemes Under Restricted Classes of Free Interpretations. 547-561 BibTeX
Ashok K. Chandra: Generalized Program Schemas. 562-576 BibTeX
Eberhard Bertsch: A Decidability Result for Sequential Grammars. 577-583 BibTeX
Antoni Kreczmar: Effectivity Problems of Algorithmic Logic. 584-600 BibTeX
Patrick J. Hayes: Simple and Structural Redundancy in Non-Deterministic Computation. 601-611 BibTeX