|
|
Sold Out
Book Categories |
| Preface | ||
| Contributing Authors | ||
| 1 | The Games of His Life | 1 |
| 2 | Deterministic Stream X-Machines Based on Grammar Systems | 13 |
| 3 | Some Ghosts that Arise in a Sliced Linguistic String: Evidence from Catalan | 25 |
| 4 | On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems | 37 |
| 5 | Subregularly Controlled Derivations: Restrictions by Syntactic Parameters | 51 |
| 6 | Neo-Modularity and Colonies | 63 |
| 7 | Sewing Contexts and Mildly Context-Sensitive Languages | 75 |
| 8 | Towards Grammars of Decision Algorithms | 85 |
| 9 | Computational Complementarity for Probabilstic Automata | 99 |
| 10 | Acceptance of [omega]-Languages by Communicating Deterministic Turing Machines | 115 |
| 11 | Counter Machines and the Safety and Disjointness Problems for Database Queries with Linear Constraints | 127 |
| 12 | Automata Arrays and Context-Free Languages | 139 |
| 13 | On Special Forms of Restarting Automata | 149 |
| 14 | The Time Dimension of Computation Models | 161 |
| 15 | An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy | 175 |
| 16 | Trellis Languages | 187 |
| 17 | Pictures, Layers, Double Stranded Molecules: On Multi-Dimensional Sentences | 199 |
| 18 | Transduction in Polypodes | 211 |
| 19 | Some Algebraic Properties of Contexts and Their Applications to Contextual Languages | 219 |
| 20 | On Fatou Properties of Rational Languages | 227 |
| 21 | Multiple Keyword Patterns in Context-Free Languages | 237 |
| 22 | Reading Words in Graphs Generated by Hyperedge Replacement | 243 |
| 23 | Regularly Controlled Formal Power Series | 253 |
| 24 | Forbidden Subsequences and Permutations Sortable on Two Parallel Stacks | 267 |
| 25 | Approximate Identification and Finite Elasticity | 277 |
| 26 | Insertion of Languages and Differential Semirings | 287 |
| 27 | Molecular Structures | 299 |
| 28 | A Characterization of Non-Iterated Splicing with Regular Rules | 319 |
| 29 | Universal and Simple Operations for Gene Assembly in Ciliates | 329 |
| 30 | Semi-Simple Splicing Systems | 343 |
| 31 | Writing By Methylation Proposed For Aqueous Computing | 353 |
| 32 | Context-Free Recombinations | 361 |
| 33 | Simplified Simple H Systems | 377 |
| 34 | On Some Forms of Splicing | 387 |
| 35 | Time-Varying Distributed H-Systems of Degree 2 Generate All Recursively Enumerable Languages | 399 |
| 36 | On Membrane Computing Based on Splicing | 409 |
| 37 | Is Evolutionary Computation Using DNA Strands Feasible? | 423 |
| 38 | Splicing Systems Using Merge and Separate Operations | 435 |
| Price | Condition | Delivery | Seller | Action |
| $217.00 | Digital |
| WonderClub |
Brian Jackson
reviewed Where Mathematics, Computer Science, Linguistics And Biology Meet on September 05, 2018
Where Mathematics
Sipiora and Baumlin need better editors. This book was, for the most part, heavy-handed and navel-gazing. Someone from outside of their circle really needed to be involved to provide a better sense of the project, some objectivity (though that word is troubling). There are chapters I would recommend, but I can't say the same for the book as a whole.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Where Mathematics, Computer Science, Linguistics And Biology Meet
X
This Item is in Your Inventory
Where Mathematics, Computer Science, Linguistics And Biology Meet
X
You must be logged in to review the productsX
X
X
Add Where Mathematics, Computer Science, Linguistics And Biology Meet, , Where Mathematics, Computer Science, Linguistics And Biology Meet to the inventory that you are selling on WonderClubX
X
Add Where Mathematics, Computer Science, Linguistics And Biology Meet, , Where Mathematics, Computer Science, Linguistics And Biology Meet to your collection on WonderClub |