Skip to main content
SpringerLink
Log in
Book cover

Automata, Languages and Programming

10th Colloquium Barcelona, Spain, July 18–22, 1983

  • Conference proceedings
  • © 1983

Overview

Editors:
  1. Josep Diaz
    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 154)

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 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

Licence this eBook for your library

Institutional subscriptions

Table of contents (60 papers)

  1. Front Matter

    Download chapter PDF

  2. On semantic foundations for applicative multiprogramming

    • Samson Abramsky
    Pages 1-14

  3. An axiomatization of the intermittent assertion method using temporal logic

    • Krzysztof R. Apt, Carole Delporte
    Pages 15-27

  4. Topological characterizations of infinite behaviours of transition systems

    • André Arnold
    Pages 28-38

  5. Linear time and branching time semantics for recursion with merge

    • J. W. de Bakker, J. A. Bergstra, J. W. Klop, J. -J. Ch. Meyer
    Pages 39-51

  6. Processes and a fair semantics for the ADA rendez-vous

    • J. W. de Bakker, J. I. Zucker
    Pages 52-66

  7. Conditional dependencies for horizontal decompositions

    • P. De Bra, J. Paredaens
    Pages 67-82

  8. On the relationship of CCS and CSP

    • Stephen D. Brookes
    Pages 83-96

  9. Behavioural equivalence relations induced by programming logics

    • Stephen D. Brookes, William C. Rounds
    Pages 97-108

  10. Lower bounds for constant depth circuits for prefix problems

    • Ashok K. Chandra, Steven Fortune, Richard Lipton
    Pages 109-117

  11. Test sets for morphisms with bounded delay

    • Christian Choffrut, Juhani Karhumaki
    Pages 118-127

  12. Symmetric and economical solutions to the mutual exclusion problem in a distributed system

    • Shimon Cohen, Daniel Lehmann, Amir Pnueli
    Pages 128-136

  13. Ambiguity and decision problems concerning number systems

    • Karel Culik II, Arto Salomaa
    Pages 137-146

  14. On the observational semantics of fair parallelism

    • Ph. Darondeau, L. Kott
    Pages 147-159

  15. An O(N4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching

    • Frank Dehne
    Pages 160-172

  16. Algebraic languages and polyomnoes enumeration

    • M. P. Delest, G. Viennot
    Pages 173-181

  17. On the number of equal-sized semispaces of a set of points in the plane

    • Herbert Edelsbrunner, Emmerich Welzl
    Pages 182-187

  18. Algebraic specifications with generating constraints

    • H. Ehrig, E. G. Wagner, J. W. Thatcher
    Pages 188-202

  19. Wythoff games, continued fractions, cedar trees and Fibonacci searches

    • Aviezri S. Fraenkel
    Pages 203-225

  20. Initial index: A new complexity function for languages

    • J. Gabarro
    Pages 226-236
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation