Accepting String Graph Splicing System

Sankar, Meena Parvathy; David, N. G.; Thomas, D. G.

doi:10.1007/978-3-662-45049-9_58

Accepting String Graph Splicing System

Meena Parvathy Sankar¹⁶,
N. G. David¹⁷ &
D. G. Thomas¹⁷

Conference paper

1350 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 472))

Abstract

In this paper, we extend the idea of accepting splicing systems on strings which was introduced by Mitrana et al. to string graphs. The input string graph is accepted as soon as the permitting string graph is obtained provided that no forbidding string graph has been obtained so far, otherwise it is rejected. We study the computational power of the new variants of the accepting string graph splicing system and the interrelationships among them.

This is a preview of subscription content, log in via an institution.

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 39.99; Price excludes VAT (USA)

Softcover Book: USD 54.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)
MATH Google Scholar
Mitrana, V., Dassow, J.: Accepting Splicing Systems with Permitting and Forbidding Words. Acta Informatica 50, 1–14 (2013)
Article MathSciNet MATH Google Scholar
Păun, G.: On the Splicing Operation. Discrete Applied Math 70, 57–79 (1996)
Article MATH Google Scholar
Păun, G., Rozenberg, G., Salomaa, A.: Computing by Splicing. Theoretical Computer Science 168, 321–336
Google Scholar
Rozenberg, G., Salomaa, G.: Handbook of Formal Languages, vol. III. Springer, Berlin (1997)
Book MATH Google Scholar
Freund, R.: Splicing Systems on Graphs. In: Proceedings of Intelligence in Neural and Biological Systems, pp. 189–194. IEEE Press, New York (1995)
Google Scholar

Download references

Author information

Authors and Affiliations

Department of Mathematics, SRM University, Kattankulathur, Chennai, 603 203
Meena Parvathy Sankar
Department of Mathematics, Madras Christian College, Chennai, 600 059
N. G. David & D. G. Thomas

Authors

Meena Parvathy Sankar
View author publications
You can also search for this author in PubMed Google Scholar
N. G. David
View author publications
You can also search for this author in PubMed Google Scholar
D. G. Thomas
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Huazhong University of Science and Technology, 430074, Wuhan, China
Linqiang Pan
Institute of Mathematics of the Romanian Academy, 014700, Bucuresti, Romania
Gheorghe Păun
Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n., 41012, Sevilla, Spain
Mario J. Pérez-Jiménez
School of Automation, Huazhong University of Science and Technology, 430074, Wuhan, China
Tao Song

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Sankar, M.P., David, N.G., Thomas, D.G. (2014). Accepting String Graph Splicing System. In: Pan, L., Păun, G., Pérez-Jiménez, M.J., Song, T. (eds) Bio-Inspired Computing - Theories and Applications. Communications in Computer and Information Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45049-9_58

Download citation

DOI: https://doi.org/10.1007/978-3-662-45049-9_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45048-2
Online ISBN: 978-3-662-45049-9
eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics