Skip to main content
Springer Nature Link
Log in

A Recurrent Enumeration of Free Hypermultisets

  • Chapter
Computation, Cooperation, and Life

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6610))

  • 351 Accesses

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

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cayley, A.: On the analytical forms called trees, with application to the theory of chemical combinations. Mathematical Papers 9, 427–460 (1875)

    Google Scholar 

  2. Hardy, G.H., Ramanujan, S.: Asymptotic Formulae in Combinatory Analysis. Proc. London Math. Soc. 17, 75–115 (1918)

    Article  MATH  Google Scholar 

  3. Knuth, D.: The Art of Computer Programming. Fundamental Algorithms, vol. 1. Addison Wesley, Reading (1968)

    MATH  Google Scholar 

  4. Manca, V.: Enumerating Membrane Structures. In: Corne, D., et al. (eds.) WMC 2008. LNCS, vol. 5391, pp. 292–298. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Otter, R.: The Number of Trees. The Annals of Mathematics, 2nd Ser. 49(3), 583–599 (1948)

    Article  MathSciNet  MATH  Google Scholar 

  6. Păun, G.: Personal Communication (October 1998)

    Google Scholar 

  7. Păun, G.: Membrane Computing: an introduction. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  8. Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. Notices of The American Mathematical Society 59(8), 912–915 (2003)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Verona, Italy

    Vincenzo Manca

Authors
  1. Vincenzo Manca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Silesian University, 74601, Opava, Czech Republic

    Jozef Kelemen  & Alica Kelemenová  & 

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics