default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th ICALP 1978: Udine, Italy
- Giorgio Ausiello, Corrado Böhm:
Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings. Lecture Notes in Computer Science 62, Springer 1978, ISBN 3-540-08860-1 - Jürgen Albert, Hermann A. Maurer, Grzegorz Rozenberg:
Simple EOL Forms under Uniform Interpretation Generating CF Languages. 1-14 - Doris Altenkamp, Kurt Mehlhorn:
Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract). 15-25 - André Arnold, Max Dauchet:
Sul l'inversion des morphisms d'arbres. 26-35 - Gerhard Barth:
Grammars with Dynamic Control Sets. 36-51 - Joffroy Beauquier:
Ambiguite Forte. 52-62 - Piotr Berman:
Relationship Between Density and Deterministic Complexity of NP-Complete Languages. 63-71 - Gérard Berry:
Stable Models of Typed lambda-Calculi. 72-89 - Joachim Biskup:
Path Measures of Turing Machine Computations (Preliminary Report). 90-104 - Jean-Marie Boë:
Une Famille Remarquable de Codes Indecomposables. 105-112 - Ronald V. Book, Sheila A. Greibach, Celia Wrathall:
Comparisons and Reset Machines (Preliminary Report). 113-124 - Beate Commentz-Walter:
Size-Depth Tradeoff in Boolean Formulas. 125-141 - 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 - Armin B. Cremers, Thomas N. Hibbard:
Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract). 165-176 - Werner Damm, Elfriede Fehr:
On the Power of Self-Application and Higher Type-Recursion. 177-191 - David P. Dobkin, J. Ian Munro:
Time and Space Bounds for Selection Problems. 192-204 - Hartmut Ehrig, Hans-Jörg Kreowski, Peter Padawitz:
Stepwise Specification and Implementation of Abstract Data Types. 205-226 - Steven Fortune, John E. Hopcroft, Erik Meineche Schmidt:
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes. 227-240 - Zvi Galil:
On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm. 241-250 - Jean H. Gallier
:
Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures. 251-267 - David Harel:
Arithmetical Completeness in Logics of Programs. 268-288 - Alon Itai, Michael Rodeh:
Covering a Graph by Circuits. 289-299 - Andrzej Lingas:
A PSPACE Complete Problem Related to a Pebble Game. 300-321 - Maurice Mignotte:
Some Effective Results About Linear Recursive Sequences. 322-329 - Anton Nijholt:
On the Parsing and Covering of Simple Chain Grammars. 330-344 - Jean-Eric Pin:
Sur un Cas Particulier de la Conjecture de Cerny. 345-352 - John K. Price, Detlef Wotschke:
States Can Sometimes Do More Than Stack Symbols in PDA's. 353-362 - Antonio Restivo:
Some Decision Results for Recognizable Sets in Arbitrary Monoids. 363-371 - Christophe Reutenauer:
Sur les Series Rationnelles en Variables Non Commutatives. 372-381 - Mikko Saarinen:
On Constructing Efficient Evaluators for Attribute Grammars. 382-397 - Patrick Sale:
Une Extension de la Theorie des Types en lambda-Calcul. 398-410 - Walter J. Savitch:
Parallel and Nondeterministic Time Complexity Classes (Preliminary Report). 411-424 - Claus-Peter Schnorr:
Multiterminal Network Flow and Connectivity in Unsymmetrical Networks. 425-439 - Edward Sciore, A. Tang:
Admissible Coherent CPO's. 440-456 - Tommaso Toffoli:
Integration of the Phase-Difference Relations in Asynchronous Sequential Networks. 457-463 - Rüdiger Valk:
Self-Modifying Nets, a Natural Extension of Petri Nets. 464-476 - Marisa Venturini Zilli:
Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form. 477-493 - Rolf Wiehagen:
Characterization Problems in the Theory of Inductive Inference. 494-508
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-06 22:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
