Del i serien Lecture Notes in Computer Science

Automata, Languages and Programming

Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings

Häftad, Engelska, 1980

AvJ. W. de Bakker,J. van Leeuwen

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

599 kr

Skickas inom 10-15 vardagar

Häftad

519 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

1 919 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 5-8 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

699 kr

Skickas inom 10-15 vardagar

Häftad

699 kr

Skickas inom 10-15 vardagar

Häftad

699 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum1980-06-01
Mått155 x 235 x 37 mm
Vikt1 019 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor671
Upplaga1980
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540100034

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

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×q×2 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.- Symmertricspace-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.

Mer från samma författare

Logic Programming Languages

Krzysztof R. Apt, J. W. de Bakker, J. M. Rutten

Häftad, 1993

699 kr

Control Flow Semantics

J. W. de Bakker, Erik P. de Vink

Häftad, 1996

1 989 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Albert Cohen - Compiler Construction, Häftad

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Yehuda Lindell - Theory of Cryptography, Häftad

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 209 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

739 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

959 kr

Du kanske också är intresserad av

Automata, Languages and Programming

A. Salomaa, M. Steinby

Häftad, 1977

519 kr

Automata, Languages and Programming

Timo Lepistö, Arto Salomaa

Häftad, 1988

1 439 kr

Automata, Languages and Programming

Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis

Häftad, 2010

1 479 kr

Automata, Languages, and Programming

Fedor V. Fomin, Rusins Freivalds, Marta Kwiatkowska, David Peleg

Häftad, 2013

739 kr

Automata, Languages and Programming

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener

Häftad, 2006

1 479 kr

Automata, Languages and Programming

Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas

Häftad, 2009

1 439 kr

Automata, Languages and Programming

Andrzej Lingas, Rolf Karlsson, Svante Carlsson

Häftad, 1993

1 479 kr

Automata, Languages and Programming

Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela

Häftad, 1997

1 479 kr

Automata, Languages and Programming

Ugo Montanari, Jose D.P. Rolim, Emo Welzl

Häftad, 2000

1 479 kr

Automata, Languages and Programming

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener

Häftad, 2006

1 479 kr

Del i serien Lecture Notes in Computer Science

Automata, Languages and Programming

Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings

Häftad, Engelska, 1980

AvJ. W. de Bakker,J. van Leeuwen

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

599 kr

Skickas inom 10-15 vardagar

Häftad

519 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

1 919 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 5-8 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

699 kr

Skickas inom 10-15 vardagar

Häftad

699 kr

Skickas inom 10-15 vardagar

Häftad

699 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum1980-06-01
Mått155 x 235 x 37 mm
Vikt1 019 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor671
Upplaga1980
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540100034

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

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×q×2 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.- Symmertricspace-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.