Most Common Words - A cP Systems Solution

Finding the most common words in a text file is a famous “programming pearl”, originally posed by Jon Bentley (1984). 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 efficient solution, 1987). Here we propose a concise efficient solution based on the fast parallel and associative capabilities of cP systems. We also check their parallel sorting capabilities and propose a dynamic version of the classical pigeonhole algorithm.

[1]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[2]  Radu Nicolescu,et al.  Structured Grid Algorithms Modelled with Complex Objects , 2015, Int. Conf. on Membrane Computing.

[3]  Christopher J. Van Wyk,et al.  Literate programming , 1987 .

[4]  Donald E. Knuth,et al.  Literate Programming , 1984, Comput. J..

[5]  Jon Louis Bentley,et al.  Programming pearls: a literate program , 1986, CACM.

[6]  Radu Nicolescu,et al.  Parallel Thinning with Complex Objects and Actors , 2014, Int. Conf. on Membrane Computing.

[7]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[8]  Radu Nicolescu.  Parallel and Distributed Algorithms in P Systems , 2011, Int. Conf. on Membrane Computing.

[9]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[10]  Florentin Ipate,et al.  Programming P Systems with Complex Objects , 2013, Int. Conf. on Membrane Computing.

[11]  Radu Nicolescu.  Revising the Membrane Computing Model for Byzantine Agreement , 2016, Int. Conf. on Membrane Computing.