Where Mathematics, Computer Science, Linguistics and Biology Meet: Essays in honour of Gheorghe Paun / Edition 1by Carlos Mart?n-Vide
Pub. Date: 11/30/2000
Publisher: Springer Netherlands
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
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.
- Springer Netherlands
- Publication date:
- Edition description:
- Product dimensions:
- 6.14(w) x 9.21(h) x 0.36(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.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >