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

About these proceedings

Introduction

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.

Keywords

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

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-57163-9
  • Copyright Information Springer-Verlag 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
  • About this book