Vai al contenuto principale della pagina
Titolo: | Automata, Languages and Programming [[electronic resource] ] : Seventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings / / edited by J. W. de Bakker, J. van Leeuwen |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1980 |
Edizione: | 1st ed. 1980. |
Descrizione fisica: | 1 online resource (X, 671 p.) |
Disciplina: | 005.11 |
Soggetto topico: | Computer programming |
Computers | |
Mathematical logic | |
Programming Techniques | |
Computation by Abstract Devices | |
Mathematical Logic and Formal Languages | |
Persona (resp. second.): | BakkerJ. W. de |
LeeuwenJ. van | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di contenuto: | 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. |
Titolo autorizzato: | Automata, languages and programming |
ISBN: | 3-540-39346-3 |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996465763803316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |