P Systems Working in the Sequential Mode on Arrays and Strings
Based on a quite general definition of P systems where the rules are applied in a sequential way (and not in the maximally parallel way as it usually happens in most models of P systems considered so far in the literature), we investigate the generative power of various models of such P systems working in the sequential mode on arrays and strings, respectively. P systems working in the sequential mode on arrays/strings without priority relations for the rules reveal the same computational power as the corresponding matrix grammars without appearance checking working on arrays/strings. For obtaining the computational power of matrix grammars with appearance checking, priority relations for the rules (as one of many other possible additional features) are needed.
Unable to display preview. Download preview PDF.
- 1.Dang, Z., Ibarra, O.H.: On P systems operating in sequential mode. In: Ilie, L., Wotschke, D. (eds.) Pre-proceedings of the Workshop Descriptional Complexity of Formal Systems (DCFS) 2004, Report No. 619, pp. 164–177. Univ. of Western Ontario, London, Canada (2004)Google Scholar
- 2.Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)Google Scholar
- 3.Freund, R.: Control mechanisms on #-context-free array grammars. In: Păun, G. (ed.) Mathematical Aspects of Natural and Formal Languages, pp. 97–137. World Scientific Publ., Singapore (1994)Google Scholar
- 4.Freund, R.: Sequential P-systems. Romanian Journal of Information Science and Technology 4(1-2), 77–88 (2001)Google Scholar
- 6.Păun, Gh.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143, and TUCS Research Report 208 (2000), http://www.tucs.fi
- 8.The P Systems Web Page: http://psystems.disco.unimib.it/
- 11.Wang, P.S.-P. (ed.): Array Grammars, Patterns and Recognizers. World Scientific Series in Computer Science, vol. 18. World Scientific Publ., Singapore (1989)Google Scholar