Skip to main content
  • Conference proceedings
  • © 1978

Automata, Languages and Programming

Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 62)

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (37 papers)

  1. Front Matter

  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. Stable models of typed λ-calculi

    • Gérard Berry
    Pages 72-89
  8. Path measures of turing machine computations

    • Joachim Biskup
    Pages 90-104
  9. Comparisons and reset machines

    • Ronald V. Book, Sheila A. Greibach, Celia Wrathall
    Pages 113-124
  10. Size — Depth tradeoff in boolean formulas

    • Beate Commentz-Walter
    Pages 125-141
  11. (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
  12. Mutual exclusion of N processors using an O(N)-valued message variable

    • Armin B. Cremers, Thomas N. Hibbard
    Pages 165-176
  13. Time and space bounds for selection problems

    • David Dobkin, J. Ian Munro
    Pages 192-204
  14. Stepwise specification and implementation of abstract data types

    • Hartmut Ehrig, Hans-Jörg Kreowski, Peter Padawitz
    Pages 205-226
  15. The complexity of equivalence and containment for free single variable program schemes

    • Steven Fortune, John Hopcroft, Erik Meineche Schmidt
    Pages 227-240

Bibliographic Information

  • Book Title: Automata, Languages and Programming

  • Book Subtitle: Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings

  • Editors: Giorgio Ausiello, Corrado Böhm

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-08860-1

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1978

  • Softcover ISBN: 978-3-540-08860-8Published: 01 July 1978

  • eBook ISBN: 978-3-540-35807-7Published: 13 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: X, 510

  • Topics: Mathematical Logic and Foundations, Computer Science, general, Theory of Computation

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access