Verwandte Artikel zu Automata, Languages and Programming: Seventh Colloquium,...
Automata, Languages and Programming: Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings: 85 (Lecture Notes in Computer Science) - Softcover
- VerlagSpringer
- Erscheinungsdatum2008
- ISBN 10 3540100032
- ISBN 13 9783540100034
- EinbandTapa blanda
- SpracheEnglisch
- Anzahl der Seiten688
- Kontakt zum HerstellerNicht verfügbar
Gebraucht kaufen
Zustand: Gut688 Seiten Exemplar aus einer wissenchaftlichen...
Diesen Artikel anzeigen
EUR 38,09
EUR 4,00 für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 50,28
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Automata, Languages and Programming: Seventh Colloquium,...
Foto des Verkäufers
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
Anbieter: NEPO UG, Rüsselsheim am Main, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Artikel-Nr. 368175
Anzahl: 1 verfügbar
Foto des Verkäufers
Automata, Languages and Programming, 1980
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. Artikel-Nr. 148872
Anzahl: 1 verfügbar
Foto des Verkäufers
Automata, Languages and Programming
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. Artikel-Nr. 9783540100034
Anzahl: 2 verfügbar
Foto des Verkäufers
Automata, Languages and Programming : Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings
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. Artikel-Nr. 9783540100034
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Automata, Languages and Programming: Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings (Lecture Notes in Computer Science, 85)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9783540100034_new
Anzahl: Mehr als 20 verfügbar