Abstract
Generalizing a notion introduced by Păun and his coworkers, we introduce semi-simple splicing systems, in which all splicing rules have the form (a, 1; b,1) where a and b are single symbols. We find a simple graph representation of these systems, and from this representation we show that semi-simple splicing languages are reflexive splicing languages, that they contain constants, and that they are, in fact, strictly locally testable.
Research partially supported by DARPA/NSF CCR-9725021.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Culikn, K. & T. Harju (1991), Splicing semigroups of dominoes and DNAk, Discrete Applied Mathematics, 31: 261–277.
DeLuca, A. & A. Restivo (1980), A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Information and Control, 44: 300–319.
Goode, E. (1999), Constants and Splicing Systems, PhD thesis, Binghamton University.
Goode, E. & Pixton, D., Syntactic monoids, simultaneous pumping, and H systems, in preparation.
Head, T. (1987), Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bulletin of Mathematical Biology, 49.6: 737–759.
Head, T. (1992), Splicing systems and DNA, in G. Rozenberg & A. Salomaa, eds., Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics and Developmental Biology: 371–383. Springer, Berlin.
Head, T. (1998), Splicing languages generated with one sided context, in Gh. Păun, ed., Computing with Bio-molecules-Theory and Experiments: 269-282. Springer, Singapore.
Head, T. (1998), Splicing representations of strictly locally testable languages, Discrete Applied Mathematics, 87: 139–147.
Mateescu, A.; Gh. Păun; G. Rozenberg & A. Salomaa (1996), Simple splicing systems, Discrete Applied Mathematics.
McNaughton, R. & S. Papert (1971), Counter-Free Automata, MIT Press, Cambridge, Mass.
Păun, Gh. (1995), On the power of the splicing operation, International Journal of Computer Mathematics, 59: 27–35.
Păun, Gh.; G. Rozenberg & A. Salomaa (1996), Computing by splicing, Theoretical Computer Science, 168.2: 321–336.
Pixton, D. (1996), Regularity of splicing languages, Discrete Applied Mathematics, 69.1-2: 99–122.
Schützenberger, M.P. (1975), Sur certaines operations de fermeture dans les langages rationnels, Symposia Math, 15: 245–253.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Goode, E., Pixton, D. (2001). Semi-Simple Splicing Systems. In: Martín-Vide, C., Mitrana, V. (eds) Where Mathematics, Computer Science, Linguistics and Biology Meet. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9634-3_30
Download citation
DOI: https://doi.org/10.1007/978-94-015-9634-3_30
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5607-8
Online ISBN: 978-94-015-9634-3
eBook Packages: Springer Book Archive