Umfang:
Online-Ressource (VIII, 671 S.)
Ausgabe:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540393467
Serie:
Lecture notes in computer science 85
Inhalt:
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 -- 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.
Anmerkung:
Literaturangaben
Weitere Ausg.:
ISBN 3540100032
Weitere Ausg.:
ISBN 0387100032
Weitere Ausg.:
ISBN 9783540100034
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe Automata, languages and programming Berlin [u.a.] : Springer, 1980 ISBN 3540100032
Weitere Ausg.:
ISBN 0387100032
Sprache:
Englisch
Schlagwort(e):
Konferenzschrift
DOI:
10.1007/3-540-10003-2
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Bookmarklink
