Abstract
Generally, in rewriting P systems (Martin-Vide and Păun, 2000) one uses Chomsky rules (Hopcroft and Ullman, 1979), whereas in contextual P systems (Madhu and Krithivasan, 2002) we considered contextual rules (Marcus, 1969), (Păun, 1997) for processing string-objects. By combining Chomsky rules and contextual rules, a new class of P systems were introduced in Krishna et al. (2001), the hybrid P systems. In this paper we continue the study of hybrid P systems, and show that systems with two membranes are universal in the case of contextual rules with a regular choice, and systems with four membranes are universal in the case of contextual rules with finite selection.
Similar content being viewed by others
References
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA, 1979.
S.N. Krishna, K. Lakshmanan, and R. Rama. Hybrid P Systems. Romanian Journal of Information Science and Technology, 4(1): 111–124, 2001.
M. Madhu and K. Krithivasan. Contextual P Systems. Fundamenta Informaticae, 49(1-3): 179–189, 2002.
S. Marcus. Contextual Grammars. Revue Roumaine des Mathématiques Pures et Appliquées, 14: 1525–1534, 1969.
C. Martin-Vide and Gh. Păun. String Objects in P Systems. In Proceedings of Algebraic Systems, Formal Languages and Computations Workshop, 161-169, RIMS Kokyuroku, Kyoto University, Kyoto, 2000.
Gh. Păun. Marcus Contextual Grammars. Kluwer, Dordrecht, 1997.
Gh. Păun. Computing with Membranes. Journal of Computer and System Sciences, 61(1): 108–143, 2000.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Madhu, M., Krithivasan, K. A Note on Hybrid P Systems. Grammars 5, 239–244 (2002). https://doi.org/10.1023/A:1022172312591
Issue Date:
DOI: https://doi.org/10.1023/A:1022172312591