05655nam a22005055i 4500001001800000003000900018005001700027007001500044008004100059020001800100024002800118050001700146072001500163072001600178072002300194072002300217082001700240245022200257264006100479300003200540336002600572337002600598338003600624347002400660490005800684505324700742520058703989650002204576650002604598650005004624650001504674650003504689650002204724650002704746650005204773650002604825650004604851700003004897700003304927710003404960773002004994776003605014830005805050856004105108978-3-540-69547-9DE-He21320170515111448.0cr nn 008mamaa121227s1997 gw | s |||| 0|eng d a97835406954797 a10.1007/BFb00299432doi 4aQA75.5-76.95 7aUY2bicssc 7aUYA2bicssc 7aCOM0140002bisacsh 7aCOM0310002bisacsh04a004.015122310aMathematical Foundations of Computer Science 1997h[electronic resource] :b22nd International Symposium, MFCS '97 Bratislava, Slovakia, August 25–29, 1997 Proceedings /cedited by Igor Prívara, Peter Ružička. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1997. aX, 526 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v12950 aGame semantics for programming languages -- Communication complexity -- Treewidth: Algorithmic techniques and results -- When are two rewrite systems more than none? -- Positive applications of lattices to cryptography -- A tile-based coordination view of asynchronous ?-calculus -- Communication complexity and sequential computation -- Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus -- Computational limitations of Stochastic Turing machines and Arthur-Merlin games with small space bounds -- Learning to perform knowledge-intensive inferences -- Resolution proofs, exponential bounds, and Kolmogorov complexity -- The expressiveness of Datalog cicuits (DAC) -- The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes -- A category of transition systems and its relations with orthomodular posets -- Accepting Zeno words without making time stand still -- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams -- Specifying computations using hyper transition systems -- A shift-invariant metric on S zz inducing a non-trivial topology -- Subtyping calculus of construction (extended abstract) -- Distances between languages and reflexivity of relations -- Partial characterization of synchronization languages -- Integrating the specification techniques of graph transformation and temporal logic -- On the generation of trees by hyperedge replacement -- Regulation by valences -- Simulation as a correct transformation of rewrite systems -- On the dilation of interval routing -- Relating conflict-free stable transition and event models (extended abstract) -- The giant component threshold for random regular graphs with edge faults -- A topological generalization of propositional linear time temporal logic -- Multi-head finite automata: Data-independent versus data-dependent computations -- Complexity of finding short resolution proofs -- On P versus NP?co-NP for decision trees and read-once branching programs -- A characterization of abstract families of algebraic power series -- Repetitiveness of D0L-languages is decidable in polynomial time -- Minimal letter frequency in n-th power-free binary words -- Real-time generation of primes by a one-dimensional cellular automaton with 11 states -- Optimal algorithms for complete linkage clustering in d dimensions -- Invertible linear cellular automata over Zm: Algorithmic and dynamical aspects -- Two-level contextual grammars: The internal case -- Counting problems over the reals -- On the influence of the state encoding on OBDD-representations of finite state machines -- Decomposition of TrPTL formulas -- NP-hard sets have many hard instances -- Deciding verbose languages with linear advice -- Homomorphic images of sentential forms and terminating grammars (extended abstract) -- Simplification orders for term graph rewriting -- Dependency-based action refinement -- A hierarchy for (1, +k)-branching programs with respect to k -- Routing with finite speeds of memory and network -- Queries and algorithms computable by polynomial time existential reflective machines -- Partial order semantics and read arcs. aThis book constitutes the refereed proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS '97, held in Bratislava, Slovakia, in August 1997. The 40 revised full papers presented were carefully selected from a total of 94 submissions. Also included are nine invited papers and two abstracts of invited talks. The papers cover the whole range of theoretical computer science including programming theory, complexity theory, mathematical logic, rewriting, grammars, formal languages, theory of algorithms, computational graph theory, etc. 0aComputer science. 0aSoftware engineering. 0aProgramming languages (Electronic computers). 0aComputers. 0aComputer sciencexMathematics.14aComputer Science.24aTheory of Computation.24aProgramming Languages, Compilers, Interpreters.24aSoftware Engineering.24aDiscrete Mathematics in Computer Science.1 aPrívara, Igor.eeditor.1 aRužička, Peter.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540634379 0aLecture Notes in Computer Science,x0302-9743 ;v129540uhttp://dx.doi.org/10.1007/BFb0029943