LEADER 05506nam 22006255 450 001 996466107903316 005 20200707025906.0 010 $a3-540-39557-1 024 7 $a10.1007/BFb0015725 035 $a(CKB)1000000000230450 035 $a(SSID)ssj0000321511 035 $a(PQKBManifestationID)11232823 035 $a(PQKBTitleCode)TC0000321511 035 $a(PQKBWorkID)10280348 035 $a(PQKB)10756360 035 $a(DE-He213)978-3-540-39557-7 035 $a(PPN)155186884 035 $a(EXLCZ)991000000000230450 100 $a20121227d1985 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $e12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings /$fedited by Wilfried Brauer 205 $a1st ed. 1985. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1985. 215 $a1 online resource (XII, 524 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v194 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-15650-X 327 $aVertex packing algorithms -- Linear and branching structures in the semantics and logics of reactive systems -- About rational sets of factors of a bi-infinite word -- A fair protocol for signing contracts -- The influence of key length on the area-time complexity of sorting -- Repeated synchronous snapshots and their implementation in CSP -- On total regulators generated by derivation relations -- Optimal solutions for a class of point retrieval problems -- Fractional cascading: A data structuring technique with geometric applications -- Hierarchies of one-way multihead automata languages -- Partitioning point sets in 4 dimensions -- A completeness theorem for recursively defined types -- Categorical combinatory logic -- Towards a uniform topological treatment of streams and functions on streams -- Infinite streams and finite observations in the semantics of uniform concurrency -- Imposed-functional dependencies inducing horizontal decompositions -- Characterization of high level tree transducers -- Ambiguity and transcendence -- A fast algorithm for polygon containment by translation -- Deterministic and Las Vegas primality testing algorithms -- Efficient algorithms for graphic matroid intersection and parity -- Operational semantics for order-sorted algebra -- A universal domain technique for profinite posets -- A simple proof of the Skolem-Mahler-Lech theorem -- On complete problems for NP?CoNP -- An algebraic theory of fair asynchronous communicating processes -- Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem -- Powerdomains as algebraic lattices preliminary report -- Random generation of combinatiorial structures from a uniform distribution -- Do rational equivalence relations have regular cross-sections? -- On probabilistic time and space -- The nearest neighbor problem on bounded domains -- Routing through a generalized switchbox -- On k-repetition free words generated by length uniform morphisms over a binary alphabet -- Every commutative quasirational language is regular -- A probabilistic distributed algorithm for set intersection and its analysis -- Distributed algorithms in synchronous broadcasting networks -- A context dependent equivalence between processes -- Lower bounds by kolmogorov-complexity -- A bidirectional shortest-path algorithm with good average-case behavior (preliminary version) -- Applications of an infinite squarefree CO-CFL -- Special relations in automated deduction -- Dynamic interpolation search -- Polynomial levelability and maximal complexity cores -- Finite group topology and p-adic topology for free monoids -- On the use of relational expressions in the design of efficient algorithms -- The complementation problem for Büchi automata with applications to temporal logic -- A complete compositional modal proof system for a subset of CCS -- On matrix multiplication using array processors -- Optimal parallel pattern matching in strings -- Compositionality and concurrent networks: Soundness and completeness of a proofsystem. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v194 606 $aComputer programming 606 $aComputers 606 $aMathematical logic 606 $aAlgorithms 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 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aComputer programming. 615 0$aComputers. 615 0$aMathematical logic. 615 0$aAlgorithms. 615 14$aProgramming Techniques. 615 24$aComputation by Abstract Devices. 615 24$aMathematical Logic and Formal Languages. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a005.11 702 $aBrauer$b Wilfried$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466107903316 996 $aAutomata, languages and programming$9339738 997 $aUNISA