Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Control Words of Transition P Systems
verfasst von : Ajeesh Ramanujan, Kamala Krithivasan
Erschienen in: Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012)
Verlag: Springer India
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A new way of associating a language with the computation of a P system is considered. A label is assigned to every rule in a P system, where the labels are chosen from a finite alphabet or
$$\lambda .$$
We associate a string, called control word, that is obtained by concatenating the labels of the rules in the transition sequence corresponding to a computation. We study the generative capacity of such control languages comparing them with family of languages such as regular, context-free, context-sensitive and recursively enumerable languages of Chomskian hierarchy.