We continue here the study of P systems with string objects processed by rewriting rules, by investigating some questions which are classic in formal language theory: leftmost derivation, conditional use of rules (permitting and forbidding conditions), relationships with language families in Chomsky and Lindenmayer hierarchies.
Ferretti, C., Mauri, G., Paun, G., Zandron, C. (2003). On three variants of rewriting P systems. THEORETICAL COMPUTER SCIENCE, 301(1-3), 201-215 [10.1016/S0304-3975(02)00581-9].
On three variants of rewriting P systems
FERRETTI, CLAUDIO;MAURI, GIANCARLO;ZANDRON, CLAUDIO
2003
Abstract
We continue here the study of P systems with string objects processed by rewriting rules, by investigating some questions which are classic in formal language theory: leftmost derivation, conditional use of rules (permitting and forbidding conditions), relationships with language families in Chomsky and Lindenmayer hierarchies.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
