A literate programming pearl in cP systems

Nicolescu, Radu

dc.contributor.author	Nicolescu, Radu	en
dc.contributor.editor	Gheorghe, M	en
dc.contributor.editor	Konur, S	en
dc.contributor.editor	Lefticaru, R	en
dc.coverage.spatial	Bradford, UK	en
dc.date.accessioned	2018-11-13T23:22:47Z	en
dc.date.issued	2017	en
dc.identifier.uri	http://hdl.handle.net/2292/44219	en
dc.description.abstract	We assess the “computer science” capabilities of our cP systems by solving a version of a famous programming pearl, originally posed by Jon Bentley (1984): printing the most common words in a text ﬁle, in their frequency order. Several interesting solutions have been proposed by Knuth (an exquisite model of literate programming, 1986), McIlroy (an engineering example of combining a timeless set of tools, 1986), Hanson (an alternate eﬃcient solution, 1987). Here we propose a concise eﬃcient solution based on the fast parallel and associative capabilities of cP systems. We also brieﬂy check their sorting capabilities and propose a dynamic version of the classical pigeonhole algorithm.	en
dc.description.uri	http://computing.brad.ac.uk/cmc18/files/CMC18-Program.pdf	en
dc.relation.ispartof	18th International Conference on Membrane Computing (CMC18)	en
dc.relation.ispartofseries	Proceedings of the 18th International Conference on Membrane Computing (CMC18)	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.subject	Literate programming, sorting, parallel sorting, pigeonhole algorithm, dynamic pigeonhole algorithm, associative data structures, membrane computing, P systems, cP systems, inter-cell parallelism, intracell parallelism, Prolog terms and uniﬁcation, complex symbols, nested subcells, generic rules.	en
dc.title	A literate programming pearl in cP systems	en
dc.type	Conference Item	en
pubs.begin-page	273	en
dc.rights.holder	Copyright: The author	en
pubs.author-url	http://computing.brad.ac.uk/cmc18/	en
pubs.end-page	290	en
pubs.finish-date	2017-07-28	en
pubs.start-date	2017-07-24	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/RestrictedAccess	en
pubs.subtype	Conference Paper	en
pubs.elements-id	683859	en
pubs.org-id	Science	en
pubs.org-id	School of Computer Science	en
pubs.record-created-at-source-date	2017-10-05	en