Splicing semigroups of dominoes and DNA
Discrete Mathematics
Regularity of splicing languages
Discrete Applied Mathematics
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
Separating some splicing models
Information Processing Letters
Varieties Of Formal Languages
Splicing Systems: Regularity and Below
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
DNA Computing: New Computing Paradigms
DNA Computing: New Computing Paradigms
A characterization of regular circular languages generated by marked splicing systems
Theoretical Computer Science
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Regular splicing languages must have a constant
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A decision procedure for reflexive regular splicing languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.05 |
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular language is a reflexive splicing language, but the general question remains open.