Splicing systems and the Chomsky hierarchy

Authors:
Jean Berstel;Luc Boasson;Isabelle Fagnot
Affiliations:
LIGM, Université Paris-Est Marne-la-Vallée, 5, boulevard Descartes, Champs-sur-Marne, F-77454 Marne-la-Vallée Cedex 2, France;LIAFA, Université Paris DiderotParis 7 and CNRS, Case 7014, 75205 Paris Cedex 13, France;LIGM, Université Paris-Est Marne-la-Vallée, 5, boulevard Descartes, Champs-sur-Marne, F-77454 Marne-la-Vallée Cedex 2, France and Université Paris DiderotParis 7, Case 7014, 75 ...
Venue:
Theoretical Computer Science
Year:
2012

Citing 12
Cited 0

Regularity of splicing languages

Discrete Applied Mathematics
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination

Handbook of formal languages, vol. 2
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Circular DNA and Splicing Systems

ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
DNA and Circular Splicing

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Linear and circular splicing systems

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)
An Algebraic Characterization of Semi-Simple Splicing

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
A characterization of regular circular languages generated by marked splicing systems

Theoretical Computer Science
Decision problems for linear and circular splicing systems

DLT'02 Proceedings of the 6th international conference on Developments in language theory
On the regularity of circular splicing languages: a survey and new developments

Natural Computing: an international journal
A characterization of (regular) circular languages generated by monotone complete splicing systems

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular) splicing systems within the Chomsky hierarchy. The two main results of the paper are the following. First, we show that it is decidable, given a circular splicing language and a regular language, whether they are equal. Second, we prove the language generated by an alphabetic splicing system is context-free. Alphabetic splicing systems are a generalization of simple and semi-simple splicing systems already considered in the literature.