Splicing semigroups of dominoes and DNA
Discrete Mathematics
Handbook of theoretical computer science (vol. B)
Regularity of splicing languages
Discrete Applied Mathematics
Discrete Applied Mathematics
Separating some splicing models
Information Processing Letters
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
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)
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
Discrete Applied Mathematics
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
| Hi-index | 0.00 |
A structural characterization of reflexive splicing languages has been recently given in [1] and [5] showing surprising connections between long standing notions in formal language theory, the syntactic monoid and Schützenberger constant and the splicing operation. In this paper, we provide a procedure to decide whether a regular language is a reflexive splicing language, based on the above mentioned characterization that is given in terms of a finite set of constants for the language. The procedure relies on a basic result showing how to determine, given a regular language L, a finite set of representatives for constant classes of the syntactic monoid of L. This finite set provides the splice sites of splicing rules generating language L. Indeed, we recall that in [1] it is shown that a regular splicing language is reflexive iff splice sites of the rules are constants for the language.