Mathematical Foundations of Computer Science 1992 de Ivan M. Havel

Mathematical Foundations of Computer Science 1992: 17th International Symposium, Prague, Czechoslovakia, August 24-28, 1992. Proceedings: Lecture Notes in Computer Science, cartea 629

Ivan M. Havel

Vaclav Koubek

en Limba Engleză Paperback – 12 aug 1992

This volume contains 10 invited papers and 40 shortcommunications contributed for presentation at the 17thSymposium on Mathematical Foundations of Computer Science,held in Prague, Czechoslovakia, August 24-28, 1992.The series of MFCS symposia, organized alternately in Polandand Czechoslovakia since 1972, has a long and wellestablished tradition. The purpose of the series is toencourage high-quality research in all branches oftheoretical computer science and to bring togetherspecialists working actively in the area.Numerous topics are covered in this volume. The invitedpapers cover: range searching with semialgebraic sets, graphlayout problems, parallel recognition and ranking ofcontext-free languages, expansion of combinatorialpolytopes, neural networks and complexity theory, theory ofcomputation over stream algebras, methods in parallelalgorithms, the complexity of small descriptions, weakparallel machines, and the complexity of graph connectivity.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 426^.75 lei
20%

Preț: 315^.62 lei
20%

Preț: 320^.92 lei
15%

Preț: 426^.53 lei
20%

Preț: 313^.87 lei
20%

Preț: 355^.79 lei
20%

Preț: 355^.54 lei
20%

Preț: 355^.18 lei
20%

Preț: 390^.68 lei
20%

Preț: 392^.03 lei
20%

Preț: 498^.95 lei
20%

Preț: 390^.79 lei
20%

Preț: 495^.44 lei
20%

Preț: 498^.80 lei
20%

Preț: 498^.50 lei
20%

Preț: 355^.93 lei
20%

Preț: 639^.52 lei
20%

Preț: 499^.90 lei
20%

Preț: 498^.95 lei
20%

Preț: 390^.42 lei
20%

Preț: 326^.81 lei
20%

Preț: 391^.36 lei
20%

Preț: 321^.68 lei
20%

Preț: 498^.90 lei
20%

Preț: 312^.82 lei
20%

Preț: 496^.73 lei
20%

Preț: 320^.72 lei
20%

Preț: 497^.25 lei
15%

Preț: 496^.40 lei
20%

Preț: 324^.19 lei
20%

Preț: 498^.80 lei
20%

Preț: 461^.86 lei
20%

Preț: 355^.59 lei
Preț: 418^.19 lei
20%

Preț: 498^.59 lei
20%

Preț: 391^.28 lei
20%

Preț: 355^.69 lei
15%

Preț: 499^.72 lei
20%

Preț: 499^.40 lei
20%

Preț: 458^.84 lei
20%

Preț: 390^.42 lei
20%

Preț: 270^.68 lei
20%

Preț: 497^.75 lei
20%

Preț: 423^.78 lei
20%

Preț: 322^.32 lei
20%

Preț: 322^.09 lei
20%

Preț: 427^.09 lei
20%

Preț: 499^.90 lei
20%

Preț: 463^.03 lei

Cuprins

On range searching with semialgebraic sets.- Graph layout problems.- Parallel recognition and ranking of context-free languages.- On the expansion of combinatorial polytopes.- Neural networks and complexity theory.- Theory of computation over stream algebras, and its applications.- Methods in parallel algorithmcs.- On the complexity of small description and related topics.- Weak parallel machines: A new class of physically feasible parallel machine models.- The complexity of graph connectivity.- A perfect parallel dictionary.- Some remarks on the test complexity of iterative logic arrays.- The degree structure of 1-L reductions.- Promise problems and access to unambiguous computation.- On the complexity of incremental computation.- Rational transductions and complexity of counting problems.- Negation elimination in equational formulae.- Object interaction.- Strong normalization of substitutions.- Probabilistic and pluralistic learners with mind changes.- Parallel complexity of iterated morphisms and the arithmetic of small numbers.- On computational power of weighted finite automata.- The shuffle exchange network has a Hamiltonian path.- Poset properties of complex traces.- A threshold for unsatisfiability.- Dataflow semantics for Petri nets.- About boundedness for some datalog and DATALOGneg programs.- Merging and sorting strings in parallel.- Characterization of context-pree languages by erasing automata.- Insertion and deletion of words: Determinism and reversibility.- Small universal one-state linear operator algorithm.- Mobility in the CC-paradigm.- The emptiness problem for intersections of regular languages.- On finite automata with limited nondeterminism (extended abstract).- Definitions and comparisons of local computations on graphs.- Efficient unidimensionaluniversal cellular automaton.- Inferring a tree from walks.- Almost every set in exponential time is P-bi-immune.- A functorial semantics for observed concurrency.- Modelling concurrency with semi-commutations.- Decision problems for cellular automata and their semigroups.- On the nature of events.- New parallel algorithms for convex hull and triangulation in 3-dimensional space.- Two simple characterizations of well-founded semantics.- Fully abstract semantics for higher order communicating systems.- Superposable Trellis Automata.- Maintaining proximity in higher dimensional spaces.- Characterizing regular languages with polynomial densities.- A strategy for speeding-up the computation of characteristic sets.- One-rule trace-rewriting systems and confluence.