LEADER 07716nam 22007455 450 001 996465880203316 005 20200706045221.0 010 $a3-540-47927-9 024 7 $a10.1007/3-540-57182-5 035 $a(CKB)1000000000234005 035 $a(SSID)ssj0000324663 035 $a(PQKBManifestationID)11245125 035 $a(PQKBTitleCode)TC0000324663 035 $a(PQKBWorkID)10320412 035 $a(PQKB)11049730 035 $a(DE-He213)978-3-540-47927-7 035 $a(PPN)155175335 035 $a(EXLCZ)991000000000234005 100 $a20121227d1993 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aMathematical Foundations of Computer Science 1993$b[electronic resource] $e18th International Symposium, MFCS?93, Gda?sk, Poland, August 30?September 3, 1993 Proceedings /$fedited by Andrzej M. Borzyszkowski, Stefan Sokolowski 205 $a1st ed. 1993. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1993. 215 $a1 online resource (XIII, 786 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v711 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57182-5 327 $aOn the unification free prolog programs -- Equivalences and preorders of transition systems -- Deliverables: a categorical approach to program development in type theory -- Complex and complex-like traces -- Symbolic bisimulations (abstract) -- Some results on the full abstraction problem for restricted lambda calculi -- Action calculi, or syntactic action structures -- Observable properties of higher order functions that dynamically create local names, or: What's new? -- The second calculus of binary relations -- An introduction to dynamic labeled 2-structures -- Post Correspondence Problem: Primitivity and interrelations with complexity classes -- A taste of linear logic -- On the tree inclusion problem -- On the adequacy of per models -- Hausdorff reductions to sparse sets and to sets of high information content -- Stores as homomorphisms and their transformations -- Comparative semantics for linear arrays of communicating processes -- Rabin tree automata and finite monoids -- Efficient type reconstruction in the presence of inheritance -- A characterization of Sturmian morphisms -- On the complexity of scheduling incompatible jobs with unit-times -- Isomorphisms between predicate and state transformers -- On the amount of nondeterminism and the power of verifying -- Observing distribution in processes -- Speedup of recognizable trace languages -- May I borrow your logic? -- Approximate and exact deterministic parallel selection -- Defining soft sortedness by abstract interpretation -- A model for real-time process algebras (extended abstract) -- Data encapsulation and modularity: Three views of inheritance -- Image compression using Weighted Finite Automata -- Filter models for a parallel and non deterministic ?-calculus -- Real number computability and domain theory -- Lambda substitution algebras -- Global properties of 2D cellular automata: some complexity results -- Completeness results for linear logic on Petri nets -- An expressive logic for Basic Process Algebra -- The complexity of finding replicas using equality tests -- A complete axiomatization for branching bisimulation congruence of finite-state behaviours -- Object Oriented application flow graphs and their semantics -- Some hierarchies for the communication complexity measures of cooperating grammar systems -- Efficient parallel graph algorithms based on open ear decomposition -- On the communication complexity of parallel computation -- A taxonomy of forgetting automata -- Hybrid parallel programming and implementation of synchronised communication -- Proof systems for cause based equivalences -- A uniform universal CREW PRAM -- Observing located concurrency -- The boundary of substitution systems -- New algorithms for detecting morphic images of a word -- Ignoring nonessential interleavings in assertional reasoning on concurrent programs -- Constant time reductions in ?-calculus -- Heterogeneous unified algebras -- A representation theorem for lambda abstraction algebras -- On saturated calculi for a linear temporal logic -- The snack powerdomain for database semantics -- Verifying properties of module construction in type theory -- On time-space trade-offs in dynamic graph pebbling -- Deterministic behavioural models for concurrency -- Real-time refinement: Semantics and application -- Deciding testing equivalence for real-time processes with dense time -- A calculus for higher order procedures with global variables -- Variable substitution with iconic combinators -- Feature constraints with first-class features -- Between Min Cut and Graph Bisection -- Paths and cycles in finite periodic graphs -- Learning decision lists from noisy examples -- Analytic tableaux for finite and infinite Post logics. 330 $aThis volume contains the proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, MFCS '93, held in Gdansk, Poland, August-September 1993. The MFCS symposia, organized annually in Poland and the former Czechoslovakia since 1972, have a long and well-established tradition. Over the years they have served as a meeting ground for specialists from all branches of theoretical computer science, in particular - algorithms and complexity, automata theory and theory of languages, - concurrent, distributed and real-time systems, - the theory of functional, logic and object-oriented programming, - lambda calculus and type theory, - semantics and logics of programs, and others. The volume contains 12 invitedlectures and 56 contributed papers selected from 133 submissions. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v711 606 $aApplied mathematics 606 $aEngineering mathematics 606 $aSoftware engineering 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aApplications of Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M13003 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 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$aApplied mathematics. 615 0$aEngineering mathematics. 615 0$aSoftware engineering. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 14$aApplications of Mathematics. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 676 $a519 702 $aBorzyszkowski$b Andrzej M$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSokolowski$b Stefan$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465880203316 996 $aMathematical foundations of computer science 1993$91381940 997 $aUNISA