Skip to main content
SpringerLink
Log in
Book cover

Automata, Languages and Programming

Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings

  • Conference proceedings
  • © 1980

Overview

Editors:
  1. Jaco Bakker
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jan Leeuwen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
Softcover Book USD 69.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

Licence this eBook for your library

Institutional subscriptions

Table of contents (53 papers)

  1. Front Matter

    Download chapter PDF

  2. How to get rid of pseudoterminals

    • W. Ainhirn
    Pages 1-11

  3. Test sets for homomorphism equivalence on context free languages

    • J. Albert, K. Culik II
    Pages 12-18

  4. Languages with homomorphic replacements

    • J. Albert, L. Wegner
    Pages 19-29

  5. Functions equivalent to integer multiplication

    • H. Alt
    Pages 30-37

  6. Languages with reducing reflexive types

    • Egidio Astesiano, Gerardo Costa
    Pages 38-50

  7. Semantics of unbounded nondeterminism

    • Ralph-Johan Back
    Pages 51-63

  8. A shifting algorithm for min-max tree partitioning

    • Ronald I. Becker, Yehoshua Perl, Stephen R. Schach
    Pages 64-75

  9. A characterisation of computable data types by means of a finite equational specification method

    • J. A. Bergstra, J. V. Tucker
    Pages 76-90

  10. A note on sweeping automata

    • Piotr Berman
    Pages 91-97

  11. Border rank of a p×q×2 tensor and the optimal approximation of a pair of bilinear forms

    • D. Bini
    Pages 98-108

  12. Derivations et reductions dans les grammaires algebrioues

    • L. Boasson
    Pages 109-118

  13. Semantic analysis of communicating sequential processes

    • Patrick Cousot, Radhia Cousot
    Pages 119-133

  14. Dos systems and languages

    • A. Ehrenfeucht, G. Rozenberg
    Pages 134-141

  15. Algebraic implementation of abstract data types: concept, syntax, semantics and correctness

    • H. Ehrig, H. -J. Kreowski, P. Padawitz
    Pages 142-156

  16. Parameterized data types in algebraic specification languages

    • Hartmut Ehrig, Hans-Jörg Kreowski, James Thatcher, Eric Wagner, Jesse Wright
    Pages 157-168

  17. Characterizing correctness properties of parallel programs using fixpoints

    • E. Allen Emerson, Edmund M. Clarke
    Pages 169-181

  18. Formal properties of one-visit and multi-pass attribute grammars (extended abstract)

    • Joost Engelfriet, Gilberto Filè
    Pages 182-194

  19. Cryptocomplexity and NP-completeness

    • S. Even, Y. Yacobi
    Pages 195-207

  20. On the analysis of tree-matching algorithms

    • Philippe Flajolet, Jean-Marc Steyaert
    Pages 208-219
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation