| Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg 2002 Edition Contributor(s): Brauer, Wilfried (Editor), Ehrig, Hartmut (Editor), Karhumäki, Juhani (Editor) |
|
 |
ISBN: 354043190X ISBN-13: 9783540431909 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback Published: February 2002 |
| Additional Information |
| BISAC Categories: - Computers | Programming - Algorithms - Computers | Information Technology - Computers | Machine Theory |
| Dewey: 004.015 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 0.96" H x 6.14" W x 9.21" (1.46 lbs) 436 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |