Articles liés à Automata, Languages and Programming: Seventh Colloquium,...
Automata, Languages and Programming: Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings - Couverture souple
Synopsis
No Automata, Languages and Programming Read a customer review or write one .
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer
- Date d'édition2008
- ISBN 10 3540100032
- ISBN 13 9783540100034
- ReliureBroché
- Langueanglais
- Nombre de pages688
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 45,74
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Automata, Languages and Programming: Seventh Colloquium,...
Image fournie par le vendeur
Automata, Languages and Programming, 1980
Edité par
Springer, Berlin, 1980
ISBN 10 : 3540100032
ISBN 13 : 9783540100034
Ancien ou d'occasion
Softcover
Vendeur : Attic Books (ABAC, ILAB), London, ON, Canada
Évaluation du vendeur 5 sur 5 étoiles
Softcover. Etat : 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. N° de réf. du vendeur 148872
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming: Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings (Lecture Notes in Computer Science) Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings
Edité par
Springer 13.06.2008., 2008
ISBN 10 : 3540100032
ISBN 13 : 9783540100034
Ancien ou d'occasion
Couverture souple
Vendeur : NEPO UG, Rüsselsheim am Main, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 368175
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming
Edité par
Springer Berlin Heidelberg, 1980
ISBN 10 : 3540100032
ISBN 13 : 9783540100034
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 4880741
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Automata, Languages and Programming : Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings
Edité par
Springer Berlin Heidelberg, 1980
ISBN 10 : 3540100032
ISBN 13 : 9783540100034
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 - 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. N° de réf. du vendeur 9783540100034
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming
Edité par
Springer Berlin Heidelberg Jun 1980, 1980
ISBN 10 : 3540100032
ISBN 13 : 9783540100034
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 -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. N° de réf. du vendeur 9783540100034
Quantité disponible : 2 disponible(s)
Image d'archives
Automata, Languages and Programming: Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings (Lecture Notes in Computer Science, 85)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540100034_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Automata, Languages and Programming : Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540100034
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Automata, Languages and Programming
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 1980, 1980
ISBN 10 : 3540100032
ISBN 13 : 9783540100034
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783540100034
Quantité disponible : 2 disponible(s)
Image d'archives
Automata, Languages and Programming
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 684. N° de réf. du vendeur 263061931
Quantité disponible : 4 disponible(s)
Image d'archives
Automata, Languages and Programming
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 684 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 5834612
Quantité disponible : 4 disponible(s)