Publicado por Springer-Verlag, Berlin, Germany, 1988
ISBN 10: 3540514988 ISBN 13: 9783540514985
Idioma: Inglés
Librería: SUNSET BOOKS 2, Newark, OH, Estados Unidos de America
Original o primera edición
EUR 10,54
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Good. No Jacket. 1st. w/full markings, pocket, and/or bookplate. Wear, soil. slight Wave to pages from improper storage. 493 numbered pages. Size: 8vo. Ex-Library.
Publicado por Springer-Verlag, Berlin, 1989
ISBN 10: 3540514988 ISBN 13: 9783540514985
Idioma: Inglés
Librería: PsychoBabel & Skoob Books, Didcot, Reino Unido
EUR 7,97
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Very Good. Estado de la sobrecubierta: No Dust Jacket. Lecture Notes in Computer Science 380; Ex-Library. Ink stamp and previous owner's sticker on the front cover. Small pen inscription on title page; library catalogue sticker on colophon. Minute traces of sticker residue and faint scuffs across the spine head. Sound, clean book with tight binding. ADG. Ex-Library.
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
EUR 13,62
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.
Librería: BookHolders, Towson, MD, Estados Unidos de America
EUR 36,11
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Very Good. [ No Hassle 30 Day Returns ][ Ships Daily ] [ Underlining/Highlighting: NONE ] [ Writing: NONE ] [ Edition: First ] Publisher: Springer Verlag Pub Date: 1/9/1981 Binding: Paperback Pages: 470 First edition.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 48,31
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 48,31
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,71
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 52,71
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Alemania
EUR 40,00
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoSoftcover. 1981. 471 p. ATTENTION 1981 EDITION!!! Unread book. Very good condition. Possibly minimal storage marks. 9783540108542 Sprache: Englisch Gewicht in Gramm: 816.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,37
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,37
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 56,89
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 56,95
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Publicado por Springer Berlin Heidelberg, 1981
ISBN 10: 3540108548 ISBN 13: 9783540108542
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Observability and Nerode equivalence in concrete categories.- Some universal algebraic and model theoretic results in computer science.- Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems.- Moderately exponential bound for graph isomorphism.- An algebraic definition of attributed transformations.- Analogies of PAL and COPY.- Quasi-equational logic for partial algeras.- Homogeneity and completeness.- On the error correcting power of pluralism in inductive inference.- Equality languages and language families.- Extremal combinatorial problems in relational data base.- Specifying algebraic data types by domain equations.- An axiomatization of regular forests in the language of algebraic theories with iteration.- Fast recognition of rings and lattices.- A definition of the P = NP-problem in categories.- Generating graph languages using hypergraph grammars.- Lower bounds for problems defined by polynomial inequalities.- What is computable for abstract data types .- On strongly cube-free -words generated by binary morphisms.- On the role of selectors in selective substitution grammars.- Classes of functions over binary trees.- Mathematical structures underlying greedy algorithms.- Some properties of language families generated by commutative languages.- Isomorphism completeness for some algebraic structures.- Reducing algebraic tree grammars.- Rational cone and substitution.- On the regularity problem of SF-languages generated by minimal linear grammars.- Co-algebras as machines for the interpretations of flow diagrams.- Random access machines and straight-line programs.- On the LBA problem.- Dynamic algebras of programs.- The equivalence problem for LL- and LR-regular grammars.- Context-free languages of infinite words as least fixpoints.- Remarks on the notion of concurrency relation in the case of systems.- On the size of conjunctive representations of n-ary relations.- On subwords of formal languages.- First order dynamic logic with decidable proofs and workable model theory.- Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures.- Processes in Petri nets.- Some algebraic aspects of recognizability and rationality.- Pebbling and bandwidth.- On cellular graph-automata and second-order definable graph-properties.- Extensions of symmetric hom-functors to the Kleisli category.- A new operation between languages.- Logical description of computation processes.- An algorithm to identify slices, with applications to vector replacement systems.- One pebble does not suffice to search plane labyrinths.- About the by codings of environments induced posets [¿ z, ] and [ z, ].- The complexity of automata and subtheories of monadic second order arithmetics.- Tape complexity of word problems.
Publicado por Springer Berlin Heidelberg, 1989
ISBN 10: 3540514988 ISBN 13: 9783540514985
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections: - Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing; - Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming; - Formal Languages: Rewriting Systems, Algebraic Language Theory; - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 109,31
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Very Good. Very Good. book.