An Algebraic Characterization of Semi-Simple Splicing

Authors:
Rodica Ceterchi
Affiliations:
Faculty of Mathematics, University of Bucharest 14, Academiei st., RO-010014 Bucharest, Romania. E-mail: rceterchi@gmail.com
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Year:
2006

The theory of semirings with applications in mathematics and theoretical computer science

The theory of semirings with applications in mathematics and theoretical computer science
Regularity of splicing languages

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

Handbook of formal languages, vol. 2
Simple splicing systems

Discrete Applied Mathematics
Semi-simple splicing systems

Where mathematics, computer science, linguistics and biology meet
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

An algebraic characterization of simple splicing languages given in [6] is extended to semi-simple splicing languages.