Table of contents

  1. Front Matter
  2. Howard Straubing
    Pages 15-24
  3. M. P. Schützenberger
    Pages 25-33
  4. Jean-Camille Birget
    Pages 56-64
  5. Imre Simon
    Pages 65-72
  6. John Meakin
    Pages 89-103
  7. Wolfgang Thomas
    Pages 104-119
  8. Pascal Weil
    Pages 120-137
  9. Aldo de Luca, Stefano Varricchio
    Pages 138-147
  10. Jorge Almeida
    Pages 148-164
  11. Maxime Crochemore
    Pages 165-175
  12. G. Rauzy
    Pages 176-185
  13. Antonio Restivo
    Pages 186-198
  14. Howard Straubing, Denis Thérien
    Pages 199-233
  15. Back Matter

About these proceedings

Introduction

The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections with logic and word problems. The last part presents a large variety of possible applications: number theory, distributed systems, algorithms on strings, theory of codes, complexity of boolean circuits and others.

Keywords

Algorithms Automat algorithm automata complexity distributed systems logic

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0013106
  • Copyright Information Springer-Verlag 1989
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-51631-6
  • Online ISBN 978-3-540-46721-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Telecommunications
Oil, Gas & Geosciences