## Fundamentals of Computation Theory: 10th International Conference, FCT '95, Dresden, Germany, August 22 - 25, 1995. ProceedingsThis book presents the proceedings of the 10th International Conference on Fundamentals of Computation Theory, FCT '95, held in Dresden, Germany in August 1995. 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

I | 1 |

II | 16 |

III | 42 |

IV | 62 |

V | 89 |

VI | 106 |

VII | 116 |

VIII | 126 |

XX | 253 |

XXI | 263 |

XXII | 273 |

XXIII | 283 |

XXIV | 293 |

XXV | 303 |

XXVI | 313 |

XXVII | 323 |

IX | 136 |

X | 146 |

XI | 156 |

XII | 171 |

XIII | 181 |

XIV | 191 |

XV | 201 |

XVI | 211 |

XVII | 221 |

XVIII | 233 |

XIX | 243 |

XXVIII | 333 |

XXIX | 343 |

XXX | 353 |

XXXI | 363 |

XXXII | 374 |

XXXIII | 383 |

XXXIV | 393 |

XXXV | 404 |

XXXVI | 414 |

XXXVII | 424 |

### Other editions - View all

Fundamentals of Computation Theory: 10th International Conference, FCT '95 ... Horst Reichel No preview available - 1995 |

Fundamentals of Computation Theory: 10th International Conference, FCT '95 ... Horst Reichel No preview available - 2014 |

### Common terms and phrases

abstract accepted actions algebra algorithm alphabet applied arrow associated assume automata automaton axioms basic bounded calculus called cell clock communication complexity composition computation configuration consider consists constant construction contains corresponding defined definition denote derivation described diagrams distance edge equations equivalent evaluation example exists expression extended fact finite formal formula function give given graph includes infinite initial input interval introduced labelled language Lemma length logic machines means method monoids multiset natural nets nodes Note notion object obtained occur operation pair parallel partial path Petri polynomial present problem proof properties prove recursive reduction regular relation represented respectively result rules satisfies semantics simple sort space specification step structure symbol synchronization Table term Theorem theory transformation transition tree variables vertex vertices