LEADER 05269nam 22005775 450 001 996465710203316 005 20200630184552.0 010 $a3-540-39859-7 024 7 $a10.1007/3-540-16761-7 035 $a(CKB)1000000000230536 035 $a(SSID)ssj0000321509 035 $a(PQKBManifestationID)11283931 035 $a(PQKBTitleCode)TC0000321509 035 $a(PQKBWorkID)10279852 035 $a(PQKB)10487821 035 $a(DE-He213)978-3-540-39859-2 035 $a(PPN)155165976 035 $a(EXLCZ)991000000000230536 100 $a20121227d1986 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $e13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings /$fedited by Laurent Kott 205 $a1st ed. 1986. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1986. 215 $a1 online resource (XII, 476 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v226 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-16761-7 327 $aCharacterizations of PUNC and precomputation -- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach -- A new duality result concerning Voronoi diagrams -- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial -- On exponential lowness -- A tradeoff between search and update time for the implicit dictionary problem -- Intersections of some families of languages -- Correspondence between ternary simulation and binary race analysis in gate networks -- Counting with rational functions -- Finite biprefix sets of paths in a Graph -- Parallel RAMs with owned global memory and deterministic context-free language recognition -- A Strong restriction of the inductive completion procedure -- On discerning words by automata -- Complexity classes without machines: On complete languages for UP -- Containment, separation, complete sets, and immunity of complexity classes -- On nontermination of Knuth-Bendix algorithm -- Tradeoffs for language recognition on parallel computing models -- Rational equivalence relations -- Some further results on digital search trees -- Knowledge, belief and time -- A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication -- Decompositions of nondeterministic reductions -- Hierarchical planarity testing algorithms -- Synthesis and equivalence of concurrent systems -- The set union problem with backtracking -- Torsion matrix semigroups and recognizable transductions -- On recognizable subsets of free partially commutative monoids -- Min Cut is NP-complete for edge weighted trees -- Alternating automata, the weak monadic theory of the tree, and its complexity -- Subpolynomial complexity classes of real functions and real numbers -- Etude syntaxique des parties reconnaissables de mots infinis -- Refusal testing -- A timed model for communicating sequential processes -- A uniform reduction theorem extending a result of J. Grollmann and A. Selman -- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs -- A new approach to detection of locally indicative stability -- A more efficient algorithm for lattice basis reduction -- Lower bounds by recursion theoretic arguments -- An improved algorithm for transitive closure on acyclic digraphs -- Un algorithme determinant les melanges de deux mots -- A very fast, practical algorithm for finding a negative cycle in a digraph -- A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language -- Semigroups and languages of dot-depth 2 -- A parallel vertex insertion algorithm for minimum spanning trees -- More complicated questions about maxima and minima, and some closures of NP -- Lower bounds for dynamic range query problems that permit subtraction (extended abstract) -- E-unification algorithms for a class of confluent term rewriting systems -- On fixed-point clones. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v226 606 $aComputer logic 606 $aMathematical logic 606 $aComputers 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 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aComputers. 615 14$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aComputation by Abstract Devices. 676 $a005.1015113 702 $aKott$b Laurent$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465710203316 996 $aAutomata, languages and programming$9339738 997 $aUNISA