Abstract
A recurrent formula enumerating unlabeled membrane structures is presented, which is deduced by means of elementary combinatorial arguments by considering them as hypermultisets built from the empty set.
This is a preview of subscription content, log in via an institution to check access.
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
Cayley, A.: On the analytical forms called trees, with application to the theory of chemical combinations. Mathematical Papers 9, 427–460 (1875)
Hardy, G.H., Ramanujan, S.: Asymptotic Formulae in Combinatory Analysis. Proc. London Math. Soc. 17, 75–115 (1918)
Knuth, D.: The Art of Computer Programming. Fundamental Algorithms, vol. 1. Addison Wesley, Reading (1968)
Manca, V.: Enumerating Membrane Structures. In: Corne, D., et al. (eds.) WMC 2008. LNCS, vol. 5391, pp. 292–298. Springer, Heidelberg (2009)
Otter, R.: The Number of Trees. The Annals of Mathematics, 2nd Ser. 49(3), 583–599 (1948)
Păun, G.: Personal Communication (October 1998)
Păun, G.: Membrane Computing: an introduction. Springer, Heidelberg (2002)
Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. Notices of The American Mathematical Society 59(8), 912–915 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Manca, V. (2011). A Recurrent Enumeration of Free Hypermultisets. In: Kelemen, J., Kelemenová, A. (eds) Computation, Cooperation, and Life. Lecture Notes in Computer Science, vol 6610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20000-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-20000-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19999-8
Online ISBN: 978-3-642-20000-7
eBook Packages: Computer ScienceComputer Science (R0)