[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Automata, Languages and Programming

17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. Michael S. Paterson
    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 443)

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 GBP 89.99
Price includes VAT (United Kingdom)
  • 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

About this book

This volume contains the proceedings of ICALP 90, the International Colloquium on Automata, Languages and Programming sponsored by the European Association for Theoretical Computer Science (EATCS). This annual conference series covers all important areas of theoretical computer science, such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics. This volume contains five invited papers and 52 papers selected from 250 submitted.

Keywords

Table of contents (57 papers)

  1. Front Matter

    Download chapter PDF

  2. LEDA: A library of efficient data types and algorithms

    • Stefan Näher, Kurt Mehlhorn
    Pages 1-5

  3. A new universal class of hash functions and dynamic hashing in real time

    • Martin Dietzfelbinger, Friedhelm Meyer auf der Heide
    Pages 6-19

  4. A complete and decidable proof system for call-by-value equalities

    • Jon G. Riecke
    Pages 20-31

  5. Static correctness of hierarchical procedures

    • Michael I. Schwartzbach
    Pages 32-45

  6. Generic terms having no polymorphic types

    • Sophie Malecki
    Pages 46-59

  7. A complete system of B-rational identities

    • Daniel KROB
    Pages 60-73

  8. On non-counting regular classes

    • Aldo de Luca, Stefano Varricchio
    Pages 74-87

  9. Two-way automata with multiplicity

    • M. Anselmo
    Pages 88-102

  10. ω-Continuous semirings, algebraic systems and pushdown automata

    • Werner Kuich
    Pages 103-110

  11. Nondeterministic computations in sublogarithmic space and space constructibility

    • Viliam Geffert
    Pages 111-124

  12. Normalizing and accelerating RAM computations and the problem of reasonable space measures

    • Juraj Wiedermann
    Pages 125-138

  13. A formal study of learning via queries

    • Osamu Watanabe
    Pages 139-152

  14. Language learning by a “team”

    • Sanjay Jain, Arun Sharma
    Pages 153-166

  15. Functions as processes

    • Robin Milner
    Pages 167-180

  16. A domain-theoretic model for a higher-order process calculus

    • Radha Jagadeesan, Prakash Panangaden
    Pages 181-194

  17. Concurrency, automata and domains

    • Manfred Droste
    Pages 195-208

  18. A theory of communicating processes with value-passing

    • M. Hennessy, A. Ingólfsdóttir
    Pages 209-219

  19. Analytic variations on the common subexpression problem

    • Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaert
    Pages 220-234

  20. Can a maximum flow be computed in o(nm) time?

    • Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn
    Pages 235-248
Back to top

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation