عنوان

Automata, Languages and Programming :

(Number (ISBN

3540400389

(Number (ISBN

9783540400387

Number

b566005

Title Proper

Automata, Languages and Programming :

General Material Designation

[Book]

Other Title Information

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

First Statement of Responsibility

edited by Josep Diaz.

Place of Publication, Distribution, etc.

Berlin, Heidelberg

Name of Publisher, Distributor, etc.

Springer Berlin Heidelberg

Date of Publication, Distribution, etc.

1983

Specific Material Designation and Extent of Item

(VIII, 737 p.).

Series Title

Lecture notes in computer science, 154.

Text of Note

Bibliographic Level Mode of Issuance: Monograph.

Text of Note

On semantic foundations for applicative multiprogramming --; An axiomatization of the intermittent assertion method using temporal logic --; Topological characterizations of infinite behaviours of transition systems --; Linear time and branching time semantics for recursion with merge --; Processes and a fair semantics for the ADA rendez-vous --; Conditional dependencies for horizontal decompositions --; On the relationship of CCS and CSP --; Behavioural equivalence relations induced by programming logics --; Lower bounds for constant depth circuits for prefix problems --; Test sets for morphisms with bounded delay --; Symmetric and economical solutions to the mutual exclusion problem in a distributed system --; Ambiguity and decision problems concerning number systems --; On the observational semantics of fair parallelism --; An O(N4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching --; Algebraic languages and polyomnoes enumeration --; On the number of equal-sized semispaces of a set of points in the plane --; Algebraic specifications with generating constraints --; Wythoff games, continued fractions, cedar trees and Fibonacci searches --; Initial index: A new complexity function for languages --; Modular compiler descriptions based on abstract semantic data types (Extended Abstract) --; Polynomial-time factorization of multivariate polynomials over finite fields --; Processes of place/transition-nets --; A hardware semantics based on temporal intervals --; Lower bounds for solving undirected graph problems on VLSI --; Concurrent probabilistic program, or: How to schedule if you must --; Computation times of NP sets of different densities --; Rewrite methods for clausal and non-clausal theorem proving --; Complexity of infinite trees --; Incremental construction of unification algorithms in equational theories --; Tree automata and attribute grammars --; Effectively given spaces --; A note on intersections of free submonoids of a free monoid --; A fast sorting algorithm for VLSI --; On the composition of morphisms and inverse morphisms --; On the group complexity of a finite language --; Reasoning with time and chance --; Factoring multivariate integral polynomials --; On the study data structures: Binary tournaments with repeated keys --; Minimizing width in linear layouts --; Proving precedence properties: The temporal way --; An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language --; Searchability in merging and implicit data structures --; Strong abstract interpretation using power domains --; Testing equivalences for processes --; Specification-oriented semantics for communicating processes --; Complexity classes of alternating machines with oracles --; A propos d'une conjecture de F. Dejean sur les répétitions dans les mots --; Parallel dictionaries on 2-3 trees --; Varietes de semigroupes et mots infinis --; Arbres et hierarchies de concatenation --; A multiprocess network logic with temporal and spatial modalities --; Enumeration of success patterns in logic programs --; Immunity --; Power domains and predicate transformers: A topological view --; Recognition and isomorphism of two dimensional partial orders --; On the simulation of many storage heads by a single one --; Synchronisation trees --; Cutting and partitioning a graph after a fixed pattern --; Context-free controlled etol systems --; Referees for ICALP-83.

Computer programming.

Computer science.

Computers.

edited by Josep Diaz.

Josep Diaz

Electronic name

[Book]

Y