4. ICALP 1977: Turku, Finland

Arto Salomaa, Magnus Steinby (Eds.): Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings. Lecture Notes in Computer Science 52 Springer 1977, ISBN 3-540-08342-1 BibTeX

@proceedings{DBLP:conf/icalp/1977,
  editor    = {Arto Salomaa and
               Magnus Steinby},
  title     = {Automata, Languages and Programming, Fourth Colloquium, University
               of Turku, Finland, July 18-22, 1977, Proceedings},
  booktitle = {ICALP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {52},
  year      = {1977},
  isbn      = {3-540-08342-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Alfred V. Aho, Ravi Sethi: How Hard is Compiler Code Generation? 1-15 BibTeX
Donald A. Alton: "Natural" Complexity Measures and Time versus Memory: Some Definitional Proposals. 16-29 BibTeX
Krzysztof R. Apt, J. W. de Bakker: Semantics and Proof Theory of Pascal Procedures. 30-44 BibTeX
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi: On the Structure of Combinatorial Problems and Structure Preserving Reductions. 45-60 BibTeX
Roland Carl Backhouse, R. K. Lutz: Factor Graphs, Failure Functions and BI-Trees. 61-75 BibTeX
David B. Benson, Ralph D. Jeffords: Parallel Decomposition of LR(k) Parsers (Extended Abstract). 76-86 BibTeX
Alberto Bertoni, Giancarlo Mauri, Mauro Torelli: Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata. 87-94 BibTeX
Corrado Böhm, Mario Coppo, Mariangiola Dezani-Ciancaglini: Termination Tests inside lambda-Calculus. 95-110 BibTeX
Ronald V. Book, Chee-Keng Yap: On the Computational Power of Reversal-Bounded Machines. 111-119 BibTeX
Franz-Josef Brandenburg: The Contextsensitivity Bounds of Contextsensitive Grammars and Languages. 120-134 BibTeX
Michal Chytil, Vojtech Jákl: Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings. 135-147 BibTeX
Karel Culik II, Ivan Fris: The Sequence Equivalence Problem for D0L Systems is Decidable. 148-163 BibTeX
Werner Damm: Languages Defined by Higher Type Program Schemes. 164-179 BibTeX
Ernst-Wolfgang Dieterich: Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse Structures. 180-192 BibTeX
Alexander Ja. Dikovsky, Larisa S. Modina: On Three Types of Unambiguity of Context-Free Languages. 193-205 BibTeX
Hartmut Ehrig, Barry K. Rosen: The Mathematics of Record Handling. 206-220 BibTeX
Joost Engelfriet: Macro Grammars, Lindenmayer Systems and Other Copying Devices. 221-229 BibTeX
Wilhelm J. Erni: On the Time and Tape Complexity of Hyper(1)-AFL's. 230-243 BibTeX
Matthias Höpner, Manfred Opp: Renaming and Erasing in Szilard Languages. 244-257 BibTeX
Alon Itai, Michael Rodeh: Some Matching Problems. 258-268 BibTeX
Gérard Jacob: Complexite des Demi-Groupes de Matrices. 269-281 BibTeX
Theo M. V. Janssen, Peter van Emde Boas: On the Proper Treatment or Referencing, Dereferencing and Assignment. 282-300 BibTeX
Neil D. Jones, Sven Skyum: Complexity of Some Problems Concerning L Systems. 301-308 BibTeX
Hans-Peter Kriegel, Thomas Ottmann: Left-Fitting Translations. 309-322 BibTeX
Kurt Mehlhorn: Dynamic Binary Search. 323-336 BibTeX
Burkhard Monien: About the Derivation Languages of Grammars and Machines. 337-351 BibTeX
Anton Nijholt: Simple Chain Grammars. 352-364 BibTeX
Wolfgang J. Paul, Robert Endre Tarjan: Time-Space Trade-Offs in a Pebble Game. 365-369 BibTeX
Azaria Paz, Shlomo Moran: Non-Deterministic Polynomial Optimization Problems and Their Approximation. 370-379 BibTeX
Amir Pnueli, Giora Slutzki: Simple Programs and Their Decision Problems. 380-390 BibTeX
Vaclav Rajlich: Theory of Data Structures by Relational and Graph Grammars. 391-411 BibTeX
Willem P. de Roever: On Backtracking and Greatest Fixpoints. 412-429 BibTeX
Grzegorz Rozenberg, Dirk Vermeir: L Systems of Finite Index (Extended Abstract). 430-439 BibTeX
Jorma Sajaniemi: The Safety of a Coroutine System. 440-452 BibTeX
Walter J. Savitch, Paul M. B. Vitányi: Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps. 453-464 BibTeX
Adi Shamir, William W. Wadge: Data Types as Objects. 465-479 BibTeX
Janos Simon: On the Difference Between One and Many (Preliminary Version). 480-491 BibTeX
Seppo Sippu, Eljas Soisalon-Soininen: On Defining Error Recovery in Context-Free Parsing. 492-503 BibTeX
Ileana Streinu: LL(k) Languages are Closed Under Union with Finite Languages. 504-508 BibTeX
Ivan Hal Sudborough: The Time and Tape Complexity of Developmental Languages. 509-523 BibTeX
Masako Takahashi: Rational relations of Binary Trees. 524-538 BibTeX
Hermann K.-G. Walter: Structural Equivalence of Context-Free Grammar Forms is Decidable. 539-553 BibTeX
Bruno Courcelle: On the Definition of Classes of Interpretations. 554-569 BibTeX