1. Baker, H.G.: Rabin’s proof of the undecidability of the reachability set inclusion problem for vector addition systems. In: C.S.C. Memo 79, Project MAC. MIT, Cambridge (1973)
2. Calude, C.S., Paun, G.: Computing with cells and atoms: after five years (New text added to Russian edition of the book with the same title first published by Taylor and Francis Publishers, London, 2001). To be published by Pushchino Publishing House (2004)
3. Csuhaj-Varju, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) Proc. DNA 10, Univ. Milano-Bicocca, pp. 97–106 (2004)
4. Dang, Z., Ibarra, O.H.: On P systems operating in sequential mode. In: Pre-Proc. 6th Workshop on Descriptional Complexity of Formal Systems (2004)
5. Lecture Notes in Computer Science;J. Esparza,1995