000 05856nam a22005535i 4500
001 978-3-540-48176-8
003 DE-He213
005 20160624102030.0
007 cr nn 008mamaa
008 121227s1989 gw | s |||| 0|eng d
020 _a9783540481768
_9978-3-540-48176-8
024 7 _a10.1007/3-540-51486-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aMathematical Foundations of Computer Science 1989
_h[electronic resource] :
_bPorabka-Kozubnik, Poland August 28 – September 1, 1989 Proceedings /
_cedited by Antoni Kreczmar, Grazyna Mirkowska.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
300 _aX, 610 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v379
505 0 _aFrom specification languages to specification knowledge bases: The PTO approach -- Monadic second-order logic and context-free graph-grammars -- A thesis for bounded concurrency -- Space bounded computations : Review and new separation results -- Concurrent nondeterministic processes: Adequacy of structure and behaviour -- LEDA a library of efficient data types and algorithms -- Correctness of concurrent processes -- Understanding nets -- On the strength of temporal proofs -- Proof-theoretic characterisations of logic programming -- Algebraically closed theories -- Control flow versus logic: A denotational and a declarative model for Guarded Horn Clauses -- Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A constructive glimpse -- Parallel complexity of lexicographically first problems for tree-structured graphs -- On the power of synchronization in parallel computations -- Optimal parallel algorithms for the recognition and colouring outerplanar graphs -- Logical characterizations of nonmonotonic TMSs -- Proving correctness of constructor implementations -- Equivalence notions for concurrent systems and refinement of actions -- System simulation and the sensitivity of self-stabilization -- Polynomial-time functions generate SAT: On P-splinters -- Generalized definite tree languages -- Pinwheel scheduling with two distinct numbers -- Testing approximate symmetry in the plane is NP-hard -- Memory and algebra -- Integer relations among algebraic numbers -- An iterative metric fully abstract semantics for nondeterministic dataflow (extended abstract) -- Complexity of decision problems under incomplete information -- On the nature of TELLUS -- Switching graphs and their complexity -- Pomset semantics for true concurrency with synchronization and recursion -- Oracle branching programs and Logspace versus P -- Generalizing singly-linked list reorganizing heuristics for doubly-linked lists -- Area complexity of merging -- Logically defined subsets of IN k -- An extended Herbrand theorem for first-order theories with equality interpreted in partial algebras -- Characterization of recognizable trace languages by distributed automata -- Knuth-Morris-Pratt algorithm: An analysis -- Pushdown automata on infinite trees and omega-Kleene closure of context-free tree sets -- An imperative type hierarchy with partial products -- A coloring algorithm for interval graphs -- Finite constants: Characterizations of a new decidable set of constants -- Optimal data flow analysis via observational equivalence -- One more method for proving lower bounds on the formula complexity of boolean functions -- The Hoare-like verification system for a language with an exception handling mechanism -- On the lengths of values in a finite transducer -- On varieties of languages closed under products with counter -- On the computational efficiency of symmetric neural networks -- Constructive aspects of the omega-rule : Application to proof systems in computer science and algorithmic logic -- How to define functionals on free structures in typed ? calculus -- Concurrency, modularity, and synchronization -- On comparing probabilistic and deterministic automata complexity of languages.
520 _aThe present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS '89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989. Previous MFCs proceedings have also been published in the Lecture Notes in Computer Science. This volume presents investigations and results in theoretical computer science, in particular in the following areas: logics of programs, parallel and distributed computing, deductive databases, automata and formal languages, algorithms and data structures, software specification and validity, complexity and computability theory.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aLogic design.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aCombinatorics.
700 1 _aKreczmar, Antoni.
_eeditor.
700 1 _aMirkowska, Grazyna.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540514862
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v379
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-51486-4
942 _2EBK6347
_cEBK
999 _c35641
_d35641