Search for Author All Reviews
	Salomaa, Arto     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 12 reviews       Rainbow of computer science: dedicated to Hermann Maurer on the occasion of his 70th birthday (LNCS 6570) Calude C., Rozenberg G., Salomaa A. Springer-Verlag, Berlin, Germany, 2011.  Type: Divisible Book In the tradition of all Festschriften, this volume in tribute to Hermann Maurer collects short contributions on a variety of topics of particular relevance to the honoree. Given the diversity of Maurer’s published work, these...... Dec 5 2011     The Oxford handbook of membrane computing Paun G., Rozenberg G., Salomaa A., Oxford University Press, Inc., New York, NY, 2010. 696 pp.  Type: Book (978-0-199556-67-0) Biology as computation is a paradigm that has been explored many times over the years. Amongst these attempts, the theory of P systems has been one of the most successful, and this handbook showcases the many ramifications of this appr...... Jan 27 2011     Algorithmic bioprocesses Condon A., Harel D., Kok J., Salomaa A., Winfree E., Springer Publishing Company, Incorporated, New York, NY, 2009. 742 pp.  Type: Book (978-3-540888-68-0) Grzegorz Rozenberg, a pioneer in the area of natural computing--the area of informatics that studies computational models where computer science and biological processes overlap--is honored in this festschrift....... Jun 3 2010     Subword histories and Parikh matrices Mateescu A., Salomaa A., Yu S. Journal of Computer and System Sciences 68(1): 1-21, 2004.  Type: Article A subword history is an arithmetic expression involving sums, products, and integer multiples of quantities, representing the number of occurrences, including overlaps, of various subwords of a string. In this context, “subwo...... Sep 16 2004     Slender 0L languages Nishida T., Salomaa A. Theoretical Computer Science 158(1-2): 161-176, 1996.  Type: Article Two concepts about 0L systems G = ( σ, τ, w ) and their languages L ( G ) = { τ * ( w ) } are the focus of this paper. A language L &...... May 1 1997     Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy