{'fraction_non_alphanumeric': 0.0199203187250996, 'fraction_numerical': 0.0, 'mean_word_length': 5.0602409638554215, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Context-free graph P system

Graph grammar is a rewriting system generating graph languages. Context-free graph grammars are studied developing a theory similar to that of context-free string languages. In this paper we define context-free node replacement graph P system with conditional communication and context-free node replacement graph rewriting P system. Results on the notions such as the minimum number of membranes required to generate a family of context-free graph languages are discussed.