Formal and Natural Computing

Essays Dedicated to Grzegorz Rozenberg

  • Wilfried Brauer
  • Hartmut Ehrig
  • Juhani Karhumäki
  • Arto Salomaa

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2300)

Table of contents

  1. Front Matter
    Pages I-XXXVI
  2. Words, Languages, Automata

    1. Jean Berstel, Luc Boasson
      Pages 3-25
    2. Vesa Halava, Tero Harju
      Pages 57-68
    3. Juhani Karhumäki, Ion Petre
      Pages 69-76
    4. Alexandru Mateescu, Arto Salomaa
      Pages 96-106
    5. Antonio Restivo, Sergio Salemi
      Pages 107-116
  3. Graph Transformations

    1. Paolo Baldan, Andrea Corradini, Ugo Montanari
      Pages 158-187
  4. Petri Nets

    1. Hartmut Ehrig, Kathrin Hoffmann, Julia Padberg, Paolo Baldan, Reiko Heckel
      Pages 191-219
    2. Maurice ter Beek, Jetty Kleijn
      Pages 220-243
  5. Concurrent Computing

    1. Gregor Engels, Luuk Groenewegen
      Pages 257-276
    2. Javier Esparza
      Pages 277-297
    3. Mogens Nielsen, Frank D. Valencia
      Pages 298-321
  6. Molecular Computing

    1. Paolo Bottoni, Anna Labella, Carlos Martín-Vide, Gheorghe PĂun
      Pages 325-353

About this book

Introduction

This book presents state of the art research in theoretical computer science and related ?elds. In particular, the following areas are discussed: automata theory, formal languages and combinatorics of words, graph transformations, Petri nets, concurrency, as well as natural and molecular computing. The articles are written by leading researchers in these areas. The writers were originally invited to contribute to this book but then the normal refereeing procedure was applied as well. All of the articles deal with some issue that has been under vigorous study during recent years. Still, the topics range from very classical ones to issues raised only two or three years ago. Both survey articles and papers attacking speci?c research problems are included. The book highlights some key issues of theoretical computer science, as they seem to us now at the beginning of the new millennium. Being a comprehensive overview of some of the most active current research in theoretical computer science, it should be of de?nite interest for all researchers in the areas covered. The topics range from basic decidability and the notion of information to graph grammars and graph transformations, and from trees and traces to aqueous algorithms, DNA encoding and self-assembly. Special e?ort has been given to lucid presentation. Therefore, the book should be of interest also for advanced students.

Keywords

Automata Theory Combinatorics Computing Theory Concurrent Computing DNA Computing Discrete Mathematics Formal Languages Graph Grammars Graph Transformations Molecular Computing Natural Computing Petri Nets algorithms computer computer science

Editors and affiliations

  • Wilfried Brauer
    • 1
  • Hartmut Ehrig
    • 2
  • Juhani Karhumäki
    • 3
  • Arto Salomaa
    • 4
  1. 1.Computer Science DepartmentTechnical University of MunichMunichGermany
  2. 2.Computer Science DepartmentTechnical University of BerlinBerlinGermany
  3. 3.Department of MathematicsUniversity of TurkuTurkuFinland
  4. 4.Turku Centre for Computer ScienceTurkuFinland

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45711-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-43190-9
  • Online ISBN 978-3-540-45711-4
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors
Electronics
Telecommunications
Aerospace