LEADER 06075nam 22007215 450 001 996466127303316 005 20200707030026.0 010 $a3-540-38886-9 024 7 $a10.1007/3-540-13345-3 035 $a(CKB)1000000000230350 035 $a(SSID)ssj0000321512 035 $a(PQKBManifestationID)11227083 035 $a(PQKBTitleCode)TC0000321512 035 $a(PQKBWorkID)10279535 035 $a(PQKB)10352248 035 $a(DE-He213)978-3-540-38886-9 035 $a(PPN)155197878 035 $a(EXLCZ)991000000000230350 100 $a20121227d1984 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages, and Programming$b[electronic resource] $e11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings /$fedited by J. Paredaens 205 $a1st ed. 1984. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1984. 215 $a1 online resource (X, 530 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v172 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-13345-3 327 $aThe theory of data dependencies ? An overview -- The VLSI revolution in theoretical circles -- Tuple sequences and indexes -- The complexity of cubical graphs -- P-generic sets -- Functional dependencies and disjunctive existence constraints in database relations with null values -- The algebra of recursively defined processes and the algebra of regular processes -- Algebraic specification of exception handling and error recovery by means of declarations and equations -- Building the minimal DFA for the set of all subwords of a word on-line in linear time -- The complexity and decidability of separation -- Concurrent transmissions in broadcast networks -- Linear searching for a square in a word -- Domain algebras -- Principality results about some matrix languages families -- Oriented equational clauses as a programming language -- Relational algebra operations and sizes of relations -- Some results about finite and infinite behaviours of a pushdown automaton -- On the relationship of CCS and petri nets -- Communicating finite state machines with priority channels -- A modal characterization of observational congruence on finite terms of CCS -- Communication complexity -- Space and time efficient simulations and characterizations of some restricted classes of PDAS -- A complete axiom system for algebra of closed-regular expression -- The complexity of finding minimum-length generator sequences -- On probabilistic tape complexity and fast circuits for matrix inversion problems -- On three-element codes -- Recursion depth analysis for special tree traversal algorithms -- Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem -- Measures of presortedness and optimal sorting algorithms -- Languages and inverse semigroups -- Area-time optimal vlsi integer multiplier with minimum computation time -- On the interpretation of infinite computations in logic programming -- A linear time algorithm to solve the single function coarsest partition problem -- Complexité des facteurs des mots infinis engendrés par morphismes itérés -- Automates boustrophedon, semi-groupe de birget et monoide inversif libre -- Probabilistic bidding gives optimal distributed resource allocation -- Partial order semantics versus interleaving semantics for CSP ? like languages and its impact on fairness -- Cancellation, pumping and permutation in formal languages -- A hardware implementation of the CSP primitives and its verification -- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm -- Robust algorithms: A different approach to oracles -- Node weighted matching -- The propositional mu-calculus is elementary -- AVL-trees for localized search -- The simple roots of real-time computation hierarchies -- Computational complexity of an optical disk interface -- Encoding graphs by derivations and implications for the theory of graph grammars -- Sampling algorithms for differential batch retrieval problems (extended abstract). 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v172 606 $aComputers 606 $aComputer programming 606 $aProgramming languages (Electronic computers) 606 $aAlgorithms 606 $aComputer logic 606 $aMathematical logic 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aComputers. 615 0$aComputer programming. 615 0$aProgramming languages (Electronic computers). 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aMathematical logic. 615 14$aComputation by Abstract Devices. 615 24$aProgramming Techniques. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 676 $a004.0151 702 $aParedaens$b J$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466127303316 996 $aAutomata, languages and programming$9339738 997 $aUNISA