LEADER 05310nam 22005895 450 001 996465763803316 005 20200707022101.0 010 $a3-540-39346-3 024 7 $a10.1007/3-540-10003-2 035 $a(CKB)1000000000230033 035 $a(SSID)ssj0000321516 035 $a(PQKBManifestationID)11230802 035 $a(PQKBTitleCode)TC0000321516 035 $a(PQKBWorkID)10279536 035 $a(PQKB)10741643 035 $a(DE-He213)978-3-540-39346-7 035 $a(PPN)155203401 035 $a(EXLCZ)991000000000230033 100 $a20121227d1980 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $eSeventh Colloquium, Noordwijkerhout, The Netherlands, July 14-18, 1980. Proceedings /$fedited by J. W. de Bakker, J. van Leeuwen 205 $a1st ed. 1980. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1980. 215 $a1 online resource (X, 671 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v85 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-10003-2 327 $aHow 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v85 606 $aComputer programming 606 $aComputers 606 $aMathematical logic 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aComputer programming. 615 0$aComputers. 615 0$aMathematical logic. 615 14$aProgramming Techniques. 615 24$aComputation by Abstract Devices. 615 24$aMathematical Logic and Formal Languages. 676 $a005.11 702 $aBakker$b J. W. de$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLeeuwen$b J. van$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465763803316 996 $aAutomata, languages and programming$9339738 997 $aUNISA