Abstract
Some canonic forms of splicing derivations are introduced and the notion of ω-splicing is used for proving that H systems with a finite number of splicing rules and a regular set of axioms generate regular languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Adleman, Molecular computation of solutions to combinatorial problems, Science, 266 (Nov. 1994), 1021–1024.
K. Culik II, T. Harju, The regularity of splicing systems and DNA, in Proc. ICALP 1989, Lecture Notes in Computer Science, 372, Springer- Verlag, 1989, 222–233.
K. Culik II, T. Harju, Splicing semigroups of dominoes and DNA, Discrete Applied Mathematics, 31 (1991), 261–277.
A. De Luca, A. Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Information and Control, 44 (1980), 300–319.
T. Head, Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors, Bulletin of Mathematical Biology 49 (1987), 737–759.
T. Head, Splicing schemes and DNA, in: Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology, (G. Rozenberg, A. Salomaa, eds.), Springer- Verlag, Berlin, Heidelberg, 1992, 371–383.
T. Head, Gh. Păun, D. Pixton, Language theory and molecular genetics, Chapter 7 in Handbook of Language Theory (G. Rozenberg, A. Salomaa, eds.), vol 2, Springer-Verlag, Berlin, Heidelberg, 1997, 295–360.
T. Head, Splicing representations of strictly locally testable languages, Discrete Applied Mathematics, 87, 1–3 (1998), 139–147.
S. C. Kleene, Representation of events in nerve nets and finite automata, in Automata Studies, Princeton Univ. Press, Princeton, NJ, 1956.
A. Lindenmayer, Mathematical models for cellular interaction in development, I and II, J. Theoret. Biol., 18 (1968), 280–315.
R. Lipton, DNA solution of hard computational problems, Science, 268 (April 1995), 542–545.
V. Manca, Gh. Păun, Arithmetically controlled H systems, Computer Science Journal of Moldova, 6, 2(17) (1998), 103–118.
V. Manca, Logical string rewriting, Theoretical Computer Science, to appear.
R. McNaughton, S. Papert, Counter-Free Automata, MIT Press, Cambridge, MA, 1971.
Gh. Păun, On the splicing operation, Discrete Applied Mathematics, 70, 1 (1996), 57–79.
Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, 1998.
D. Pixton, Regularity of splicing languages, Discrete Applied Mathematics, 69, 1–2 (1996), 101–124.
D. Pixton, Splicing in abstract families of languages, Technical Report 26/97 of SUNY, Univ. of Binghamton, New York, 1997.
G. Rozenberg, A. Salomaa, eds., Handbook of Language Theory, 3 Volumes., Springer-Verlag, Berlin, Heidelberg, 1997.
M. P. Schützenberger, Sur certaines operations de fermeture dans les languages rationels, Sympos. Math., 15 (1975), 245–253.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London Limited
About this chapter
Cite this chapter
Manca, V. (2000). Splicing Normalization and Regularity. In: Finite Versus Infinite. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0751-4_13
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0751-4_13
Publisher Name: Springer, London
Print ISBN: 978-1-85233-251-8
Online ISBN: 978-1-4471-0751-4
eBook Packages: Springer Book Archive