Acta Informatica, Volume 2

Volume 2, 1973

Søren Lauesen: Job Scheduling Guaranteeing Reasonable Turn-Around Times. 1-11
T. Anderson, J. Eve, James J. Horning: Efficient LR(1) Parsers. 12-39
Arto Salomaa: On Sentential Forms of Context-Free Grammars. 40-49
Maurice Clint: Program Proving: Coroutines. 50-63
Volker Strassen: Berechnung und Programm. II. 64-79
H.-J. Stoß: Rangierkomplexität von Permutationen. 80-96
David Gries: Describing an Algorithm by Hopcroft. 97-109
Hans Langmaack: On Correct Procedure Parameter Transmission in Higher Programming Languages. 110-142
Hartmann J. Genrich, Kurt Lautenbach: Synchronisationsgraphen. 143-161
Karel Culík, Michael A. Arbib: Sequential and Jumping Machines and their Relation to Computers. 162-171
Hans-Dieter Ehrich: Minimale und m-minimale Variablenmengen für partielle Boole'sche Funktionen. 172-179
Luc Boasson, Maurice Nivat: Sur diverses familles de langages fermées par transductions rationelle. 180-188
Per Brinch Hansen: A Reply to Comments on "A Comparison of Two Synchronizing Concepts". 189-190
Jeffrey D. Ullman: Fast Algorithms for the Elimination of Common Subexpressions. 191-213
Grzegorz Rozenberg, Aristid Lindenmayer: Developmental Systems with Locally Catenative Formulas. 214-248
Walter J. Savitch: A Note on Multihead Automata and Context-Sensitive Languages. 249-252
Peter Kandzia: Zur Theorie der Partiell-linearen Realisierungen endlicher Automaten. 253-282
Volker Claus: Die mittlere Additionsdauer eines Paralleladdierwerks. 283-291
Jay Earley: Relational Level Data Structures for Programming Languages. 293-309
Hans Langmaack: On Procedures as Open Subroutines. I. 311-333
C. A. R. Hoare, Niklaus Wirth: An Axiomatic Definition of the Programming Language PASCAL. 335-355
Wolfgang Menzel: An Extension of the Theory of Learning Systems. 357-381
Luc Boasson, J. P. Crestin, Maurice Nivat: Familles de langages translatables et fermées par crochet. 383-393