Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

15th International Colloquium, Tampere, Finland, July 11-15, 1988. Proceedings

  • Conference proceedings
  • © 1988

Overview

Editors:
  1. Timo Lepistö
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Arto Salomaa
    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 317)

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 109.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 (51 papers)

  1. Front Matter

    Download chapter PDF

  2. Communication complexity of PRAMs

    • Alok Aggarwal, Ashok K. Chandra
    Pages 1-17

  3. Average case complexity analysis of the RETE multi-pattern match algorithm

    • Luc Albert, François Fages
    Pages 18-37

  4. Problems easy for tree-decomposable graphs extended abstract

    • Stefan Arnborg, Jens Lagergren, Detlef Seese
    Pages 38-51

  5. Serializability in distributed systems with handshaking

    • R. J. R. Back, R. Kurki-Suonio
    Pages 52-66

  6. Algorithms for planar geometric models

    • Chanderjit Bajaj, Myung-Soo Kim
    Pages 67-81

  7. Nonuniform learnability

    • Gyora M. Benedek, Alon Itai
    Pages 82-92

  8. Zeta functions of recognizable languages

    • Jean Berstel, Christophe Reutenauer
    Pages 93-104

  9. Dynamic programming on graphs with bounded treewidth

    • Hans L. Bodlaender
    Pages 105-118

  10. Efficient simulations of simple models of parallel computation by time-bounded ATM's and space-bounded TM's

    • Jik H. Chang, Oscar H. Ibarra, Michael A. Palis
    Pages 119-132

  11. Optimal slope selection

    • Richard Cole, Jeffrey Salowe, W. L. Steiger, Endre Szemerédi
    Pages 133-146

  12. Approximation of a trace, asynchronous automata and the ordering of events in a distributed system

    • R. Cori, Y. Métivier
    Pages 147-161

  13. New techniques for proving the decidability of equivalence problems

    • Karel Culik II
    Pages 162-175

  14. Transitive orientations, möbius functions, and complete semi-thue systems for free partially commutative monoids

    • Volker Diekert
    Pages 176-187

  15. The complexity of matrix transposition on one-tape off-line turing machines with output tape

    • Martin Dietzfelbinger, Wolfgang Maass
    Pages 188-200

  16. Geometric structures in computational geometry

    • Herbert Edelsbrunner
    Pages 201-213

  17. Arrangements of curves in the plane — topology, combinatorics, and algorithms

    • Herbert Edelsbrunner, Leonidas Guibas, Janos Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Pages 214-229

  18. Reset sequences for finite automata with application to design of parts orienters

    • David Eppstein
    Pages 230-238

  19. Random allocations and probabilistic languages

    • Philippe Flajolet, Danièle Gardy, Loÿs Thimonier
    Pages 239-253

  20. Systolic architectures, systems and computations

    • Jozef Gruska
    Pages 254-270
Back to top

Keywords

About this book

This volume contains the proceedings of ICALP 88, held at Tampere University of Technology, Finland, July 11-15, 1988. ICALP 88 is the 15th International Colloquium on Automata, Languages and Programming in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). It is a broadly based conference covering all aspects of theoretical computer science including topics 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, cryptography, and theory of robotics.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation