Formal and Natural Computing
Editat de Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaaen Limba Engleză Paperback – 6 feb 2002
Preț: 330.15 lei
Preț vechi: 412.69 lei
-20%
Puncte Express: 495
Preț estimativ în valută:
58.39€ • 68.26$ • 50.77£
58.39€ • 68.26$ • 50.77£
Carte tipărită la comandă
Livrare economică 07-21 martie
Specificații
ISBN-13: 9783540431909
ISBN-10: 354043190X
Pagini: 476
Ilustrații: XXXVI, 436 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.72 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354043190X
Pagini: 476
Ilustrații: XXXVI, 436 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.72 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras