Advertisement

Jewels are Forever

Contributions on Theoretical Computer Science in Honor of Arto Salomaa

  • Juhani Karhumäki
  • Hermann Maurer
  • Gheorghe Păun
  • Grzegorz Rozenberg

Table of contents

  1. Front Matter
    Pages I-XXX
  2. Automata I: Finite State Machines

    1. Front Matter
      Pages 1-1
    2. Janusz A. Brzozowski, Helmut Jürgensen
      Pages 3-15
    3. Dora Giammarresi, Jean-Luc Ponty, Derick Wood
      Pages 16-24
    4. Balázs Imreh, Masami Ito
      Pages 25-34
    5. Michel Latteux, Yves Roos
      Pages 35-44
  3. Automata II: More General Devices

    1. Front Matter
      Pages 57-57
    2. Christian Choffrut, Serge Grigorieff
      Pages 59-71
    3. Joost Engelfriet, Hendrik Jan Hoogeboom
      Pages 72-83
    4. Oscar H. Ibarra, Jianwen Su
      Pages 84-96
    5. Juhani Karhumäki, Leonid P. Lisovik
      Pages 97-108
    6. Wolfgang Thomas
      Pages 109-120
  4. Automata with Multiplicities

    1. Front Matter
      Pages 121-121
    2. Vesa Halava, Tero Harju
      Pages 123-134
    3. Werner Kuich
      Pages 145-156
    4. Giovanna Melideo, Cesidia Pasquarelli, Stefano Varricchio
      Pages 157-168
  5. Formal Languages

    1. Front Matter
      Pages 169-169
    2. Jürgen Dassow
      Pages 171-181
    3. Vincenzo Manca, Carlos Martin-Vide, Gheorghe Päun
      Pages 182-193
    4. Solomon Marcus
      Pages 194-203
    5. Robert McNaughton
      Pages 204-212
    6. Taishin Yasunobu Nishida
      Pages 213-221
  6. Algorithms and Complexity

    1. Front Matter
      Pages 223-223
    2. Cristian S. Calude, Richard J. Coles
      Pages 225-237
    3. Tao Jiang, Ming Li, Paul Vitányi
      Pages 250-261
    4. Wojciech Plandowski, Wojciech Rytter
      Pages 262-272
    5. Soldea Octavian, Azaria Paz
      Pages 273-284
  7. Combinatorics of Words

    1. Front Matter
      Pages 285-285
    2. Jean Berstel
      Pages 287-294
    3. Arturo Carpi, Aldo de Luca
      Pages 295-306
    4. Volker Diekert, John Michael Robson
      Pages 314-326
    5. Alexandru Mateescu, George Daniel Mateescu
      Pages 327-338
    6. Filippo Mignosi, Antonio Restivo, Marinella Sciortino
      Pages 339-350
  8. Novel Directions

    1. Front Matter
      Pages 354-354
    2. Lila Kari, Jarkko Kari, Laura F. Landweber
      Pages 353-363
    3. Zdzisław Pawlak
      Pages 364-373
  9. Back Matter
    Pages 375-379

About this book

Introduction

Dedicated to Arto Salomaa, a towering figure of theoretical computer science, on the occasion of his 65th birthday, this book is a tribute to him on behalf of the theoretical computer science community. The contributions are written by internationally recognized scientists and cover most of Salomaa's many research areas. Due to its representative selection of classic and cutting edge trends in theoretical computer science, the book constitutes a comprehensive state-of-the-art survey.
The contributions are in such central areas as automata theory, algorithms and complexity, and combinatorics of words. But not only that, they take up new areas such as regular sets and biocomputing. While some are survey articles of fundamental topics, most are original research papers.

Keywords

Combinatorics Lattice algorithmics algorithms automata automata theory calculus combinatorics of words complexity formal language theory grammar mapping

Editors and affiliations

  • Juhani Karhumäki
    • 1
  • Hermann Maurer
    • 2
  • Gheorghe Păun
    • 3
  • Grzegorz Rozenberg
    • 4
  1. 1.Department of Mathematics and Turku Centre for Computer ScienceUniversity of TurkuTurkuFinland
  2. 2.Institutes for Information Processing and Computer Supported Media (IICM)Technical University of GrazGrazAustria
  3. 3.Institute of MathematicsRomanian Academy of SciencesBucharestRomania
  4. 4.Department of Computer ScienceLeiden UniversityLeidenThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-60207-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-64304-0
  • Online ISBN 978-3-642-60207-8
  • Buy this book on publisher's site