03965nmm a2200409 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100002200139245019000161250001700351260006300368300003100431505052200462505063800984505049501622653002602117653002502143653002702168653001502195653005902210653001402269653003602283653003602319653003502355653004602390653001902436710003402455041001902489989003802508490003802546856006802584082001302652520089002665EB000657961EBX0100000000000000051104300000000000000.0cr|||||||||||||||||||||140122 ||| eng a97835404757981 aTarlecki, Andrzej00aMathematical Foundations of Computer Science 1991hElektronische Ressourceb16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedingscby Andrzej Tarlecki a1st ed. 1991 aBerlin, HeidelbergbSpringer Berlin Heidelbergc1991, 1991 aXI, 437 pbonline resource0 aSyntax 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 power0 aA 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 -- 0 aa 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 -- aTheory of Computation aSoftware engineering aArchitecture, Computer aAlgorithms aSoftware Engineering/Programming and Operating Systems aComputers aLogics and Meanings of Programs aComputation by Abstract Devices aComputer System Implementation aAlgorithm Analysis and Problem Complexity aComputer logic2 aSpringerLink (Online service)07aeng2ISO 639-2 bSBAaSpringer Book Archives -20040 aLecture Notes in Computer Science uhttps://doi.org/10.1007/3-540-54345-7?nosfx=yxVerlag3Volltext0 a004.0151 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