Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18 22, 1983 - Couverture souple
Résultats de recherche pour Automata, Languages and Programming: 10th Colloquium...
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)
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
Acheter D'occasion
EUR 15,98
Frais de port :
EUR 4,31
Vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming. Tenth Colloquium, Barcelona, Spain, July 18-22, 1983. Proceedings.
Edité par
Berlin, Springer Berlin Heidelberg, 1983
ISBN 10 : 3540123172
ISBN 13 : 9783540123170
Ancien ou d'occasion
Couverture souple
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
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
Acheter D'occasion
EUR 17,70
Frais de port :
EUR 16
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983 (Lecture Notes in Computer Science, 154)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020159761
Acheter neuf
EUR 53,52
Frais de port :
EUR 3,44
Vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983 (Lecture Notes in Computer Science, 154)
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
Acheter neuf
EUR 57,76
Frais de port :
EUR 13,68
De Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983 (Lecture Notes in Computer Science)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783540123170
Acheter neuf
EUR 56,66
Frais de port :
EUR 17,68
De Royaume-Uni vers Etats-Unis
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1983, 1983
ISBN 10 : 3540123172
ISBN 13 : 9783540123170
Neuf
Taschenbuch
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. N° de réf. du vendeur 9783540123170
Acheter neuf
EUR 53,49
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming
Edité par
Springer Berlin Heidelberg, 1983
ISBN 10 : 3540123172
ISBN 13 : 9783540123170
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
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
Acheter neuf
EUR 48,37
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 1822, 1983
Edité par
Springer-Verlag New York Inc, 1983
ISBN 10 : 3540123172
ISBN 13 : 9783540123170
Neuf
Paperback
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. bilingual edition. 748 pages. French language. 9.25x6.10x1.49 inches. In Stock. N° de réf. du vendeur x-3540123172
Acheter neuf
EUR 85,83
Frais de port :
EUR 17,12
De Royaume-Uni vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1983, 1983
ISBN 10 : 3540123172
ISBN 13 : 9783540123170
Neuf
Taschenbuch
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
Acheter neuf
EUR 53,49
Frais de port :
EUR 60
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming : 10th Colloquium Barcelona, Spain, July 18¿22, 1983
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
Acheter neuf
EUR 53,49
Frais de port :
EUR 65,56
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)