Where Mathematics, Computer Science, Linguistics and Biology Meet: Essays in honour of Gheorghe Paun / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
Used and New from Other Sellers
Used and New from Other Sellers
from $51.10
Usually ships in 1-2 business days
(Save 76%)
Other sellers (Hardcover)
  • All (4) from $51.10   
  • New (2) from $157.54   
  • Used (2) from $51.10   


There are not many interdisciplinary scientific fields as formal language theory. In this volume, it is presented as the very intersection point between Mathematics, Computer Science, Linguistics and Biology. The book is a collection of papers going deep into classical topics in computer science inspired formal languages, as well as other ones showing new concepts and problems motivated in linguistics and biology. The papers are organized in four sections: Grammars and Grammar Systems, Automata, Languages and Combinatorics, and Models of Molecular Computing. They clearly prove the power, wealth and vitality of the theory nowadays and sketch some trends for its future development. The volume is intended for an audience of computer scientists, computational linguists, theoretical biologists and any other people interested in dealing with the problems and challenges of interdisciplinarity.

Read More Show Less

Product Details

  • ISBN-13: 9780792366935
  • Publisher: Springer Netherlands
  • Publication date: 11/30/2000
  • Edition description: 2001
  • Edition number: 1
  • Pages: 464
  • Product dimensions: 1.06 (w) x 6.14 (h) x 9.21 (d)

Table of Contents

Preface. Contributing Authors. 1. The Games of His Life; S. Marcus. Part I: Grammars and Grammar Systems. 2. Deterministic Stream X-Machines Based on Grammar Systems; T. Balanescu, et al. 3. Some Ghosts that Arise in a Spliced Linguistic String: Evidence from Catalan; G. Bel-Enguix. 4. On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems; E. Csuhaj-Varjú. 5. Subregularly Controlled Derivations: Restrictions by Syntactic Parameters; J. Dassow. 6. Neo-Modularity and Colonies; J. Kelemen, et al. 7. Sewing Contexts and Mildly Context-Sensitive Languages; C. Martín-Vide, et al. 8. Towards Grammars of Decision Algorithms; L. Polkowski, A. Skowron. Part II: Automata. 9. Computational Complementarity for Probabilistic Automata; C.S. Calude, et al. 10. Acceptance of omega-Languages by Communicating Deterministic Turing Machines; R. Freund, L. Staiger. 11. Counter Machines and the Safety and Disjointness Problems for Database Queries with Linear Constraints; O.H. Ibarra, et al. 12. Automata Arrays and Context-Free Languages; M. Kutrib. 13. On Special Forms of Restarting Automata; F. Mráz, et al. 14. The Time Dimension of Computation Models; Sheng Yu. Part III: Languages and Combinatorics. 15. An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy; P.R.J. Asveld. 16. Trellis Languages; A. Atanasiu. 17. Pictures, Layers, Double Stranded Molecules: On Multi-Dimensional Sentences; P. Bottoni. 18. Transduction in Polypodes; S. Bozapalidis. 19. Some Algebraic Properties of Contexts and Their Applications to Contextual Languages; R. Ceterchi. 20. On Fatou Properties of Rational Languages; C. Choffrut, J. Karhumäki. 21. Multiple Keyword Patterns in Context-Free Languages; P. Dömösi, M. Ito. 22. Reading Words in Graphs Generated by Hyperedge Replacement; F. Drewes, H.-J. Kreowski. 23. Regularly Controlled Formal Power Series; H. Fernau, W. Kuich. 24. Forbidden Subsequences and Permutations Sortable on Two Parallel Stacks; T. Harju, L. Ilie. 25. Approximate Identification and Finite Elasticity; S. Kobayashi, et al. 26. Insertion of Languages and Differential Semirings; G. Thierrin. Part IV: Models of Molecular Computing. 27. Molecular Structures; G. Ciobanu. 28. A Characterization of Non-Iterated Splicing with Regular Rules; R. Dassen, et al. 29. Universal and Sample Operations for Gene Assembly in Ciliates; A. Ehrenfeucht, et al. 30. Semi-Simple Splicing Systems; E. Goode, D. Pixton. 31. Writing By Methylation Proposed For Aqueous Computing; T. Head. 32. Context-Free Recombinations; J. Kari, L. Kari. 33. Simplified Simple H Systems; K. Krithivasan, A. Arasu. 34. On Some Forms of Splicing; V. Manca. 35. Time-Varying Distributed H-Systems of Degree 2 Generate All Recursively Enumerable Languages; M. Margenstern, Y. Rogozhin. 36. On Membrane Computing Based on Splicing; A. Păun, M. Păun. 37. Is Evolutionary Computation Using DNA Strands Feasible? J. Rodrigo, et al. 38. Splicing Systems Using Merge and Separate Operations; C. Zandron, et al.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Posted May 28, 2013

    I¿m loving McDonalds for fast food... MyDeals247 for the best de

    I’m loving McDonalds for fast food... MyDeals247 for the best deals;))

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)