Publications

     Papers Published in Refereed Journals:
 

1.       S. Cheruku, A. Paun, F.J.  Romero-Campero, M.J. Perez-Jimenez, O.H. Ibarra; Simulating FAS-induced apoptosis by using P systems. Progress in Natural Science, to appear 2007.

2.       A. Paun, B. Popa; P Systems with Proteins on Membranes. Fundamenta Informaticae, 72, 4, 2006, 467-483.

3.       C. Campeanu, A. Paun, J.R. Smith, Incremental construction of minimal deterministic finite cover automata. Theoretical Computer Science, 363(2), 2006, 135-148

4.       R. Freund, M. Oswald, A. Paun, Optimal Results for the Computational Completeness of Gemmating (Tissue) P Systems,  International Journal of Foundations of Computer Science, 16(5), (2005), pp. 929-942.

5.       C. Campeanu, L. Kari, A. Paun, Results on Transforming NFA into DFCA, Fundamenta Informaticae, Vol 64 (2005), 53-63.

6.       R. Freund, A. Paun, P systems with active membranes and without polarizations, Journal of Universal Computer Science and Soft Computing, 9 (9), (2005), pp.657-663.

7.       S.N. Krishna, A. Paun, Results on Catalytic and Evolution-Communication P Systems, New Generation Computing, 22, 4 (2004), pp. 377-394.

8.       C. Campeanu, A. Paun, Counting the Number of Minimal DFCA Obtained by Merging States, International Journal of Foundations of Computer Science, Vol. 14, No. 6 (2003), pp. 995-1006.

9.       R. Belu, A. Paun, A. Belu, Neural Networks in Instrumentation, Measurement and Control, Romanian Journal of Information Science and Technology, Vol. 6, No. 1-2, (2003), pp. 61-85.

10.   M. Ionescu, C. Martín-Vide, A. Paun, Gh. Paun, Unexpected universality results for three classes of P systems with symport/antiport, Natural Computing, Vol. 2, issue 4, (2003), pp. 337-348.

11.    A. Paun, Gh. Paun, G. Rozenberg, Computing by Communication in Networks of Membranes, International Journal of Foundations of Computer Science, Vol. 13, No. 6 (2002), pp. 779-798.

12.   C. Martin-Vide, A. Paun, Gh. Paun, G. Rozenberg, Membrane Systems with Coupled Transport: Universality and Normal Forms, Fundamenta Informaticae, 49, 1-3 (2002), pp. 1-15.

13.   A. Paun, Gh. Paun, The Power of Communication: P Systems with Symport /Antiport, New Generation Computing, 20, 3 (2002), pp. 295-305.

14.   A. Paun, P Systems with Global Rules, Theory Comput. Systems, 35, (2002), pp. 471-481.

15.   C. Campeanu, A. Paun, S. Yu, An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages, International Journal of Foundations of Computer Science, 13, 1 (2002), pp. 83-97.

16.   A. Paun, On P Systems with Partial Parallel Rewriting, Romanian Journal of Information Science and Technology, 4, 1-2 (2001), pp. 203-210.

17.   A. Paun, On the Diameter of Various Classes of H Systems, J. Automata, Languages and Combinatorics, 5, 3 (2000), pp. 315-324.

18.   A. Paun, Controlled H Systems of a Small Radius, Fundamenta Informaticae, 31, 2 (1997), pp. 185-193.

   Refereed Conference Publications:
 

1.       A. Paun, B. Popa, P Systems with Proteins on Membranes and Membrane Division, Proc of. Tenth International Conference Developments in Language Theory (DLT 2006), June 26-29, 2006, Santa Barbara, CA, USA, pp. 292-303

2.       H. Nagda, A. Paun, A. Rodriguez-Paton, P Systems with Symport/Antiport and Time, Proc. of Workshop on Membrane Computing (at the crossroads of Cell Biology and Computing), WMC07, 17-21 July 2006, pp. 429-442.

3.       C. Campeanu, A. Paun, J. R. Smith, Tight Bounds for the State Complexity of Deterministic Cover Automata, Proc. of Descriptional Complexity of Formal Systems, 8th Workshop, June 21-23, 2006, Las Cruces, New Mexico, USA (9 pages).

4.       M. Ionescu, A. Paun, Gh. Paun, M.J. Pérez-Jiménez, Computing with Spiking Neural P Systems: Traces and Small Universal Systems, Proc. of 12th Intern. Meeting on DNA Based Computers (DNA 2006), June 5-9, Seoul, Korea, pp. 1-16.

5.       O.H. Ibarra, S. Woodworth, F. Yu, A. Paun, On Spiking Neural P Systems and Partially Blind Counter Machines. Proc. Of 5th International Conference on Unconventional Computation (UC 2006), 4th-8th September 2006, York, UK, pp. 113-129.

6.       C. Campeanu, A. Paun, J.R. Smith, An Incremental Algorithm for Minimal Deterministic Finite Cover Automata, Proc. of Tenth International Conference on Implementation and Application of Automata (CIAA05), June 27–29, 2005, Sophia Antipolis, France, (12 pages); (the conference had approximately 30% acceptance rate).

7.       O.H. Ibarra, A. Paun, Counting Time in Computing with Cells, DNA11 conference, June 6-9, 2005, London Ontario, Canada, (14 pages).

8.       C. Campeanu, A. Paun, NFA to DFCA Transformations For Binary Alphabets, Proc. of Ninth International Conference on Implementation and Application of Automata (CIAA 2004), Kingston, Canada (2004).

9.      C. Campeanu, A. Paun, Lower Bounds for NFA to DFCA Transformations, Proc. of Descriptional Complexity of Formal Systems, 6th Workshop, London, Ontario, Canada (2004) (10 pages).

10.   R. Freund, M. Oswald, A. Paun, Extended Gemmating P Systems are Computationally Complete with Four Membranes, Proc. of Descriptional Complexity of Formal Systems, 6th Workshop, London, Ontario, Canada (2004) (10 pages).

11.    R. Freund, M. Oswald, A. Paun, P systems generating trees, Proc. of Workshop on Membrane Computing 2004 (WMC5), Milano, Italy, 2004, pp. 221-232 also in Lecture Notes in Computer Science, 3365, Berlin, (2004), pp. 309-319.

12.   C. Campeanu, A. Paun, Computing Beyond the Turing Limit Using the H Systems, Pre-Proceedings of the Tenth International Meeting on DNA Computing (DNA10), Milan, (2004), pp. 314-323 also in Lecture Notes in Computer Science, 3384, Berlin, (2005), pp. 24-34.

13.   F. Bernardini, A. Paun, Universality of Minimal Symport/Antiport: Five Membranes Suffice, Lecture Notes in Computer Science, 2933, Berlin, (2004), pp. 43-54.

14.   R. Freund, A. Paun, Membrane Systems with Symport/Antiport: Universality Results, Lecture Notes in Computer Science, 2597, Berlin, (2003), pp. 270-287.

15.   C. Campeanu, A. Paun, The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata, Proc. of Seventh International Conference on Implementation and Application of Automata (CIAA 2002), Tours, France, 2002, pp. 71-80.

16.   M. Ionescu, C. Martin-Vide, A. Paun, Gh. Paun, Membrane Systems with Symport/Antiport: (Unexpected) Universality Results, Proc. of 8th Intern. Meeting on DNA Based Computers (DNA8) (M. Hagiya, A. Obuchi, eds.), Hokkaido University, Sapporo, Japan, 2002, pp. 151-160.

17.   A. Paun, P Systems with string-objects: Universality results, Proc. of Workshop on Membrane Computing (WMC-CdeA 2001), Curtea-de-Arges, Romania, 2001, pp. 229-242.

18.   A. Paun, On P Systems with Global Rules. Proc. of 7th Intern. Meeting on DNA Based Computers (DNA7) (N. Jonoska, N.C. Seeman, eds.), Tampa, Florida, USA, 2001, pp. 43-52.

19.   A. Paun, On P Systems with Active Membranes, Proc. of UMC2K, in Discrete Mathematics and Theoretical Computer Science, Springer (I. Antoniou, C.S. Calude, M.J. Dinneen, eds.), Brussels, Belgium, 2000, pp. 187-201.

20.   A. Paun, N. Santean, S. Yu, An O(n²) Algorithm for Constructing Minimal Cover Automata for Finite Languages, Proc. of Fifth International Conference on Implementation and Application of Automata (CIAA 2000) (M. Daley, M. Eramian, S. Yu, eds.), London, Ontario, 2000, pp. 233-241.

21.   A. Paun, On the Diameter of Various Classes of H Systems, Proc. of Intern. Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS '99) (J. Dassow, D. Wotschke, eds.), Magdeburg, Germany, 1999, pp. 165-174.

22.   A. Paun, M. Paun, State and Transition Complexity of Watson-Crick Finite Automata, Proc. of Fundamentals of Computation Theory Conf. (FCT'99) Iasi, 1999, Lecture Notes in Computer Science, 1684, Springer-Verlag, Berlin, 1999, pp. 409-420.

23. A. Paun, M. Paun, Controlled and Distributed H Systems of a Small Radius, Computing with Bio-Molecules; Theory and Experiments, Springer, Singapore, 1998, pp. 239-254.

   Others:

1.       L. Kari, C. Martin-Vide, A. Paun, On the Universality of P Systems with Minimal Symport/Antiport Rules, Lecture Notes in Computer Science, 2950, Berlin, (2004), pp. 254-265.

2.       R. Freund, A. Paun, P Systems with Active Membranes and without Polarizations, Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla Tech. Rep 01/2004, Second Brainstorming Week on Membrane Computing, Sevilla, Spain, Feb 2-7, 2004, pp. 193-205.

3.       S.N. Krishna, A. Paun, Some Universality Results on Evolution-Communication P Systems, Rovira i Virgili Univ., Tech. Rep. No. 26, Brainstorming Week on Membrane Computing; Tarragona, 2003, pp. 207-215.

4.       S.N. Krishna, A. Paun, Three Universality Results on P Systems, Rovira i Virgili Univ., Tech. Rep. No. 26, Brainstorming Week on Membrane Computing; Tarragona, 2003, pp. 198-206.

5.       C. Martin-Vide, A. Paun, Gh. Paun, Membrane Computing: New Results, New Problems, Bulletin of the EATCS, 78 (2002), pp. 204-212.

6.       L. Kari, A. Paun, String Operations Suggested by DNA Biochemistry: the Balanced Cut Operation, Words, Semigroups & Transductions (M. Ito, et. al., eds.), World Scientific, Singapore, 2001, pp. 275-287.

7.       A. Paun, Gh. Paun, A. Rodriguez-Paton, Further Remarks on P Systems with Symport Rules, An. Stiint. Univ. Al. I. Cuza Iasi Inform.  10 (2001), pp. 3-18.

8.       A. Paun, M. Paun, On the Membrane Computing Based on Splicing, Where Mathematics, Computer Science, Linguistics and Biology Meet  (C. Martin-Vide, V. Mitrana, eds.), Kluwer, Dordrecht, 2001, pp. 409-422.

9.       A. Paun, On Time-Varying H systems, Bulletin of the EATCS, 67 (1999), pp. 157-164.

  Books Edited and Book Chapters:
 

1.       O.H. Ibarra, A. Paun, Membrane Systems: A “Natural” Way of Computing with Cells, invited book-chapter to be published by CRC Press (under the Computer and Information Science Series) 26 pages to appear 2007.

2.       S. Yu, A. Paun, eds., Implementation and Application of Automata, Lecture Notes in Computer Science 2088, Springer-Verlag, Berlin, 2001.