Where Mathematics, Computer Science, Linguistics and Biology Meet
Edited by Carlos Martín-Vide and
Victor Mitrana
in Springer Books from Springer
Date: 2001
ISBN: 978-94-015-9634-3
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Chapters in this book:
- Ch Chapter 1 The Games of His Life
- Solomon Marcus
- Ch Chapter 10 Acceptance of ω-Languages by Communicating Deterministic Turing Machines
- Rudolf Freund and Ludwig Staiger
- Ch Chapter 11 Counter Machines and the Safety and Disjointness Problems for Database Queries with Linear Constraints
- Oscar H. Ibarra, Jianwen Su and Constantinos Bartzis
- Ch Chapter 12 Automata Arrays and Context-Free Languages
- Martin Kutrib
- Ch Chapter 13 On Special Forms of Restarting Automata
- František Mráz, Martin Plátek and Martin Procházka
- Ch Chapter 14 The Time Dimension of Computation Models
- Sheng Yu
- Ch Chapter 15 An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy
- Peter R. J. Asveld
- Ch Chapter 16 Trellis Languages
- Adrian Atanasiu
- Ch Chapter 17 Pictures, Layers, Double Stranded Molecules: On Multi-Dimensional Sentences
- Paolo Bottoni
- Ch Chapter 18 Transduction in Polypodes
- Symeon Bozapalidis
- Ch Chapter 19 Some Algebraic Properties of Contexts and Their Applications to Contextual Languages
- Rodica Ceterchi
- Ch Chapter 2 Deterministic Stream X-Machines Based on Grammar Systems
- Tudor Bălănescu, Marian Gheorghe and Mike Holcombe
- Ch Chapter 20 On Fatou Properties of Rational Languages
- Christian Choffrut and Juhani Karhumäki
- Ch Chapter 21 Multiple Keyword Patterns in Context-Free Languages
- Pál Dömösi and Masami Ito
- Ch Chapter 22 Reading Words in Graphs Generated by Hyperedge Replacement
- Frank Drewes and Hans-Jörg Kreowski
- Ch Chapter 23 Regularly Controlled Formal Power Series
- Henning Fernau and Werner Kuich
- Ch Chapter 24 Forbidden Subsequences and Permutations Sortable on Two Parallel Stacks
- Tero Harju and Lucian Ilie
- Ch Chapter 25 Approximate Identification and Finite Elasticity
- Satoshi Kobayashi, Yasubumi Sakakibara and Takashi Yokomori
- Ch Chapter 26 Insertion of Languages and Differential Semirings
- Gabriel Thierrin
- Ch Chapter 27 Molecular Structures
- Gabriel Ciobanu
- Ch Chapter 28 A Characterization of Non-Iterated Splicing with Regular Rules
- Ray Dassen, Hendrik Jan Hoogeboom and Nikè van Vugt
- Ch Chapter 29 Universal and Simple Operations for Gene Assembly in Ciliates
- Andrzej Ehrenfeucht, Ion Petre, David M. Prescott and Grzegorz Rozenberg
- Ch Chapter 3 Some Ghosts that Arise in a Spliced Linguistic String: Evidence from Catalan
- Gemma Bel-Enguix
- Ch Chapter 30 Semi-Simple Splicing Systems
- Elizabeth Goode and Dennis Pixton
- Ch Chapter 31 Writing by Methylation Proposed for Aqueous Computing
- Tom Head
- Ch Chapter 32 Context-Free Recombinations
- Jarkko Kari and Lila Kari
- Ch Chapter 33 Simplified Simple H Systems
- Kamala Krithivasan and Arvind Arasu
- Ch Chapter 34 On Some Forms of Splicing
- Vincenzo Manca
- Ch Chapter 35 Time-Varying Distributed H-Systems of Degree 2 Generate All Recursively Enumerable Languages
- Maurice Margenstern and Yurii Rogozhin
- Ch Chapter 36 On Membrane Computing Based on Splicing
- Andrei Păun and Mihaela Păun
- Ch Chapter 37 Is Evolutionary Computation Using DNA Strands Feasible?
- José Rodrigo, Juan Castellanos, Fernando Arroyo and Luis Fernando Mingo
- Ch Chapter 38 Splicing Systems Using Merge and Separate Operations
- Claudio Zandron, Giancarlo Mauri, Claudio Ferretti and Paola Bonizzoni
- Ch Chapter 4 On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems
- Erzsébet Csuhaj-Varjú
- Ch Chapter 5 Subregularly Controlled Derivations: Restrictions by Syntactic Parameters
- Jürgen Dassow
- Ch Chapter 6 Neo-Modularity and Colonies
- Jozef Kelemen, Alica Kelemenová and Victor Mitrana
- Ch Chapter 7 Sewing Contexts and Mildly Context-Sensitive Languages
- Carlos Martín-Vide, Alexandru Mateescu and Arto Salomaa
- Ch Chapter 8 Towards Grammars of Decision Algorithms
- Lech Polkowski and Andrzej Skowron
- Ch Chapter 9 Computational Complementarity for Probabilistic Automata
- Cristian S. Calude, Elena Calude and Karl Svozil
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprbok:978-94-015-9634-3
Ordering information: This item can be ordered from
http://www.springer.com/9789401596343
DOI: 10.1007/978-94-015-9634-3
Access Statistics for this book
More books in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().