Zustand: Gut. Auflage: 1980. 688 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 2066 23,5 x 15,5 x 3,9 cm, Taschenbuch. Bestandsnummer des Verk�ufers 368175

Verk�ufer kontaktieren

Gebraucht kaufen

EUR 38,09

W�hrung umrechnen

Versand: EUR 4,00

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming, 1980

DE BAKKER, J. W.; VAN LEEUWEN, J. (eds.)

Verlag: Springer, Berlin, 1980

ISBN 10: 3540100032 ISBN 13: 9783540100034

Gebraucht Softcover

Anbieter: Attic Books (ABAC, ILAB), London, ON, Kanada

Verk�uferbewertung 5 von 5 Sternen

Softcover. Zustand: ex library-good. Lecture Notes in Computer Science 85. viii, 671 p. 24 cm. B&w figures. Paperback. Ex library with labels on spine and inside rear cover. Ink stamps on top edge and title. Pages browning. Seventh Colloquium, Noordwijkerhout, Netherlands, July 14-18, 1980. Bestandsnummer des Verk�ufers 148872

Verk�ufer kontaktieren

Gebraucht kaufen

EUR 22,34

W�hrung umrechnen

Versand: EUR 21,69

Von Kanada nach Deutschland

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming

Bakker, Jacobus W. de|Leeuwen, Jan van

Verlag: Springer Berlin Heidelberg, 1980

ISBN 10: 3540100032 ISBN 13: 9783540100034

Neu Softcover

Print-on-Demand

Anbieter: moluna, Greven, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. How to get rid of pseudoterminals.- Test sets for homomorphism equivalence on context free languages.- Languages with homomorphic replacements.- Functions equivalent to integer multiplication.- Languages with reducing reflexive types.- Semantics of unbounde. Bestandsnummer des Verk�ufers 4880741

Verk�ufer kontaktieren

Neu kaufen

EUR 45,74

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming

J. Van Leeuwen

Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1980, 1980

ISBN 10: 3540100032 ISBN 13: 9783540100034

Neu Taschenbuch

Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: Neu. Neuware -How to get rid of pseudoterminals.- Test sets for homomorphism equivalence on context free languages.- Languages with homomorphic replacements.- Functions equivalent to integer multiplication.- Languages with reducing reflexive types.- Semantics of unbounded nondeterminism.- A shifting algorithm for min-max tree partitioning.- A characterisation of computable data types by means of a finite equational specification method.- A note on sweeping automata.- Border rank of a p�� tensor and the optimal approximation of a pair of bilinear forms.- Derivations et reductions dans les grammaires algebrioues.- Semantic analysis of communicating sequential processes.- Dos systems and languages.- Algebraic implementation of abstract data types: concept, syntax, semantics and correctness.- Parameterized data types in algebraic specification languages.- Characterizing correctness properties of parallel programs using fixpoints.- Formal properties of one-visit and multi-pass attribute grammars (extended abstract).- Cryptocomplexity and NP-completeness.- On the analysis of tree-matching algorithms.- Generating and searching sets induced by networks.- The complexity of the inequivalence problem for regular expressions with intersection.- An almost linear time algorithm for computing a dependency basis in a relational data base.- Bipolar synchronization systems.- Testing of properties of finite algebras.- A transaction model.- On observing nondeterminism and concurrency.- Terminal algebra semantics and retractions for abstract data types.- The complexity of semilinear sets.- A theory of nondeterminism.- A representation theorem for models of \*-free PDL.- Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions.- Symmertric space-bounded computation (extended abstract).- On some properties of local testability.- Semantics :Algebras,fixed points,axioms.- Measuring the expressive power of dynamic logics: An application of abstract model theory.- Pebbling mountain ranges and its application to DCFL-recognition.- Space-restricted attribute grammars.- A constructive approach to compiler correctness.- A worst-case analysis of nearest neighbor searching by projection.- Proprietes syntactiques du produit non ambigu.- On the optimal assignment of attributes to passes in multi-pass attribute evaluators.- Optimal unbounded search strategies.- A 'fast implementation' of a multidimensional storage into a tree storage.- Grammatical families.- Partitioned chain grammars.- An improved program for constructing open hash tables.- On the power of commutativity in cryptography.- Characterizations of the LL(k) property.- Computability in categories.- On the size complexity of monotone formulas.- Reversible computing.- The use of metasystem transition in theorem proving and program optimization.- On the power of real-time turing machines under varying specifications.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 684 pp. Englisch. Bestandsnummer des Verk�ufers 9783540100034

Verk�ufer kontaktieren

Neu kaufen

EUR 50,28

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 2 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming : Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings

J. Van Leeuwen

Verlag: Springer Berlin Heidelberg, 1980

ISBN 10: 3540100032 ISBN 13: 9783540100034

Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - How to get rid of pseudoterminals.- Test sets for homomorphism equivalence on context free languages.- Languages with homomorphic replacements.- Functions equivalent to integer multiplication.- Languages with reducing reflexive types.- Semantics of unbounded nondeterminism.- A shifting algorithm for min-max tree partitioning.- A characterisation of computable data types by means of a finite equational specification method.- A note on sweeping automata.- Border rank of a p�� tensor and the optimal approximation of a pair of bilinear forms.- Derivations et reductions dans les grammaires algebrioues.- Semantic analysis of communicating sequential processes.- Dos systems and languages.- Algebraic implementation of abstract data types: concept, syntax, semantics and correctness.- Parameterized data types in algebraic specification languages.- Characterizing correctness properties of parallel programs using fixpoints.- Formal properties of one-visit and multi-pass attribute grammars (extended abstract).- Cryptocomplexity and NP-completeness.- On the analysis of tree-matching algorithms.- Generating and searching sets induced by networks.- The complexity of the inequivalence problem for regular expressions with intersection.- An almost linear time algorithm for computing a dependency basis in a relational data base.- Bipolar synchronization systems.- Testing of properties of finite algebras.- A transaction model.- On observing nondeterminism and concurrency.- Terminal algebra semantics and retractions for abstract data types.- The complexity of semilinear sets.- A theory of nondeterminism.- A representation theorem for models of \*-free PDL.- Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions.- Symmertric space-bounded computation (extended abstract).- On some properties of local testability.- Semantics :Algebras,fixed points,axioms.- Measuring the expressive power of dynamic logics: An application of abstract model theory.- Pebbling mountain ranges and its application to DCFL-recognition.- Space-restricted attribute grammars.- A constructive approach to compiler correctness.- A worst-case analysis of nearest neighbor searching by projection.- Proprietes syntactiques du produit non ambigu.- On the optimal assignment of attributes to passes in multi-pass attribute evaluators.- Optimal unbounded search strategies.- A 'fast implementation' of a multidimensional storage into a tree storage.- Grammatical families.- Partitioned chain grammars.- An improved program for constructing open hash tables.- On the power of commutativity in cryptography.- Characterizations of the LL(k) property.- Computability in categories.- On the size complexity of monotone formulas.- Reversible computing.- The use of metasystem transition in theorem proving and program optimization.- On the power of real-time turing machines under varying specifications. Bestandsnummer des Verk�ufers 9783540100034

Verk�ufer kontaktieren

Neu kaufen

EUR 50,28

W�hrung umrechnen

Versand: Gratis

Innerhalb Deutschlands

Versandziele, Kosten & Dauer

Anzahl: 1 verf�gbar

In den Warenkorb

Foto des Verk�ufers

Automata, Languages and Programming

J. Van Leeuwen

Verlag: Springer Berlin Heidelberg Jun 1980, 1980

ISBN 10: 3540100032 ISBN 13: 9783540100034

Neu Taschenbuch

Print-on-Demand

Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland

Verk�uferbewertung 5 von 5 Sternen

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -How to get rid of pseudoterminals.- Test sets for homomorphism equivalence on context free languages.- Languages with homomorphic replacements.- Functions equivalent to integer multiplication.- Languages with reducing reflexive types.- Semantics of unbounded nondeterminism.- A shifting algorithm for min-max tree partitioning.- A characterisation of computable data types by means of a finite equational specification method.- A note on sweeping automata.- Border rank of a p�� tensor and the optimal approximation of a pair of bilinear forms.- Derivations et reductions dans les grammaires algebrioues.- Semantic analysis of communicating sequential processes.- Dos systems and languages.- Algebraic implementation of abstract data types: concept, syntax, semantics and correctness.- Parameterized data types in algebraic specification languages.- Characterizing correctness properties of parallel programs using fixpoints.- Formal properties of one-visit and multi-pass attribute grammars (extended abstract).- Cryptocomplexity and NP-completeness.- On the analysis of tree-matching algorithms.- Generating and searching sets induced by networks.- The complexity of the inequivalence problem for regular expressions with intersection.- An almost linear time algorithm for computing a dependency basis in a relational data base.- Bipolar synchronization systems.- Testing of properties of finite algebras.- A transaction model.- On observing nondeterminism and concurrency.- Terminal algebra semantics and retractions for abstract data types.- The complexity of semilinear sets.- A theory of nondeterminism.- A representation theorem for models of \*-free PDL.- Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions.- Symmertric space-bounded computation (extended abstract).- On some properties of local testability.- Semantics :Algebras,fixed points,axioms.- Measuring the expressive power of dynamic logics: An application of abstract model theory.- Pebbling mountain ranges and its application to DCFL-recognition.- Space-restricted attribute grammars.- A constructive approach to compiler correctness.- A worst-case analysis of nearest neighbor searching by projection.- Proprietes syntactiques du produit non ambigu.- On the optimal assignment of attributes to passes in multi-pass attribute evaluators.- Optimal unbounded search strategies.- A 'fast implementation' of a multidimensional storage into a tree storage.- Grammatical families.- Partitioned chain grammars.- An improved program for constructing open hash tables.- On the power of commutativity in cryptography.- Characterizations of the LL(k) property.- Computability in categories.- On the size complexity of monotone formulas.- Reversible computing.- The use of metasystem transition in theorem proving and program optimization.- On the power of real-time turing machines under varying specifications. 684 pp. Englisch. Bestandsnummer des Verk�ufers 9783540100034

Verk�ufer kontaktieren