ICALP A*

48 papers

YearTitle / Authors
1974A Decidability Result for Sequential Grammars.
Eberhard Bertsch
1974A Generalisation of Parikh's Theorem in Formal Language Theory.
Jan van Leeuwen
1974Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples.
Bruno Courcelle, Gilles Kahn, Jean Vuillemin
1974Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms.
Mariangiola Dezani-Ciancaglini, Maddalena Zacchi
1974Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29 - August 2, 1974, Proceedings
Jacques Loeckx
1974Automatic Generation of Multiple Exit Parsing Subroutines.
David B. Lomet
1974Characterizations of Time-Bounded Computations by Limited Primitive Recursion.
Burkhard Monien
1974Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages.
Eli Shamir, Catriel Beeri
1974Combinatorial Problems, Combinator Equations and Normal Forms.
Corrado Böhm, Mariangiola Dezani-Ciancaglini
1974Composition of Automata.
Ferenc Gécseg
1974Context-Free Grammar Forms.
Armin B. Cremers, Seymour Ginsburg
1974Deterministic Techniques for Efficient Non-Deterministic Parsers.
Bernard Lang
1974Dynamic Programming Schemata.
Alberto Martelli, Ugo Montanari
1974Effectivity Problems of Algorithmic Logic.
Antoni Kreczmar
1974Efficient Procedures for Using Matrix Algorithms.
Patrick C. Fischer, Robert L. Probert
1974File Organization, An Application of Graph Theory.
Witold Lipski Jr., V. Wiktor Marek
1974Further Schemes for Combining Matrix Algorithms.
Patrick C. Fischer
1974Generalized Program Schemas.
Ashok K. Chandra
1974Graph Representation and Computation Rules for Typeless Recursive Languages.
Giuliano Pacini, Carlo Montangero, Franco Turini
1974Komplexitätsmaße für Ausdrücke.
Günter Hotz
1974Langages sans Etiquettes et Transformations de Programmes.
Jacques J. Arsac
1974Mehrdeutigkeiten Kontextfreier Grammatiken.
Rainer Kemp
1974Monadic Program Schemes Under Restricted Classes of Free Interpretations.
Werner Dilger, Peter Raulefs
1974On Eliminating Unit Productions from LR(k) Parsers.
David Pager
1974On Maximal Merging of Information in Boolean Computations.
Claus-Peter Schnorr
1974On Sets Having Only Hard Subsets.
Philippe Flajolet, Jean-Marc Steyaert
1974On Simple Goedel Numberings and Translations.
Juris Hartmanis, Theodore P. Baker
1974On the Most Recent Property of Algol-Like Programs.
Peter Kandzia
1974On the Relation between Direct and Continuation Semantics.
John C. Reynolds
1974On the Structure of Complexity Classes.
Ronald V. Book
1974Operators Reducing Generalized OL-Systems.
Miroslav Novotný
1974Parallel Rewriting Systems on terms.
Karel Culík II, T. S. E. Maibaum
1974Parallelism in Rewriting Systems.
Arto Salomaa
1974Production Prefix Parsing (Extended Abstract).
Matthew M. Geller, Susan L. Graham, Michael A. Harrison
1974Recursion and Parameter Mechanisms: An Axiomatic Approach.
Willem P. de Roever
1974Relations between Semantics and Complexity of Recursive Programs.
Giorgio Ausiello
1974Semantic Characterization of Flow Diagrams and Their Decomposability.
Giorgio De Michelis, Carla Simone
1974Simple and Structural Redundancy in Non-Deterministic Computation.
Patrick J. Hayes
1974Sur l'application du theoreme de Suschkewitsch a l'etude des codes rationnets complets.
Yves Césari
1974Sur une propriete syntactique des relations rationnelles.
Marcel Paul Schützenberger
1974The "Almost All" Theory of Subrecursive Degrees is Decidable.
Kurt Mehlhorn
1974The Compuational Complexity of Program Schemata.
Klaus Weihrauch
1974The Generative Power of Two-Level Grammars.
Adriaan van Wijngaarden
1974Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems.
Andrzej Ehrenfeucht, Grzegorz Rozenberg
1974Transductions of Context-Free Languages into Sets of Sentential Forms.
Meera Blattner
1974Turing Machines with Associative Memory Access.
Reinhold Weicker
1974Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d'automorphismes d'un automate fini.
Max Fontet
1974Une suite decroissante de cônes rationnels.
Jean Berstel, Luc Boasson