Published March 11, 2016 | Version v1
Publication

A Class of P Automata for Characterizing Context-free Languages

Description

We present a characterization of context-free languages in terms of a restricted class of P automata (P systems accepting strings of symbols using symport/antiport communication rules). The characterization is based on the form of the rules used by the system.

Additional details

Created:
December 4, 2022
Modified:
November 28, 2023