Formal languages
The computational linguistics of biological sequences
Artificial intelligence and molecular biology
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Remarks on operations suggested by mutations in genomes
Fundamenta Informaticae
Theoretical Computer Science
Handbook of Formal Languages
DNA evolutionary linguistics and RNA structure modeling: a computational approach
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Hi-index | 0.00 |
The main goal of this paper is to show that the mechanism of recombination, found in biology, also works in natural languages. We aim to demonstrate that it may be possible to generate a natural language, or at least an important part of it, by starting with a base composed of a finite number of simple sentences and words, and by applying a small number of recombination rules. Recombination patterns are introduced as a simple and efficient formalism ---based on the behavior of DNA molecules--- to describe the syntax of natural languages. In this paper we deal with the description of complex sentences and we have used English, Italian and Spanish to define our formalism.