Advertisement

Table of contents

  1. Front Matter
  2. Habib Abdulrab, Jean-Pierre Pécuchet
    Pages 1-12
  3. Carme Àlvarez, Josep Díaz, Jacobo Torán
    Pages 13-24
  4. Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young
    Pages 35-46
  5. Stephen L. Bloom
    Pages 47-57
  6. Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth
    Pages 58-67
  7. J. A. Brzozowski, J. C. Ebergen
    Pages 78-94
  8. Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
    Pages 95-104
  9. Jean-Luc Coquidé, Max Dauchet, Sophie Tison
    Pages 105-115
  10. Pierluigi Crescenzi, Alessandro Panconesi
    Pages 116-126
  11. P. Dömösi, Z. Ésik, B. Imreh
    Pages 137-144
  12. P. Ďuriš, P. Pudlák
    Pages 145-147
  13. Joost Engelfriet
    Pages 148-161
  14. J. Françon, B. Randrianarimanana, R. Schott
    Pages 162-174
  15. Z. Fülöp, S. Vágvölgyi
    Pages 175-184
  16. Dominique Geniet, Loÿs Thimonier
    Pages 185-196
  17. Bernd Graw
    Pages 209-223
  18. Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
    Pages 234-243
  19. Neil Immerman
    Pages 244-245
  20. Matthias Krause, Stephan Waack
    Pages 287-296
  21. Maciej Liśkiewicz, Krzysztof Loryś
    Pages 297-307
  22. A. Marchetti-Spaccamela, M. Protasi
    Pages 327-338
  23. M. A. Nait Abdallah
    Pages 339-348
  24. M. A. Nait Abdallah
    Pages 349-361
  25. Frederick Springsteel, Ivan Stojmenović
    Pages 424-433
  26. Ludwig Staiger
    Pages 434-443
  27. György Turán
    Pages 460-469

About these proceedings

Introduction

This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections: - Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing; - Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming; - Formal Languages: Rewriting Systems, Algebraic Language Theory; - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds.

Keywords

RP Turing machine algorithms automata calculus complexity computability formal language formal languages grammars logic petri net program transformation semantics turing degree

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-51498-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 1989
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-51498-5
  • Online ISBN 978-3-540-48180-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site