Abstract
A recurrent formula for enumerating membrane structures is given. It is deduced by elementary combinatorial methods, by providing a simplification with respect to a classical formula for the enumeration of trees, which is based on the analytical method of generating functions.
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
Aigner, M.: Discrete Mathematics. American Mathematical Society (2007)
Cayley, A.: On the analytical forms called trees, with application to the theory of chemical combinations. Mathematical Papers 9, 427–460 (1875)
Conway, J.H., Guy, R.K.: The Book of Numbers. Springer, Heidelberg (1996)
Knuth, D.: The Art of Computer Programming. Fundamental Algorithms, vol. 1. Addison Wesley, Reading (1968)
Otter, R.: The number of trees. The Annals of Mathematics 2nd Ser., 49, 583–599 (1948)
Păun, G.: Personal Communication (October 1998)
Păun, G.: Computing with membranes. J. Comput. System Sci. 61, 108–143 (2000)
Sloane, N.J.A.: The on-line encyclopedia of integer sequences. Notices of The American Mathematical Society 59, 912–915 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manca, V. (2009). Enumerating Membrane Structures. In: Corne, D.W., Frisco, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2008. Lecture Notes in Computer Science, vol 5391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95885-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-95885-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-95884-0
Online ISBN: 978-3-540-95885-7
eBook Packages: Computer ScienceComputer Science (R0)