000 06258cam a2200577 a 4500
001 ocn321342054
003 OCoLC
005 20250703150156.0
006 m o d
007 cr unu||||||||
008 970915s1997 enka ob 101 0 eng d
040 _aSCPER
_beng
_epn
_cCUSER
_dDKDLA
_dOCLCO
_dUKMGB
_dOCLCQ
_dOCLCO
_dOCLCQ
_dGW5XE
_dOCLCF
_dOCLCO
_dOCL
_dOCLCO
_dOCLCQ
_dWYU
_dTFW
_dESU
_dOCLCQ
_dOCLCO
_dOCLCQ
_dOCLCO
_dOCLCQ
016 7 _a011013954
_2Uk
019 _a771194205
020 _a9783540695479
_q(electronic bk.)
020 _a3540695478
_q(electronic bk.)
020 _a3540634371
020 _a9783540634379
020 _z3540634371
020 _z9783540634379
024 3 _a9783540634379
029 1 _aNZ1
_b15299689
035 _a(OCoLC)321342054
_z(OCoLC)771194205
037 _a3540634371
_b00024965
050 4 _aQA76.9.M35
_bM387 1997
082 0 4 _a004.0151
_221
049 _aMAIN
111 2 _aSymposium on Mathematical Foundations of Computer Science (1972- )
_d(1997 :
_cBratislava, Slovakia)
_933178
245 1 0 _aMathematical foundations of computer science 1997 :
_b22nd International Symposium, MFCS '97, Bratislava, Slovakia, August 25-29, 1997 : proceedings /
_cIgor Prívara, Peter Ružička (eds.).
260 _aBerlin ;
_aLondon :
_bSpringer,
_c©1997.
300 _a1 online resource (x, 517 pages) :
_billustrations
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aLecture notes in computer science,
_x0302-9743 ;
_v1295
504 _aIncludes bibliographical references and index.
588 0 _aPrint version record.
520 _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.
505 0 _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.
650 0 _aComputer science
_xMathematics
_vCongresses.
_915039
650 6 _aInformatique
_xMathématiques
_vCongrès.
_920905
650 7 _aComputer science
_xMathematics
_2fast
_92386
655 7 _aConference papers and proceedings
_2fast
_96065
700 1 _aPrívara, Igor.
_933179
700 1 _aRužička, Peter.
_921383
776 0 8 _iPrint version:
_aSymposium on Mathematical Foundations of Computer Science (1972- ) (1997 : Bratislava, Slovakia).
_tMathematical foundations of computer science 1997.
_dBerlin ; London : Springer, ©1997
_w(OCoLC)37726063
830 0 _aLecture notes in computer science ;
_v1295.
_x0302-9743
856 4 0 _uhttps://link.springer.com/10.1007/BFb0029943
936 _aBATCHLOAD
994 _a92
_bATIST
999 _c638717
_d638717