Skip to main content
SpringerLink
Log in

Formal and Natural Computing

Essays Dedicated to Grzegorz Rozenberg

  • Book
  • © 2002

Overview

Editors:
  1. Wilfried Brauer

    1. Computer Science Department, Technical University of Munich, Munich, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hartmut Ehrig

    1. Computer Science Department, Technical University of Berlin, Berlin, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Juhani Karhumäki

    1. Department of Mathematics, University of Turku, Turku, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Arto Salomaa

    1. Turku Centre for Computer Science, Turku, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 chapters)

  1. Front Matter

    Pages I-XXXVI
    Download chapter PDF

  2. Words, Languages, Automata

    1. Balanced Grammars and Their Languages

      • Jean Berstel, Luc Boasson
      Pages 3-25

    2. Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids

      • Volker Diekert, Paul Gastin
      Pages 26-38

    3. The Delta Operation: From Strings to Trees to Strings

      • Joost Engelfriet
      Pages 39-56

    4. Infinite Solutions of Marked Post Correspondence Problem

      • Vesa Halava, Tero Harju
      Pages 57-68

    5. The Branching Point Approach to Conway’s Problem

      • Juhani Karhumäki, Ion Petre
      Pages 69-76

    6. A Survey of Some Quantitative Approaches to the Notion of Information

      • Aldo de Luca
      Pages 77-95

    7. Nondeterministic Trajectories

      • Alexandru Mateescu, Arto Salomaa
      Pages 96-106

    8. Binary Patterns in Infinite Binary Words

      • Antonio Restivo, Sergio Salemi
      Pages 107-116

  3. Graph Transformations

    1. A Sight-seeing Tour of the Computational Landscape of Graph Transformation

      • Hans-Jörg Kreowski
      Pages 119-137

    2. Local Action Systems and DPO Graph Transformation

      • Dirk Janssens
      Pages 138-157

    3. Bisimulation Equivalences for Graph Grammars

      • Paolo Baldan, Andrea Corradini, Ugo Montanari
      Pages 158-187

  4. Petri Nets

    1. High-Level Net Processes

      • Hartmut Ehrig, Kathrin Hoffmann, Julia Padberg, Paolo Baldan, Reiko Heckel
      Pages 191-219

    2. Petri Net Control for Grammar Systems

      • Maurice ter Beek, Jetty Kleijn
      Pages 220-243

    3. Regular Event Structures and Finite Petri Nets: A Conjecture

      • P.S. Thiagarajan
      Pages 244-253

  5. Concurrent Computing

    1. Towards Team-Automata-Driven Object-Oriented Collaborative Work

      • Gregor Engels, Luuk Groenewegen
      Pages 257-276

    2. Grammars as Processes

      • Javier Esparza
      Pages 277-297

    3. Temporal Concurrent Constraint Programming: Applications and Behavior

      • Mogens Nielsen, Frank D. Valencia
      Pages 298-321

  6. Molecular Computing

    1. Rewriting P Systems with Conditional Communication

      • Paolo Bottoni, Anna Labella, Carlos Martín-Vide, Gheorghe PÄ‚un
      Pages 325-353

    2. An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation

      • Tom Head
      Pages 354-360
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Computer Science Department, Technical University of Munich, Munich, Germany

    Wilfried Brauer

  • Computer Science Department, Technical University of Berlin, Berlin, Germany

    Hartmut Ehrig

  • Department of Mathematics, University of Turku, Turku, Finland

    Juhani Karhumäki

  • Turku Centre for Computer Science, Turku, Finland

    Arto Salomaa

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation