|
|||||||||||||||||||||||||||||||||||
|
2 Reviews
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
Most Helpful First | Newest First
|
|
9 of 11 people found the following review helpful:
5.0 out of 5 stars
Very technical after chapter 2; reads like a calculus book.,
By tmetzler@uswest.net (Phoenix, AZ) - See all my reviews
This review is from: DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series) (Hardcover)
Chapters 1 & 2 make for interesting and informative reading. The rest of the book reads like a calculus book and is obviously meant only for the most technically literate: you should know (and like) Chomsky grammars and want to learn about their (mathematical) relationship with DNA bases. Topics include: Sticker Systems, Watson-Crick Finite Automata, Splicing Systems, Universality by Finite H Systems, and Splicing Circular Strings
4.0 out of 5 stars
Very Technical Analysis -1998 not 2005 book,
By
This review is from: DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series) (Hardcover)
First, this 'edition' listed in Amazon as 2005 seems to be identical to the edition I have listed in Lib of Congress as 1998-
The Table of Contents and Index are identical down to the page numbers. Nonetheless it is a vary theoretical analysis of potential models which relate to DNA computing as Formal Language Theory models and the proofs of various capabilities of these languages which might be implementable with DNA techniques. This is not for the faint of heart or lay reader, ie not a mathematical/computing theorist. It is an excellent start if this is your perspective. |
|
Most Helpful First | Newest First
|
|
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series) by Gheorghe P?un (Hardcover - June 1, 2006)
$119.00
In Stock | |
 
| ||
