Skip to main content
SpringerLink
Log in
Book cover

Automata, Languages and Programming

14th International Colloquium, Karlsruhe, Federal Republic of Germany, July 13-17, 1987. Proceedings

  • Conference proceedings
  • © 1987

Overview

Editors:
  1. Thomas Ottmann
    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 267)

Included in the following conference series:

Conference proceedings info: ICALP 1987.

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 (49 papers)

  1. Front Matter

    Download chapter PDF

  2. Probability and plurality for aggregations of learning machines

    • Leonard Pitt, Carl H. Smith
    Pages 1-10

  3. Logic programming with ions

    • M. A. Nait Abdallah
    Pages 11-20

  4. Inverse image analysis

    • Peter Dybjer
    Pages 21-30

  5. A unification algorithm for confluent theories

    • Steffen Hölldobler
    Pages 31-41

  6. On the Knuth-Bendix completion for concurrent processes

    • Volker Diekert
    Pages 42-53

  7. On word problems in equational theories

    • Jieh Hsiang, Michael Rusinowitch
    Pages 54-71

  8. Semantics for nondeterministic asynchronous broadcast networks

    • R. K. Shyamasundar, K. T. Narayana, T. Pitassi
    Pages 72-83

  9. Another look at abstraction in process algebra

    • J. C. M. Baeten, R. J. van Glabbeek
    Pages 84-94

  10. A timed failures model for extended communicating processes

    • Rob Gerth, Andy Boucher
    Pages 95-114

  11. Readiness semantics for regular processes with silent actions

    • Susanne Graf, Joseph Sifakis
    Pages 115-125

  12. Verifying a protocol using relativized bisimulation

    • Kim G. Larsen, Robin Milner
    Pages 126-135

  13. On recent trends in formal language theory

    • Juhani Karhumäki
    Pages 136-162

  14. Non-uniform automata over groups

    • David A. Barrington, Denis Thérien
    Pages 163-173

  15. Minimal automaton of a rational cover

    • D. Beauquier
    Pages 174-189

  16. A star-height problem in free monoids with partial commutations

    • Choffrut C., C. Duboc
    Pages 190-201

  17. Single-valued finite transduction

    • J. Howard Johnson
    Pages 202-211

  18. The kleene and the Parikh Theorem in complete semirings

    • Werner Kuich
    Pages 212-225

  19. An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs

    • Y. Metivier
    Pages 226-236

  20. On the languages accepted by finite reversible automata

    • J. E. Pin
    Pages 237-249
Back to top

Other volumes

  1. Automata, Languages and Programming

Keywords

About this book

This volume contains the proceedings of the 14th International Colloquium on Automata Languages and Programming, organized by the European Association for Theoretical Computer Science (EATCS) and held in Karlsruhe, July 13-17, 1987. The papers report on original research in theoretical computer science and cover topics such as algorithms and data structures, automata and formal languages, computability and complexity theory, semantics of programming languages, program specification, transformation and verification, theory of data bases, 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. The authors are young scientists and leading experts in these areas.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation