Dtx (#1)

* Update to v0.12, the first .dtx version

* Finish documentation for v0.12

.gitignore

@@ -4,6 +4,7 @@
 #Except for the few things that I want included
 !cpsystems.ins
 !cpsystems.dtx
+!cpsystems.bib
 !cpsystems.sty
 !cpsystems.pdf
 !README.md

README.md

@@ -1,2 +1,6 @@
 # LaTeX-cP-systems
 A LaTeX package to aid typesetting of cP systems, a Membrane Computing variant created by Nicolescu & collaborators
+
+To use this package, either install the sty file to your local LaTeX distribution's package repository (please refer to your distribution's documentation for more details on this), or simply include the .sty file in the top level of the document you are current working on.  If you are using Overleaf or a similar online editor, the latter option will probably be required, since this package isn't currently available on CTAN.
+
+To learn more about cP systems, please see [*An Introduction to cP systems* by Nicolescu and Henderson (2018)](https://doi.org/10.1007/978-3-030-00265-7_17)

README.txt

@@ -0,0 +1,35 @@
+%%
+%% This is file `README.txt',
+%% generated with the docstrip utility.
+%%
+%% The original source files were:
+%%
+%% cpsystems.dtx  (with options: `readme')
+%% 
+%% This is a generated file.
+%% 
+%% Copyright (C) 2019 by James Cooper, University of Auckland <jcoo092@aucklanduni.ac.nz>
+%% --------------------------------------------------------------------------
+%% This work may be distributed and/or modified under the
+%% conditions of the LaTeX Project Public License, either version 1.3
+%% of this license or (at your option) any later version.
+%% The latest version of this license is in
+%%   http://www.latex-project.org/lppl.txt
+%% and version 1.3 or later is part of all distributions of LaTeX
+%% version 2005/12/01 or later.
+%% 
+%%cpsystems LaTeX package
+%%Copyright (C) 2019 by James Cooper, University of Auckland <jcoo092@aucklanduni.ac.nz>
+%%
+%%The goal of this work is to provide a self-contained, easy-to-use LaTeX package that eases the typesetting of cP systems, a variant of Membrane Computing/P systems created by Dr. Radu Nicolescu and collaborators in the early 2010s.  Please refer to the package documentation for instructions on its use.  To the best of my knowledge, it is compatible with all LaTeX2e distributions which are reasonably up-to-date, as well as all classes (and likely all or almost all packages) that are typically used for publishing material on P systems.
+%%
+%%For more on cP systems, please see for example:  Nicolescu, R., & Henderson, A. (2018). An Introduction to cP Systems. In C. Graciani, A. Riscos-Núñez, G. Păun, G. Rozenberg, & A. Salomaa (Eds.), Enjoying Natural Computing: Essays Dedicated to Mario de Jesús Pérez-Jiménez on the Occasion of His 70th Birthday (pp. 204–227). https://doi.org/10.1007/978-3-030-00265-7_17
+%%
+%%This work consists of the file cpsystems.dtx, cpsystems.ins and their derived products cpsystems.sty, cpsystems.pdf and this README.  The `canonical' version of this work is currently to be found at https://github.com/jcoo092/LaTeX-cP-systems/
+%%
+%%Constructive pull requests, creation of issues for bugs, and suggestions for improvements are very welcome.
+%%
+%%This package was originally created to assist me while writing a paper on cP systems which should also largely re-appear in my PhD dissertation.  While you are certainly free to peruse and use this package, if you don't know what Membrane Computing/P systems is, this package is unlikely to be of much use to you.
+\endinput
+%%
+%% End of file `README.txt'.

cpsystems.bib

@@ -0,0 +1,43 @@
+@incollection{Nicolescu2018,
+abstract = {We overview the current state of cP systems and illustrate it with a series of old and new examples, intentionally simple, but fundamental in their areas. cP systems -- i.e. P systems with compound terms -- share the fundamental features of traditional cell-like (tree-based) and tissue (graph-based) P systems: unlimited space and computing power, cells, nested cells, multisets, messages, rewriting rules, possibly running in maximal parallel modes. In contrast to traditional P systems, inner nested cells do not have their own rulesets. However, this restriction is usually more than compensated by their significant extensions: compound Prolog-like terms, high-level rules, control on incoming messages. Additionally, the same rulesets can run in either synchronous or asynchronous mode, without any syntactic change. cP systems have been successfully used to model quite a few fundamental and real-life problems, e.g. in NP complexity, data structures, graph theory, distributed algorithms, image processing. As trademark, cP models use fixed sized alphabets and crisp rulesets, independent of the problem size. The samples cover a wide variety of areas, such as arithmetic, list structures, summary statistics and sorting, asynchronous communications, {\$}{\$}$\backslash$mu {\$}{\$}{\$}\mu{\$}-recursive functions.},
+address = {Cham},
+author = {Nicolescu, Radu and Henderson, Alec},
+booktitle = {Enjoying Natural Computing: Essays Dedicated to Mario de Jes{\'{u}}s P{\'{e}}rez-Jim{\'{e}}nez on the Occasion of His 70th Birthday},
+doi = {10.1007/978-3-030-00265-7_17},
+editor = {Graciani, Carmen and Riscos-N{\'{u}}{\~{n}}ez, Agust{\'{i}}n and Păun, Gheorghe and Rozenberg, Grzegorz and Salomaa, Arto},
+isbn = {978-3-030-00265-7},
+number = {11270},
+pages = {204--227},
+publisher = {Springer International Publishing},
+series = {Lecture Notes in Computer Science},
+title = {{An Introduction to cP Systems}},
+url = {https://doi.org/10.1007/978-3-030-00265-7{\_}17},
+year = {2018}
+}
+
+@book{Paun2002,
+address = {Berlin, Heidelberg},
+author = {Păun, Gheorghe},
+doi = {10.1007/978-3-642-56196-2},
+isbn = {978-3-540-43601-0},
+publisher = {Springer Berlin Heidelberg},
+series = {Natural Computing Series},
+title = {{Membrane Computing}},
+url = {http://link.springer.com/10.1007/978-3-642-56196-2},
+year = {2002}
+}
+
+@article{Cooper2019,
+author = {Cooper, James and Nicolescu, Radu},
+doi = {10.3233/FI-2019-1760},
+editor = {Pan, Linqiang and P{\'{e}}rez-Jim{\'{e}}nez, Mario J. and Zhang, Gexiang},
+issn = {01692968},
+journal = {Fundamenta Informaticae},
+month = {Jan},
+number = {2-3},
+pages = {157--180},
+title = {{The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems}},
+url = {https://www.medra.org/servlet/aliasResolver?alias=iospress{\&}doi=10.3233/FI-2019-1760},
+volume = {164},
+year = {2019}
+}