Families of Languages Encoded by SN P Systems
In this work, we propose the study of SN P systems as classical information encoders. By taking the spike train of an SN P system as a (binary) source of information, we can obtain different languages according to a previously defined encoding alphabet. We provide a characterization of the language families generated by the SN P systems in this way. This characterization depends on the way we define the encoding scheme: bounded or not bounded and, in the first case, with one-to-one or non injective encodings. Finally, we propose a network topology in order to define a cascading encoder.
KeywordsSN P systems Formal languages Codes Word enumerations
Part of this work appeared as Families of Languages Associated with SN P Systems: Preliminary Ideas, Open Problems. Gh. Păun, J.M. Sempere. Bulletin of the Membrane Computing Society, Issue 2, December 2016, pp. 161–164. http://membranecomputing.net/IMCSBulletin/. The author is indebted to Gh. Păun for his original contribution to this work.
- 2.Chen, H., Ionescu, M., Păun, A., Păun, G., Popa, B.: On trace languages generated by spiking neural P systems. In: Eighth International Workshop on Descriptional Complexity of Formal Systems (DCFS 2006), Las Cruces, New Mexico, USA, pp. 94–105, 21–23 June 2006Google Scholar
- 4.Ibarra, O.H., Leporati, A., Păun, A., Woodworth, S.: Spiking neural P systems. In: Păun, G., Rozenberg, G., Salomaa, A. (eds.) The Oxford Handbook of Membrane Computing, Oxford University Press (2010)Google Scholar
- 6.Manca, V.: On the generative power of iterated transduction. In: Ito, M., Păun, G., Yu, S. (eds.) Words, Semigroups, and Transductions, pp. 315–327. World Scientific (2001)Google Scholar