5. ICALP 1978: Udine, Italy

@proceedings{DBLP:conf/icalp/1978,
  editor    = {Giorgio Ausiello and
               Corrado B{\"o}hm},
  title     = {Automata, Languages and Programming, Fifth Colloquium, Udine,
               Italy, July 17-21, 1978, Proceedings},
  booktitle = {ICALP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {62},
  year      = {1978},
  isbn      = {3-540-08860-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Jürgen Albert, Hermann A. Maurer, Grzegorz Rozenberg: Simple EOL Forms under Uniform Interpretation Generating CF Languages. 1-14 BibTeX
• Doris Altenkamp, Kurt Mehlhorn: Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract). 15-25 BibTeX
• André Arnold, Max Dauchet: Sul l'inversion des morphisms d'arbres. 26-35 BibTeX
• Gerhard Barth: Grammars with Dynamic Control Sets. 36-51 BibTeX
• Joffroy Beauquier: Ambiguite Forte. 52-62 BibTeX
• Piotr Berman: Relationship Between Density and Deterministic Complexity of NP-Complete Languages. 63-71 BibTeX
• Gérard Berry: Stable Models of Typed lambda-Calculi. 72-89 BibTeX
• Joachim Biskup: Path Measures of Turing Machine Computations (Preliminary Report). 90-104 BibTeX
• Jean-Marie Boë: Une Famille Remarquable de Codes Indecomposables. 105-112 BibTeX
• Ronald V. Book, Sheila A. Greibach, Celia Wrathall: Comparisons and Reset Machines (Preliminary Report). 113-124 BibTeX
• Beate Commentz-Walter: Size-Depth Tradeoff in Boolean Formulas. 125-141 BibTeX
• Mario Coppo, Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca: (Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus. 142-164 BibTeX
• Armin B. Cremers, Thomas N. Hibbard: Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract). 165-176 BibTeX
• Werner Damm, Elfriede Fehr: On the Power of Self-Application and Higher Type-Recursion. 177-191 BibTeX
• David P. Dobkin, J. Ian Munro: Time and Space Bounds for Selection Problems. 192-204 BibTeX
• Hartmut Ehrig, Hans-Jörg Kreowski, Peter Padawitz: Stepwise Specification and Implementation of Abstract Data Types. 205-226 BibTeX
• Steven Fortune, John E. Hopcroft, Erik Meineche Schmidt: The Complexity of Equivalence and Containment for Free Single Variable Program Schemes. 227-240 BibTeX
• Zvi Galil: On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm. 241-250 BibTeX
• Jean H. Gallier: Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures. 251-267 BibTeX
• David Harel: Arithmetical Completeness in Logics of Programs. 268-288 BibTeX
• Alon Itai, Michael Rodeh: Covering a Graph by Circuits. 289-299 BibTeX
• Andrzej Lingas: A PSPACE Complete Problem Related to a Pebble Game. 300-321 BibTeX
• Maurice Mignotte: Some Effective Results About Linear Recursive Sequences. 322-329 BibTeX
• Anton Nijholt: On the Parsing and Covering of Simple Chain Grammars. 330-344 BibTeX
• Jean-Eric Pin: Sur un Cas Particulier de la Conjecture de Cerny. 345-352 BibTeX
• John K. Price, Detlef Wotschke: States Can Sometimes Do More Than Stack Symbols in PDA's. 353-362 BibTeX
• Antonio Restivo: Some Decision Results for Recognizable Sets in Arbitrary Monoids. 363-371 BibTeX
• Christophe Reutenauer: Sur les Series Rationnelles en Variables Non Commutatives. 372-381 BibTeX
• Mikko Saarinen: On Constructing Efficient Evaluators for Attribute Grammars. 382-397 BibTeX
• Patrick Sale: Une Extension de la Theorie des Types en lambda-Calcul. 398-410 BibTeX
• Walter J. Savitch: Parallel and Nondeterministic Time Complexity Classes (Preliminary Report). 411-424 BibTeX
• Claus-Peter Schnorr: Multiterminal Network Flow and Connectivity in Unsymmetrical Networks. 425-439 BibTeX
• Edward Sciore, A. Tang: Admissible Coherent CPO's. 440-456 BibTeX
• Tommaso Toffoli: Integration of the Phase-Difference Relations in Asynchronous Sequential Networks. 457-463 BibTeX
• Rüdiger Valk: Self-Modifying Nets, a Natural Extension of Petri Nets. 464-476 BibTeX
• Marisa Venturini Zilli: Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form. 477-493 BibTeX
• Rolf Wiehagen: Characterization Problems in the Theory of Inductive Inference. 494-508 BibTeX