Fundamentals of Computation Theory
Springer Berlin (Verlag)
978-3-540-60249-1 (ISBN)
The volume contains five invited lectures and 32 revised papers carefully selected for presentation at FCT '95. A broad spectrum of theoretical computer science is covered; among topics addressed are algorithms and data structures, automata and formal languages, categories and types, computability and complexity, computational logics, computational geometry, systems specification, learning theory, parallelism and concurrency, rewriting and high-level replacement systems, and semantics.
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.
| Erscheint lt. Verlag | 16.8.1995 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XI, 441 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 640 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik | |
| Schlagworte | algorithm • Algorithm analysis and problem complexity • Algorithmentheorie • Algorithmische Logik • algorithms • Automat • Automata • combinatorics • Complexity • Computability • Computational Logics • data structure • data structures • Datenstrukturen • formal language • Informatik • Parallelism • Parallelität • Semantics • Systemspezifikation • Systems Specification • Theory of Algorithms |
| ISBN-10 | 3-540-60249-6 / 3540602496 |
| ISBN-13 | 978-3-540-60249-1 / 9783540602491 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
