Marked systems and circular splicing

Authors:
Clelia De Felice;Gabriele Fici;Rosalba Zizza
Affiliations:
Dipartimento di Informatica e Applicazioni, Universit` di Salerno, Fisciano, Italy;Dipartimento di Informatica e Applicazioni, Universit` di Salerno, Fisciano, Italy;Dipartimento di Informatica e Applicazioni, Universit` di Salerno, Fisciano, Italy
Venue:
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Year:
2007

Citing 10
Cited 3

Regularity of splicing languages

Discrete Applied Mathematics
Combinatorics of words

Handbook of formal languages, vol. 1
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination

Handbook of formal languages, vol. 2
Splicing in abstract families of languages

Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
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)
On the power of circular splicing

Discrete Applied Mathematics
Decision problems for linear and circular splicing systems

DLT'02 Proceedings of the 6th international conference on Developments in language theory

A characterization of regular circular languages generated by marked splicing systems

Theoretical Computer Science
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	0.00

Visualization

Abstract

Splicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. In this paper we introduce a special class of finite circular splicing systems named marked systems. We prove that a marked system S generates a regular circular language if and only if S satisfies a special (decidable) property. As a consequence, we show that we can decide whether a regular circular language is generated by a marked system and we characterize the structure of these regular circular languages.