LEADER 06365nam 22007095 450 001 996465668503316 005 20200704132138.0 010 $a3-540-47579-6 024 7 $a10.1007/3-540-54345-7 035 $a(CKB)1000000000233680 035 $a(SSID)ssj0000324661 035 $a(PQKBManifestationID)11246404 035 $a(PQKBTitleCode)TC0000324661 035 $a(PQKBWorkID)10314356 035 $a(PQKB)11254238 035 $a(DE-He213)978-3-540-47579-8 035 $a(PPN)155170880 035 $a(EXLCZ)991000000000233680 100 $a20121227d1991 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aMathematical Foundations of Computer Science 1991$b[electronic resource] $e16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings /$fby Andrzej Tarlecki 205 $a1st ed. 1991. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991. 215 $a1 online resource (XI, 437 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v520 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-54345-7 327 $aElimination of negation in term algebras -- Rewrite orderings and termination of rewrite systems -- On the faithfulness of formal models -- Models for concurrency -- On a hierarchy of file types and a tower of their theories -- Strong conjunction and intersection types -- Partial higher-order specifications -- Unification in incompletely specified theories: A case study -- Observing localities -- Abstract dynamic data types: A temporal logic approach -- Generating words by cellular automata -- Atomic refinement in process description languages -- Recognizable complex trace languages (abstract) -- Solving systems of linear diophantine equations: An algebraic approach -- A second-order pattern matching algorithm for the cube of typed ?-calculi -- The lazy call-by-value ?-calculus -- The limit of split n -bisimulations for CCS agents -- Stochastic automata and length distributions of rational languages -- Towards a categorical semantics of type classes -- Single-path Petri nets -- The bisection problem for graphs of degree 4 (configuring transputer systems) -- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata -- Infinite normal forms for non-linear term rewriting systems -- Two algorithms for approxmate string matching in static texts -- Efficient constructions of test sets for regular and context-free languages -- The complexity of the reliable connectivity problem -- Pattern matching in order-sorted languages -- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus -- A solution of the complement problem in associatiue-commutatiue theories -- A model for real-time systems -- On strict codes -- A decidable case of the semi-unification problem -- Maintaining dictionaries in a hierarchical memory -- Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ?-BRANCHING PROGRAMs -- CCS dynamic bisimulation is progressing -- Syntax and semantics of a monotonic framework for non-monotonic reasoning -- On the cardinality of sets of infinite trees recognizable by finite automata -- Extending temporal logic by explicit concurrency -- An extensional partial combinatory algebra based on ?-terms -- Once more on order-sorted algebras -- Composition of two semi commutations -- An efficient decision algorithm for the uniform semi-unification problem extended abstract -- Different modifications of pointer machines and their computational power. 330 $aThis volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v520 606 $aComputers 606 $aSoftware engineering 606 $aArchitecture, Computer 606 $aAlgorithms 606 $aComputer logic 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 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 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aArchitecture, Computer. 615 0$aAlgorithms. 615 0$aComputer logic. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aComputer System Implementation. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 676 $a004.0151 700 $aTarlecki$b Andrzej$4aut$4http://id.loc.gov/vocabulary/relators/aut$01221270 906 $aBOOK 912 $a996465668503316 996 $aMathematical Foundations of Computer Science 1991$92832032 997 $aUNISA