Advertisement

Table of contents

  1. Front Matter
    PDF
  2. Simple EOL forms under uniform interpretation generating CF languages
    Jürgen Albert, Hermann Maurer, Grzegorz Rozenberg
    Pages 1-14
  3. Codes : Unequal probabilities, unequal letter costs
    Doris Altenkamp, Kurt Mehlhorn
    Pages 15-25
  4. Sur l'inversion des morphismes d'arbres
    A. Arnold, M. Dauchet
    Pages 26-35
  5. Grammars with dynamic control sets
    Gerhard Barth
    Pages 36-51
  6. Ambiguite forte
    Joffroy Beauquier
    Pages 52-62
  7. Relationship between density and deterministic complexity of MP-complete languages
    Piotr Berman
    Pages 63-71
  8. Stable models of typed λ-calculi
    Gérard Berry
    Pages 72-89
  9. Path measures of turing machine computations
    Joachim Biskup
    Pages 90-104
  10. Une famille remarquable de codes indecomposables
    J. M. Boe
    Pages 105-112
  11. Comparisons and reset machines
    Ronald V. Book, Sheila A. Greibach, Celia Wrathall
    Pages 113-124
  12. Size — Depth tradeoff in boolean formulas
    Beate Commentz-Walter
    Pages 125-141
  13. (Semi)-separability of finite sets of terms in Scott's D∞-models of the λ-calculus
    M. Coppo, M. Dezani-Ciancaglini, S. Ronchi della Rocca
    Pages 142-164
  14. Mutual exclusion of N processors using an O(N)-valued message variable
    Armin B. Cremers, Thomas N. Hibbard
    Pages 165-176
  15. On the power of self-application and higher type recursion
    W. Damm, E. Fehr
    Pages 177-191
  16. Time and space bounds for selection problems
    David Dobkin, J. Ian Munro
    Pages 192-204
  17. Stepwise specification and implementation of abstract data types
    Hartmut Ehrig, Hans-Jörg Kreowski, Peter Padawitz
    Pages 205-226
  18. The complexity of equivalence and containment for free single variable program schemes
    Steven Fortune, John Hopcroft, Erik Meineche Schmidt
    Pages 227-240
  19. On improving the worst case running time of the Boyer-Moore string matching algorithm
    Zvi Galil
    Pages 241-250
  20. Semantics and correctness of nondeterministic flowchart programs with recursive procedures
    Jean H. Gallier
    Pages 251-267
  21. Arithmetical completeness in logics of programs
    David Harel
    Pages 268-288
  22. Covering a graph by circuits
    Alon Itai, Michael Rodeh
    Pages 289-299
  23. A pspace complete problem related to a pebble game
    Andrzej Lingas
    Pages 300-321
  24. Some effective results about linear recursive sequences
    Maurice Mignotte
    Pages 322-329
  25. On the parsing and covering of simple chain grammars
    Anton Nijholt
    Pages 330-344
  26. Sur un cas particulier de la conjecture de Cerny
    J. E. Pin
    Pages 345-352
  27. States can sometimes do more than stack symbols in PDA's
    John K. Price, Detlef Wotschke
    Pages 353-362
  28. Some decision results for recognizable sets in arbitrary monoids
    Antonio Restivo
    Pages 363-371
  29. Sur les series rationnelles en variables non commutatives
    Christophe Reutenauer
    Pages 372-381
  30. On constructing efficient evaluators for attribute grammars
    Mikko Saarinen
    Pages 382-397
  31. Une extension de la theorie des types en λ-calcul
    Patrick Salle
    Pages 398-410
  32. Parallel and nondeterministic time complexity classes
    Walter J. Savitch
    Pages 411-424
  33. Multiterminal network flow and connectivity in unsymmetrical networks
    C. P. Schnorr
    Pages 425-439
  34. Admissible coherent c.p.o.'s
    E. Sciore, A. Tang
    Pages 440-456
  35. Integration of the phase-difference relations in asynchronous sequential networks
    Tommaso Toffoli
    Pages 457-463
  36. Self-modifying nets, a natural extension of Petri nets
    Rüdiger Valk
    Pages 464-476
  37. Head recurrent terms in combinatory logic : A generalization of the notion of head normal form
    Marisa Venturini Zilli
    Pages 477-493
  38. Characterization problems in the theory of inductive inference
    Rolf Wiehagen
    Pages 494-508

About these proceedings

Keywords

Datenverarbeitung Formale Sprache Languages algorithms automata calculus complexity programming

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-08860-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 1978
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-08860-8
  • Online ISBN 978-3-540-35807-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site