LEADER 06120nam 22008295 450 001 9910145794203321 005 20200702122406.0 010 $a3-540-45711-9 024 7 $a10.1007/3-540-45711-9 035 $a(CKB)1000000000016878 035 $a(SSID)ssj0000323204 035 $a(PQKBManifestationID)11937896 035 $a(PQKBTitleCode)TC0000323204 035 $a(PQKBWorkID)10296450 035 $a(PQKB)10475401 035 $a(DE-He213)978-3-540-45711-4 035 $a(MiAaPQ)EBC3072798 035 $a(PPN)155208047 035 $a(EXLCZ)991000000000016878 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFormal and Natural Computing $eEssays Dedicated to Grzegorz Rozenberg /$fedited by Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaa 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XXXVI, 436 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2300 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43190-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aWords, Languages, Automata -- Balanced Grammars and Their Languages -- Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids -- The Delta Operation: From Strings to Trees to Strings -- Infinite Solutions of Marked Post Correspondence Problem -- The Branching Point Approach to Conway?s Problem -- A Survey of Some Quantitative Approaches to the Notion of Information -- Nondeterministic Trajectories -- Binary Patterns in Infinite Binary Words -- Graph Transformations -- A Sight-seeing Tour of the Computational Landscape of Graph Transformation -- Local Action Systems and DPO Graph Transformation -- Bisimulation Equivalences for Graph Grammars -- Petri Nets -- High-Level Net Processes -- Petri Net Control for Grammar Systems -- Regular Event Structures and Finite Petri Nets: A Conjecture -- Concurrent Computing -- Towards Team-Automata-Driven Object-Oriented Collaborative Work -- Grammars as Processes -- Temporal Concurrent Constraint Programming: Applications and Behavior -- Molecular Computing -- Rewriting P Systems with Conditional Communication -- An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation -- Upper Bounds for Restricted Splicing -- Codes, Involutions, and DNA Encodings -- DNA Manipulations in Ciliates -- A Magic Pot : Self-assembly Computation Revisited. 330 $aThis 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2300 606 $aComputer programming 606 $aArchitecture, Computer 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aData structures (Computer science) 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aComputer programming. 615 0$aArchitecture, Computer. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aData structures (Computer science). 615 14$aProgramming Techniques. 615 24$aComputer System Implementation. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aData Structures. 676 $a005.13 702 $aBrauer$b Wilfried$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aEhrig$b Hartmut$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKarhumäki$b Juhani$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSalomaa$b Arto K$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910145794203321 996 $aFormal and natural computing$9983718 997 $aUNINA