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

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijä: Brauer, Wilfried, 1937-2014
Muut tekijät: Ehrig, Hartmut, 1944- (Päätoimittaja), Karhumäki, Juhani, 1949- (Päätoimittaja)
Aineistotyyppi: Livre numérique
Kieli:Anglais
Julkaistu: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Sarja:Lecture notes in computer science 2300
Aiheet:
Linkit:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Huomautus: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Variante du titre:Mélanges :, Rozenberg
Edition sous un autre format:• Formal and natural computing, essays dedicated to Grzegorz Rozenberg, Wilfried Brauer ... [et al.] (eds.), Berlin, Springer, 2002, 1 vol. (XXXVI-429 p.), Lecture notes in computer science, 3-540-43190-X
• Formal and Natural Computing, Texte imprimé, 9783662199497
Sisällysluettelo:
  • 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.