Abstract
In this paper we introduce a new variant of splicing systems, called weighted splicing systems, and establish some basic properties of language families generated by this type of splicing systems. We show that a simple extension of splicing systems with weights can increase the computational power of splicing systems with finite components. © 2012 Springer-Verlag.
Cite
CITATION STYLE
APA
Turaev, S., Gan, Y. S., Othman, M., Sarmin, N. H., & Fong, W. H. (2012). Weighted splicing systems. In Communications in Computer and Information Science (Vol. 316 CCIS, pp. 416–424). https://doi.org/10.1007/978-3-642-34289-9_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free