Probabilistic rewriting p systems

International Journal of Foundations of Computer Science

Volumn 14, Issue 1, 2003, Pages 157-166

  Madhu, Mutyam ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

matrix grammars; P systems; probabilistic grammars; programmed grammars; recursively enumerable languages

Indexed keywords

EID: 4344584888     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001649     Document Type: Conference Paper

References (6)

1. J. Dassow and Gh. Paun, Regulated Rewriting in Formal Language Theory (Springer-Verlag, Berlin, 1989).
2. C. Ferretti, G. Mauri, Gh. Paun and C. Zandron, "On Three Variants of P Systems with String-Objects," in P re-Proceedings of Workshop on Membrane Computing (Curtea de Arge§, Romania, August 2001) and Theoretical Computer Science, to appear.
3. R. Freund and Gh. Paun, "On the Number of Non-terminals in Graph-Controlled, Programmed, and Matrix Grammars," in Proceedings of Third International Conference on Machines, Computations and Universality, MCU 2001, eds. M. Margenstern and Y. Rogozhin (Chisinau, Moldova, volume 2055 of LNCS, Springer-Verlag, 2001) pp. 214-225.
4. C. Martin-Vide and Gh. Paun, "String Objects in P systems," in Proc. of Algebraic Systems, Formal Languages and Computations Workshop (RIMS Kokyuroku, Kyoto University, Kyoto, 2000) pp. 161-169.
5. Gh. Paun, "Computing with Membranes," Journal of Computer and System Sciences. 61(1) (2000) 108-143.
6. A. Salomaa, "Probabilistic and Weighted Grammars," Information and Control. 15 (1969) 529-544.