Artículos relacionados a Automata, Languages and Programming: 10th Colloquium...
Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983: 154 (Lecture Notes in Computer Science) - Tapa blanda
Comprar nuevo
Ver este artículo
EUR 53,49
EUR 11,99 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Automata, Languages and Programming: 10th Colloquium...
Imagen del vendedor
Automata, Languages and Programming. Tenth Colloquium, Barcelona, Spain, July 18-22, 1983. Proceedings.
Publicado por
Berlin, Springer Berlin Heidelberg, 1983
ISBN 10: 3540123172
ISBN 13: 9783540123170
Antiguo o usado
Tapa blanda
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
Calificación del vendedor: 5 de 5 estrellas
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 ref. del artículo: 2347486
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, Languages and Programming: Tenth Colloquium, Barcelona, Spain, July 18-22, 1983. Proceedings (Lecture Notes in Computer Science) (English and French Edition)
Librería: Jonathan Grobe Books, Deep River, IA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Very Good. Exlibrary with usual library markings. ; 733 pages. Nº de ref. del artículo: 281179
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, languages and programming; Teil: 10. 1983., Barcelona, Spain, July 18 - 22, 1983. Lecture notes in computer science ; 154
Publicado por
Berlin ; Heidelberg [u.a.] : Springer, 1983
ISBN 10: 3540123172
ISBN 13: 9783540123170
Antiguo o usado
(Berlin,
Librería: NEPO UG, Rüsselsheim am Main, Alemania
Calificación del vendedor: 5 de 5 estrellas
(Berlin, Condición: Gut. VIII, 733 S. : graph. Darst. Sprache: Deutsch Gewicht in Gramm: 969. Nº de ref. del artículo: 462455
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, Languages and Programming : 10th Colloquium Barcelona, Spain, July 18¿22, 1983
Publicado por
Springer Berlin Heidelberg, 1983
ISBN 10: 3540123172
ISBN 13: 9783540123170
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783540123170
Cantidad disponible: 1 disponibles
Imagen de archivo
Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983 (Lecture Notes in Computer Science, 154)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540123170_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Automata, Languages and Programming
Publicado por
Springer Berlin Heidelberg, 1983
ISBN 10: 3540123172
ISBN 13: 9783540123170
Nuevo
Kartoniert / Broschiert
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Kartoniert / Broschiert. Condición: 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 ref. del artículo: 4881750
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983 (Paperback or Softback)
Publicado por
Springer 6/1/1983, 1983
ISBN 10: 3540123172
ISBN 13: 9783540123170
Nuevo
Paperback or Softback
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback or Softback. Condición: New. Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 18-22, 1983 2.27. Book. Nº de ref. del artículo: BBS-9783540123170
Cantidad disponible: 5 disponibles
Imagen del vendedor
Automata, Languages and Programming
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1983, 1983
ISBN 10: 3540123172
ISBN 13: 9783540123170
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783540123170
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata, Languages and Programming
Publicado por
Springer Berlin Heidelberg Jun 1983, 1983
ISBN 10: 3540123172
ISBN 13: 9783540123170
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783540123170
Cantidad disponible: 2 disponibles
Imagen de archivo
Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July 1822, 1983
Publicado por
Springer-Verlag New York Inc, 1983
ISBN 10: 3540123172
ISBN 13: 9783540123170
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. bilingual edition. 748 pages. French language. 9.25x6.10x1.49 inches. In Stock. Nº de ref. del artículo: x-3540123172
Cantidad disponible: 2 disponibles