Table of contents

  1. Front Matter
  2. H. Jürgensen, S. Konstantinidis
    Pages 50-68
  3. P. Pudlák
    Pages 106-120
  4. Habib Abdulrab, Marianne Maksimenko
    Pages 133-141
  5. J. A. Bergstra, Gh. Ştefanescu
    Pages 152-161
  6. Virgil Emil Căzănescu
    Pages 162-170
  7. Piotr Chrzastowski-Wachtel, Marek Raczunas
    Pages 171-180
  8. P. Dömösi, S. Horváth, M. Ito, L. Kászonyi, M. Katsura
    Pages 194-203
  9. Jürgen Ebert
    Pages 212-221
  10. Paul Fischer
    Pages 234-243
  11. Paul Fischer, Klaus -U. Höffgen, Hanno Lefmann, Tomasz Luczak
    Pages 244-255
  12. Torben Hagerup, Martin Maas
    Pages 279-288
  13. Lane A. Hemachandra, Riccardo Silvestri
    Pages 289-298
  14. Markus Holzer, Klaus -Jörn Lange
    Pages 299-308
  15. Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger
    Pages 319-328
  16. Ernest G. Manes
    Pages 363-374
  17. Alexandru Mateescu
    Pages 386-395
  18. Andreas Potthoff, Wolfgang Thomas
    Pages 396-405
  19. Zsuzsanna Röka
    Pages 406-417
  20. P. Ružička, I. Prívara
    Pages 418-429
  21. Kai Salomaa, Derick Wood, Sheng Yu
    Pages 430-439
  22. Giora Slutzki, Sándor Vágvölgyi
    Pages 440-451
  23. Hongzhong Wu, G. Hotz
    Pages 452-461
  24. Jilei Yin, Zhu Hong
    Pages 462-471
  25. Back Matter

About these proceedings


This volume contains the proceedings of the Ninth Conference on Fundamentalsof Computation Theory (FCT 93) held in Szeged, Hungary, in August 1993. The conference was devoted to a broad range of topics including: - Semanticsand logical concepts in the theory of computing and formal specification - Automata and formal languages - Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts) - Algorithms (efficient, probabilistic, parallel, sequential, distributed) - Counting and combinatorics in connection with mathematical computer science The volume contains the texts of 8 invitedlectures and 32 short communications selected by the international program committee from a large number of submitted papers.


Automat algorithm algorithms automata complexity distributed computing formal language formal specification semantics

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-57163-6
  • Online ISBN 978-3-540-47923-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site