LEADER 05612nam 22005775 450 001 996466335803316 005 20200707022603.0 010 $a3-540-40038-9 024 7 $a10.1007/BFb0036892 035 $a(CKB)1000000000230271 035 $a(SSID)ssj0000321513 035 $a(PQKBManifestationID)11231243 035 $a(PQKBTitleCode)TC0000321513 035 $a(PQKBWorkID)10279582 035 $a(PQKB)10313640 035 $a(DE-He213)978-3-540-40038-7 035 $a(PPN)155166352 035 $a(EXLCZ)991000000000230271 100 $a20121227d1983 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $e10th Colloquium Barcelona, Spain, July 18?22, 1983 /$fedited by J. Diaz 205 $a1st ed. 1983. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1983. 215 $a1 online resource (VIII, 737 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v154 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-12317-2 327 $aOn semantic foundations for applicative multiprogramming -- An axiomatization of the intermittent assertion method using temporal logic -- Topological characterizations of infinite behaviours of transition systems -- Linear time and branching time semantics for recursion with merge -- Processes and a fair semantics for the ADA rendez-vous -- Conditional dependencies for horizontal decompositions -- On the relationship of CCS and CSP -- Behavioural equivalence relations induced by programming logics -- Lower bounds for constant depth circuits for prefix problems -- Test sets for morphisms with bounded delay -- Symmetric and economical solutions to the mutual exclusion problem in a distributed system -- Ambiguity and decision problems concerning number systems -- On the observational semantics of fair parallelism -- An O(N4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching -- Algebraic languages and polyomnoes enumeration -- On the number of equal-sized semispaces of a set of points in the plane -- Algebraic specifications with generating constraints -- Wythoff games, continued fractions, cedar trees and Fibonacci searches -- Initial index: A new complexity function for languages -- Modular compiler descriptions based on abstract semantic data types (Extended Abstract) -- Polynomial-time factorization of multivariate polynomials over finite fields -- Processes of place/transition-nets -- A hardware semantics based on temporal intervals -- Lower bounds for solving undirected graph problems on VLSI -- Concurrent probabilistic program, or: How to schedule if you must -- Computation times of NP sets of different densities -- Rewrite methods for clausal and non-clausal theorem proving -- Complexity of infinite trees -- Incremental construction of unification algorithms in equational theories -- Tree automata and attribute grammars -- Effectively given spaces -- A note on intersections of free submonoids of a free monoid -- A fast sorting algorithm for VLSI -- On the composition of morphisms and inverse morphisms -- On the group complexity of a finite language -- Reasoning with time and chance -- Factoring multivariate integral polynomials -- On the study data structures: Binary tournaments with repeated keys -- Minimizing width in linear layouts -- Proving precedence properties: The temporal way -- An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language -- Searchability in merging and implicit data structures -- Strong abstract interpretation using power domains -- Testing equivalences for processes -- Specification-oriented semantics for communicating processes -- Complexity classes of alternating machines with oracles -- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots -- Parallel dictionaries on 2?3 trees -- Varietes de semigroupes et mots infinis -- Arbres et hierarchies de concatenation -- A multiprocess network logic with temporal and spatial modalities -- Enumeration of success patterns in logic programs -- Immunity -- Power domains and predicate transformers: A topological view -- Recognition and isomorphism of two dimensional partial orders -- On the simulation of many storage heads by a single one -- Synchronisation trees -- Cutting and partitioning a graph after a fixed pattern -- Context-free controlled etol systems -- Referees for ICALP-83. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v154 606 $aComputers 606 $aMathematical logic 606 $aComputer programming 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 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 615 0$aComputers. 615 0$aMathematical logic. 615 0$aComputer programming. 615 14$aComputation by Abstract Devices. 615 24$aMathematical Logic and Formal Languages. 615 24$aProgramming Techniques. 676 $a004.0151 702 $aDiaz$b J$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466335803316 996 $aAutomata, languages and programming$9339738 997 $aUNISA