Fundamentals of computation theory : 10th international conference ; proceedings / FCT '95, Dresden, Germany, August 22 - 25, 1995. Horst Reichel (ed.) / Lecture notes in computer science ; Vol. 965 - Livres de poche

EAN (ISBN-13): 9783540602491
ISBN (ISBN-10): 3540602496
Version reliée
Livre de poche
Date de parution: 1995
Editeur: Springer Berlin Heidelberg
433 Pages
Poids: 0,678 kg

Livre dans la base de données depuis 2007-07-10T11:54:24+02:00 (Zurich)
Page de détail modifiée en dernier sur 2024-02-13T15:43:16+01:00 (Zurich)
ISBN/EAN: 3540602496

ISBN - Autres types d'écriture:
3-540-60249-6, 978-3-540-60249-1
Autres types d'écriture et termes associés:
Auteur du livre: reichel, horst horst
Titre du livre: 10th august, dam 1995, may dresden, fundamentals computation theory, dresden fuß, lecture notes computer science, therapieren, reichel

---

Données de l'éditeur

Auteur: Horst Reichel
Titre: Lecture Notes in Computer Science; Fundamentals of Computation Theory - 10th International Conference, FCT '95, Dresden, Germany, August 22 - 25, 1995. Proceedings
Editeur: Springer; Springer Berlin
441 Pages
Date de parution: 1995-08-16
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XI, 441 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Automat; algorithm; automata; complexity; computability; data structure; formal language; semantics; algorithm analysis and problem complexity; combinatorics; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Discrete Mathematics; Algorithmen und Datenstrukturen; Diskrete Mathematik; EA

Discrete time process algebra with abstraction.- A duration calculus with infinite intervals.- A delegation-based object calculus with subtyping.- Model-checking for real-time systems.- On polynomial ideals, their complexity, and applications.- From a concurrent ?-calculus to the ?-calculus.- Rewriting regular inequalities.- A simple abstract semantics for equational theories.- Processes with multiple entries and exits.- Efficient rewriting in cograph trace monoids.- Effective category and measure in abstract complexity theory.- About planar cayley graphs.- On condorcet and median points of simple rectilinear polygons.- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs.- r-Domination problems on homogeneously orderable graphs.- Growing patterns in 1D cellular automata.- Petri nets, commutative context-free grammars, and basic parallel processes.- Implementation of a UU-algorithm for primitive recursive tree functions.- Dummy elimination: Making termination easier.- Computing Petri net languages by reductions.- Categorial graphs.- Effective systolic algorithms for gossiping in cycles and two-dimensional grids.- Restarting automata.- Optimal contiguous expression DAG evaluations.- Communication as unification in the Petri Box Calculus.- Distributed catenation and chomsky hierarchy.- The power of frequency computation.- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space.- Properties of probabilistic pushdown automata.- Formal parametric equations.- PRAM's towards realistic parallelism: BRAM's.- Some results concerning two-dimensional turing machines and finite automata.- How hard is to compute the edit distance.- On the synchronization of semi-traces.- Tiling with bars and satisfaction of boolean formulas.-Axiomatizing Petri net concatenable processes.- Functional sorts in data type specifications.