A Decision Procedure for Reflexive Regular Splicing Languages
A structural characterization of reflexive splicing languages has been recently given in  and  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  it is shown that a regular splicing language is reflexive iff splice sites of the rules are constants for the language.
Unable to display preview. Download preview PDF.
- 2.Bonizzoni, P., De Felice, C., Mauri, G., Zizza, R.: Linear splicing and syntactic monoid. Discrete Applied Mathematics (to appear, 2005)Google Scholar
- 8.Head, T.: Splicing languages generated with one sided context. In: Paun, G. (ed.) Computing with Bio-molecules. Theory and Experiments. Springer, Singapore (1998)Google Scholar
- 9.Goode, E., Pixton, D.: Recognizing splicing languages: Syntactic Monoids and Simultaneous Pumping (submitted, 2004), available from: http://www.math.binghamton.edu/dennis/Papers/index.html
- 12.Perrin, D.: Finite Automata. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 1–57. Elsevier, Amsterdam (1990)Google Scholar
- 14.Schützenberger, M.P.: Sur certaines opérations de fermeture dans les langages rationnels. Symposia Mathematica 15, 245–253 (1975)Google Scholar