Probabilistic Splicing Systems
- 1.2k Downloads
In this paper we introduce splicing systems with probabilities, i.e., probabilistic splicing systems, and establish basic properties of language families generated by this type of splicing systems. We show that a simple extension of splicing systems with probabilities may increase the computational power of splicing systems with finite components.
KeywordsLanguage Family Discrete Apply Mathematic Formal Language Theory Probabilistic Automaton Splice System
Unable to display preview. Download preview PDF.
- 1.Adleman, L.: Molecular computation of solutions to combinatorial problems. Science, 1021–1024 (November 11, 1994)Google Scholar
- 2.Lipton, R.J.: Using DNA to solve NP–complete problems. Science, 542–545 (April 28, 1995)Google Scholar
- 3.Boneh, D., Dunworth, C., Lipton, R., Sgall, J.: On the computational power of DNA. Discrete Applied Mathematics, Special Issue on Computational Molecular Biology, 79–94 (1996)Google Scholar
- 4.Head, T.: Formal language theory and DNA: An analysis of the generative capacity of specific recombination behaviors. Bull. Math. Biology, 737–759 (1987)Google Scholar
- 5.Pixton, D.: Regularity of splicing languages. Discrete Applied Mathematics, 101–124 (1996)Google Scholar
- 6.Pǎun, G., Rozenberg, G., Salomaa, A.: DNA computing. New computing paradigms. Springer (1998)Google Scholar
- 8.Ellis, C.A.: Probabilistic Languages and Automata. PhD thesis, Department of Computer Science, University of Illinois (1969)Google Scholar
- 9.Fu, K.S., Li, T.: On stochastic automata and languages. Inter. J. Information Sci. (1969)Google Scholar
- 15.Rozenberg, G., Salomaa, A.: Handbook of formal languages, vol. 1-3. Springer (1997)Google Scholar