Automata, Languages and Programming

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

AvJ. W. de Bakker,J. van Leeuwen

Häftad, Engelska, 1980

Del i serien Lecture Notes in Computer Science

538 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1980-06-01
Mått:155 x 235 x 37 mm
Vikt:1 019 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:671
Upplaga:1980
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540100034

Utforska kategorier

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

Innehållsförteckning

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.

Du kanske också är intresserad av

Logic Programming Languages

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

Häftad, 1993

538 kr

Alan Turing

S. Barry Cooper, J. van Leeuwen

Inbunden, 2013

698 kr

Control Flow Semantics

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

Häftad, 1996

1 533 kr

Topics in the Theory of Computation

J. van Leeuwen, M. Karpinski

E-bok

1985

702 kr

Alan Turing

J. van Leeuwen, S. Barry Cooper

E-bok

2013

734 kr

de Vlaamse Wetsvernieuwing: Een Onderzoek Naar de Jaarlijkse Keuze En Aanstelling Van Het Stadsbestuur in Gent, Brugge En Ieper in de Middeleeuwen

J. Van Leeuwen

Häftad

659 kr

Germaansche Godenleer...

J Van Leeuwen, J van Leeuwen (of Schiedam

Inbunden, 2023

391 kr

Aves. Cum prolegomenis et commentariis, edidit J. van Leeuwen

J Van Leeuwen

Häftad, 2023

305 kr

Germaansche Godenleer...

J Van Leeuwen, J van Leeuwen (of Schiedam

Häftad, 2023

279 kr

Aves. Cum prolegomenis et commentariis, edidit J. van Leeuwen

J Van Leeuwen

Inbunden, 2023

445 kr

Automata, Languages and Programming

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

AvJ. W. de Bakker,J. van Leeuwen

Häftad, Engelska, 1980

Del i serien Lecture Notes in Computer Science

538 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1980-06-01
Mått:155 x 235 x 37 mm
Vikt:1 019 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:671
Upplaga:1980
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540100034

Utforska kategorier

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

Innehållsförteckning

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.