Mathematical Foundations of Computer Science 1997 - Paperback

EAN (ISBN-13): 9783540634379
ISBN (ISBN-10): 3540634371
Hardcover
Paperback
Publishing year: 1997
Publisher: Springer Berlin Heidelberg
536 Pages
Weight: 0,801 kg
Language: eng/Englisch

Book in our database since 2007-10-23T10:28:01-04:00 (New York)
Detail page last modified on 2024-02-22T12:55:26-05:00 (New York)
ISBN/EAN: 3540634371

ISBN - alternate spelling:
3-540-63437-1, 978-3-540-63437-9
Alternate spelling and related search-keywords:
Book author: ruzicka peter, slovakia, van leeuwen, held peter
Book title: mfc, symposium, international 1997, bratislava, mathematical foundations computer science, foundation, august, the mathematical foundations, the new slovakia, slovakia then and now, mfcs

---

Information from Publisher

Author: Igor Privara; Peter Ruzicka
Title: Lecture Notes in Computer Science; Mathematical Foundations of Computer Science 1997 - 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings
Publisher: Springer; Springer Berlin
526 Pages
Publishing year: 1997-08-13
Berlin; Heidelberg; DE
Language: English
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 526 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithms; complexity; complexity theory; computer; computer science; formal language; formal languages; logic; mathematical logic; programming; Theory of Computation; Compilers and Interpreters; Software Engineering; Discrete Mathematics in Computer Science; Compiler und Übersetzer; Software Engineering; Mathematik für Informatiker; Diskrete Mathematik; EA

Game 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 topologicalgeneralization 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.