Where Mathematics, Computer Science, Linguistics and Biology Meet

1. Front Matter

   Pages i-xv

   PDF

2. The Games of His Life

   1. The Games of His Life

      • Solomon Marcus

      Pages 1-10

3. Grammars and Grammar Systems

   1. Front Matter

      Pages 11-11

      PDF

   2. Deterministic Stream X-Machines Based on Grammar Systems

      • Tudor Bălănescu, Marian Gheorghe, Mike Holcombe

      Pages 13-23

   3. Some Ghosts that Arise in a Spliced Linguistic String: Evidence from Catalan

      • Gemma Bel-Enguix

      Pages 25-35

   4. On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems

      • Erzsébet Csuhaj-Varjú

      Pages 37-49

   5. Subregularly Controlled Derivations: Restrictions by Syntactic Parameters

      • Jürgen Dassow

      Pages 51-61

   6. Neo-Modularity and Colonies

      • Jozef Kelemen, Alica Kelemenová, Victor Mitrana

      Pages 63-74

   7. Sewing Contexts and Mildly Context-Sensitive Languages

      • Carlos Martín-Vide, Alexandru Mateescu, Arto Salomaa

      Pages 75-84

   8. Towards Grammars of Decision Algorithms

      • Lech Polkowski, Andrzej Skowron

      Pages 85-95

4. Automata

   1. Front Matter

      Pages 97-97

      PDF

   2. Computational Complementarity for Probabilistic Automata

      • Cristian S. Calude, Elena Calude, Karl Svozil

      Pages 99-113

   3. Acceptance of ω-Languages by Communicating Deterministic Turing Machines

      • Rudolf Freund, Ludwig Staiger

      Pages 115-125

   4. Counter Machines and the Safety and Disjointness Problems for Database Queries with Linear Constraints

      • Oscar H. Ibarra, Jianwen Su, Constantinos Bartzis

      Pages 127-137

   5. Automata Arrays and Context-Free Languages

      • Martin Kutrib

      Pages 139-148

   6. On Special Forms of Restarting Automata

      • František Mráz, Martin Plátek, Martin Procházka

      Pages 149-160

   7. The Time Dimension of Computation Models

      • Sheng Yu

      Pages 161-172

5. Languages and Combinatorics

   1. Front Matter

      Pages 173-173

      PDF

   2. An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy

      • Peter R. J. Asveld

      Pages 175-186

   3. Trellis Languages

      • Adrian Atanasiu

      Pages 187-198

In the last years, it was observed an increasing interest of computer scientists in the structure of biological molecules and the way how they can be manipulated in vitro in order to define theoretical models of computation based on genetic engineering tools. Along the same lines, a parallel interest is growing regarding the process of evolution of living organisms. Much of the current data for genomes are expressed in the form of maps which are now becoming available and permit the study of the evolution of organisms at the scale of genome for the first time. On the other hand, there is an active trend nowadays throughout the field of computational biology toward abstracted, hierarchical views of biological sequences, which is very much in the spirit of computational linguistics. In the last decades, results and methods in the field of formal language theory that might be applied to the description of biological sequences were pointed out.

• Graph
• Sim
• algorithms
• automata
• complexity
• computer
• computer science
• database
• formal language
• formal languages
• genes
• linguistics
• modularity
• combinatorics

• Rovira i Virgili University, Tarragona, Spain

  Carlos Martín-Vide

• University of Bucharest, Bucharest, Romania

  Victor Mitrana

Policies and ethics