Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7788 3540123172 Sprache: Englisch Gewicht in Gramm: 900. N� de r�f. du vendeur 2347486

Contacter le vendeur

Acheter D'occasion

EUR 14,16

Autre devise

Frais de port : EUR 7

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages and Programming: Tenth Colloquium, Barcelona, Spain, July 18-22, 1983. Proceedings (Lecture Notes in Computer Science) (English and French Edition)

Diaz, J.

Edit� par Springer, 1983

ISBN 10 : 3540123172 ISBN 13 : 9783540123170

Ancien ou d'occasion Paperback

Vendeur : Jonathan Grobe Books, Deep River, IA, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : Very Good. Exlibrary with usual library markings. ; 733 pages. N� de r�f. du vendeur 281179

Contacter le vendeur

Acheter D'occasion

EUR 16,09

Autre devise

Frais de port : EUR 29,50

De Etats-Unis vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, languages and programming; Teil: 10. 1983., Barcelona, Spain, July 18 - 22, 1983. Lecture notes in computer science ; 154

Edit� par Berlin ; Heidelberg [u.a.] : Springer, 1983

ISBN 10 : 3540123172 ISBN 13 : 9783540123170

Ancien ou d'occasion (Berlin,

Vendeur : NEPO UG, R�sselsheim am Main, Allemagne

�valuation du vendeur 5 sur 5 �toiles

(Berlin, Etat : Gut. VIII, 733 S. : graph. Darst. Sprache: Deutsch Gewicht in Gramm: 969. N� de r�f. du vendeur 462455

Contacter le vendeur

Acheter D'occasion

EUR 44,50

Autre devise

Frais de port : EUR 9

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages and Programming

Diaz, J.

Edit� par Springer Berlin Heidelberg, 1983

ISBN 10 : 3540123172 ISBN 13 : 9783540123170

Neuf Kartoniert / Broschiert

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 fo. N� de r�f. du vendeur 4881750

Contacter le vendeur

Acheter neuf

EUR 48,37

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

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

J. Diaz

Edit� par Springer Berlin Heidelberg, 1983

ISBN 10 : 3540123172 ISBN 13 : 9783540123170

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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�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. N� de r�f. du vendeur 9783540123170

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983 (Lecture Notes in Computer Science, 154)

Edit� par Springer, 1983

ISBN 10 : 3540123172 ISBN 13 : 9783540123170

Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : New. In. N� de r�f. du vendeur ria9783540123170_new

Contacter le vendeur

Acheter neuf

EUR 61,11

Autre devise

Frais de port : EUR 4,66

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Automata, Languages and Programming

J. Diaz

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1983, 1983

ISBN 10 : 3540123172 ISBN 13 : 9783540123170

Neuf Taschenbuch

impression � la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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�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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 748 pp. Englisch. N� de r�f. du vendeur 9783540123170

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 15

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983 (Paperback or Softback)

Diaz, J.

Edit� par Springer 6/1/1983, 1983

ISBN 10 : 3540123172 ISBN 13 : 9783540123170

Neuf Paperback or Softback

Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Paperback or Softback. Etat : New. Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983 2.27. Book. N� de r�f. du vendeur BBS-9783540123170

Contacter le vendeur

Acheter neuf

EUR 59,60

Autre devise

Frais de port : EUR 10,85

De Etats-Unis vers France

Destinations, frais et d�lais

Quantit� disponible : 5 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Automata, Languages and Programming

J. Diaz

Edit� par Springer Berlin Heidelberg Jun 1983, 1983

ISBN 10 : 3540123172 ISBN 13 : 9783540123170

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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�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. 748 pp. Englisch, Franz�sisch. N� de r�f. du vendeur 9783540123170

Contacter le vendeur