You are not signed in. Sign in.


Category IT Books

Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back »

Book cover image of Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back by Carlos Martin-Vide

Authors: Carlos Martin-Vide, Martin-Vide Martin-Vide, Carlos Martin-Vide
ISBN-13: 9780415298858, ISBN-10: 0415298857
Format: Hardcover
Publisher: Taylor & Francis, Inc.
Date Published: January 2003
Edition: (Non-applicable)

Find Best Prices for This Book »

Author Biography: Carlos Martin-Vide

Book Synopsis

The conventional wisdom was that biology influenced mathematics and computer science. But a new approach has taken hold: that of transferring methods and tools from computer science to biology. The reverse trend is evident in Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology and Back. The contributors address the structural (syntactical) view of the domain. Mathematical linguistics and computer science can offer various tools for modeling complex macromolecules and for analyzing and simulating biological issues. This collection is valuable for students and researchers in biology, computer science, and applied mathematics.

Table of Contents

Contributing Authors
Gheorghe Paun and the Windmill Curiosity1
Animal Farm: An Eco-Grammar System9
Towards a Brain Compatible Theory of Syntax Based on Local Testability17
The Power and Limitations of Random Context33
Parsing Contextual Grammars with Linear, Regular and Context-Free Selectors45
Linguistic Grammar Systems: A Grammar Systems Approach for Natural Languages55
Multi-Bracketed Contextual Rewriting Grammars with Obligatory Rewriting67
Semi-Top-Down Syntax Analysis77
Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals91
On the Generative Capacity of Parallel Communicating Extended Lindenmayer Systems99
Cellular Automata and Probabilistic L Systems: An Example in Ecology111
On Iterated Sequential Transducers121
Distributed Real-Time Automata131
On Commutative Directable Nondeterministic Automata141
Testing Non-Deterministic X-Machines151
Note on Minimal Automata and Uniform Communication Protocols163
On Universal Finite Automata and a-Transducers171
Electronic Dictionaries and Acyclic Finite-State Automata: A State of the Art177
A New Recursive Incremental Algorithm for Building Minimal Acyclic Deterministic Finite Automata189
Syntactic Calculus and Pregroups203
Homomorphic Characterizations of Linear and Algebraic Languages215
Using Alternating Words to Describe Symbolic Pictures225
What Is the Abelian Analogue of Dejean's Conjecture?237
Threshold Locally Testable Languages in Strict Sense243
Characterizations of Language Classes: Universal Grammars, Dyck Reductions, and Homomorphisms253
On DOL Power Series over Various Semirings263
The World of Unary Languages: A Quick Tour275
A New Universal Logic Element for Reversible Computing285
Church-Rosser Languages and Their Relationship to Other Language Classes295
Hiding Regular Languages305
On the Difference Problem for Semilinear Power Series317
On Spatial Reasoning via Rough Mereology327
Languages and Problem Specification337
The Identities of Local Threshold Testability347
Soft Computing Modeling of Microbial Metabolism359
DNA Hybridization, Shifts of Finite Type, and Tiling of the Integers369
Generalized Homogeneous P-Systems381
Crossing-Over on Languages: A Formal Representation of Chromosomes Recombination391
Restricted Concatenation Inspired by DNA Strand Assembly403
DNA Tree Structures413




No reviews. Submit yours!

Review this book.

We would like to know what you think about this book and publish your thoughts here! (top)

Your Review

  1. You may optionally give a title for this comment.

  2. Worst to best, 1 to 5, what would you rate this one?

  3. The actual content of your comment. No HTML nor whatsoever allowed.

  4. The author of this comment.

  5. 7 + 1 = ?

    Please answer the question by common sense.