- On the Power of Circular Splicing Systems and DNA Computability
- Identifying Unrecognizable Regular Languages by Claudio Ferretti --Giancarlo Mauri
- Identifying Regular Languages over PartiallyCommutative Monoids
- Universality and normal forms on membrane C. Zandron, G. Mauri, C. Ferretti
- An Appendix to NCTR95030 Claudio Ferretti
- DNA SPLICING SYSTEMS AND POST SYSTEMS C. FERRETTI, a S. KOBAYASHI
- Nine Test Tubes Generate any RE Language C. Ferretti, G. Mauri, C. Zandron
- Splicing systems using merge and separate operations C. Zandron, G. Mauri, C. Ferretti, P. Bonizzoni
- Simulating Turing machines through extended P. Frisco, G. Mauri, C. Ferretti
- Splicing systems with marked rules P. Bonizzoni, C. Ferretti, G. Mauri
- Solving NP Complete Problems Using P Systems with Active Membranes
- A Reduced Distributed Splicing System for RE C. Zandron, C. Ferretti, G. Mauri
- On Three Variants of Rewriting P Systems Claudio FERRETTI a , Giancarlo MAURI a ,
- Splicing on Treelike Structures Yasubumi Sakakibara
- Learning Parallel Systems by Regular Trace Languages
- Two Normal Forms for Rewriting P Systems C. Zandron, C. Ferretti, G. Mauri
- On the Universality of Post and Splicing Systems C. FERRETTI 1 , G. MAURI
- Approximation of Optimization Problems and Learnability
- Labels Transformations and New Distance Measures
- Separating some splicing models P. Bonizzoni, G. Mauri, C. Ferretti, R. Zizza
- Nine Test Tubes Generate any RE Language C. Ferretti, G. Mauri, C. Zandron
- DNA Splicing Systems based on Post Systems C. FERRETTI 1 , S. KOBAYASHI 2 and T. YOKOMORI 3
- Identifying Regular Languages over PartiallyCommutative Monoids
