Formal and Natural Computing Essays Dedicated to Grzegorz Rozenberg /

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....

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Brauer, Wilfried (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Ehrig, Hartmut (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Karhumäki, Juhani (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Salomaa, Arto K. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Έκδοση:1st ed. 2002.
Σειρά:Lecture Notes in Computer Science, 2300
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Words, 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.