Abstract
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.
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
Adleman, L.: Molecular computation of solutions to combinatorial problems. Science, 1021–1024 (November 11, 1994)
Lipton, R.J.: Using DNA to solve NP–complete problems. Science, 542–545 (April 28, 1995)
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)
Head, T.: Formal language theory and DNA: An analysis of the generative capacity of specific recombination behaviors. Bull. Math. Biology, 737–759 (1987)
Pixton, D.: Regularity of splicing languages. Discrete Applied Mathematics, 101–124 (1996)
Pǎun, G., Rozenberg, G., Salomaa, A.: DNA computing. New computing paradigms. Springer (1998)
Booth, T., Thompson, R.: Applying probability measures to abstract languages. IEEE Transactions on Computers 22, 442–450 (1973)
Ellis, C.A.: Probabilistic Languages and Automata. PhD thesis, Department of Computer Science, University of Illinois (1969)
Fu, K.S., Li, T.: On stochastic automata and languages. Inter. J. Information Sci. (1969)
Rabin, M.: Probabilistic automata. Information and Control 6, 230–245 (1963)
Salomaa, A.: Probabilistic and weighted grammars. Information and Control 15, 529–544 (1969)
Smith, N., Johnson, M.: Weighted and probabilistic context-free grammars are equally expressive. IEEE Transactions on Computers 33, 477–491 (2007)
Kornai, A.: Probabilistic grammars and languages. Journal of Logic, Language and Information 20, 317–328 (2011)
Fowler, T.: The Generative Power of Probabilistic and Weighted Context-Free Grammars. In: Kanazawa, M., Kornai, A., Kracht, M., Seki, H. (eds.) MOL 12. LNCS, vol. 6878, pp. 57–71. Springer, Heidelberg (2011)
Rozenberg, G., Salomaa, A.: Handbook of formal languages, vol. 1-3. Springer (1997)
Dassow, J., Pǎun, G.: Regulated rewriting in formal language theory. Springer, Berlin (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turaev, S., Selvarajoo, M., Selamat, M.H., Sarmin, N.H., Fong, W.H. (2013). Probabilistic Splicing Systems. In: Nguyen, N., Trawiński, B., Katarzyniak, R., Jo, GS. (eds) Advanced Methods for Computational Collective Intelligence. Studies in Computational Intelligence, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34300-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-34300-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34299-8
Online ISBN: 978-3-642-34300-1
eBook Packages: EngineeringEngineering (R0)