Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18–22, 1983

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Samson Abramsky (auth.), Josep Diaz (eds.)
Series: Lecture Notes in Computer Science 154
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1983

Language: English-French
Pages: 737
Tags: Computation by Abstract Devices; Mathematical Logic and Formal Languages; Programming Techniques

On semantic foundations for applicative multiprogramming....Pages 1-14
An axiomatization of the intermittent assertion method using temporal logic....Pages 15-27
Topological characterizations of infinite behaviours of transition systems....Pages 28-38
Linear time and branching time semantics for recursion with merge....Pages 39-51
Processes and a fair semantics for the ADA rendez-vous....Pages 52-66
Conditional dependencies for horizontal decompositions....Pages 67-82
On the relationship of CCS and CSP....Pages 83-96
Behavioural equivalence relations induced by programming logics....Pages 97-108
Lower bounds for constant depth circuits for prefix problems....Pages 109-117
Test sets for morphisms with bounded delay....Pages 118-127
Symmetric and economical solutions to the mutual exclusion problem in a distributed system....Pages 128-136
Ambiguity and decision problems concerning number systems....Pages 137-146
On the observational semantics of fair parallelism....Pages 147-159
An O(N 4 ) algorithm to construct all Voronoi diagrams for k nearest neighbor searching....Pages 160-172
Algebraic languages and polyomnoes enumeration....Pages 173-181
On the number of equal-sized semispaces of a set of points in the plane....Pages 182-187
Algebraic specifications with generating constraints....Pages 188-202
Wythoff games, continued fractions, cedar trees and Fibonacci searches....Pages 203-225
Initial index: A new complexity function for languages....Pages 226-236
Modular compiler descriptions based on abstract semantic data types (Extended Abstract)....Pages 237-249
Polynomial-time factorization of multivariate polynomials over finite fields....Pages 250-263
Processes of place/transition-nets....Pages 264-277
A hardware semantics based on temporal intervals....Pages 278-291
Lower bounds for solving undirected graph problems on VLSI....Pages 292-303
Concurrent probabilistic program, or: How to schedule if you must....Pages 304-318
Computation times of NP sets of different densities....Pages 319-330
Rewrite methods for clausal and non-clausal theorem proving....Pages 331-346
Complexity of infinite trees....Pages 347-360
Incremental construction of unification algorithms in equational theories....Pages 361-373
Tree automata and attribute grammars....Pages 374-384
Effectively given spaces....Pages 385-396
A note on intersections of free submonoids of a free monoid....Pages 397-407
A fast sorting algorithm for VLSI....Pages 408-419
On the composition of morphisms and inverse morphisms....Pages 420-432
On the group complexity of a finite language....Pages 433-444
Reasoning with time and chance....Pages 445-457
Factoring multivariate integral polynomials....Pages 458-465
On the study data structures: Binary tournaments with repeated keys....Pages 466-477
Minimizing width in linear layouts....Pages 478-490
Proving precedence properties: The temporal way....Pages 491-512
An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language....Pages 513-526
Searchability in merging and implicit data structures....Pages 527-535
Strong abstract interpretation using power domains....Pages 536-547
Testing equivalences for processes....Pages 548-560
Specification-oriented semantics for communicating processes....Pages 561-572
Complexity classes of alternating machines with oracles....Pages 573-584
A propos d'une conjecture de F. Dejean sur les répétitions dans les mots....Pages 585-596
Parallel dictionaries on 2–3 trees....Pages 597-609
Varietes de semigroupes et mots infinis....Pages 610-616
Arbres et hierarchies de concatenation....Pages 617-628
A multiprocess network logic with temporal and spatial modalities....Pages 629-639
Enumeration of success patterns in logic programs....Pages 640-652
Immunity....Pages 653-661
Power domains and predicate transformers: A topological view....Pages 662-675
Recognition and isomorphism of two dimensional partial orders....Pages 676-686
On the simulation of many storage heads by a single one....Pages 687-694
Synchronisation trees....Pages 695-711
Cutting and partitioning a graph after a fixed pattern....Pages 712-722
Context-free controlled etol systems....Pages 723-733
Referees for ICALP-83....Pages 734-734