Table of contents

  1. Front Matter
  2. J. C. M. Baeten, J. A. Bergstra
    Pages 1-15
  3. Zhou Chaochen, Dang Van Hung, Li Xiaoshan
    Pages 16-41
  4. Kathleen Fisher, John C. Mitchell
    Pages 42-61
  5. Kim G. Larsen, Paul Pettersson, Wang Yi
    Pages 62-88
  6. Roberto M. Amadio, Lone Leth, Bent Thomsen
    Pages 106-115
  7. Valentin Antimirov
    Pages 116-125
  8. J. A. Bergstra, Gh. Ştefaonescu
    Pages 136-145
  9. Michael Bertol
    Pages 146-155
  10. Cristian Calude, Marius Zimand
    Pages 156-170
  11. Thomas Chaboud
    Pages 171-180
  12. Victor D. Chepoi, Feodor F. Dragan
    Pages 181-190
  13. Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Pages 191-200
  14. Feodor F. Dragan, Falk Nicolai
    Pages 201-210
  15. Bruno Durand, Jacques Mazoyer
    Pages 211-220
  16. M. C. F. Ferreira, H. Zantema
    Pages 243-252

About these proceedings

Introduction

This 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.

Keywords

Algorithms Automat algorithm automata complexity computability data structure formal language semantics

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-60249-6
  • Copyright Information Springer-Verlag 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60249-1
  • Online ISBN 978-3-540-44770-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book