Andrei Paun

2008
46	EE	Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun: On spiking neural P systems and partially blind counter machines. Natural Computing 7(1): 3-19 (2008)
45	EE	Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj, Andrei Paun, Gheorghe Paun, Mario J. Pérez-Jiménez: Spiking neural P systems with extended rules: universality and languages. Natural Computing 7(2): 147-166 (2008)
2007
44	EE	Andrei Paun, Alfonso Rodríguez-Patón: On Flip-Flop Membrane Systems with Proteins. Workshop on Membrane Computing 2007: 414-427
43	EE	Andrei Paun: On the Hopcroft's minimization algorithm CoRR abs/0705.1986: (2007)
42	EE	Oscar H. Ibarra, Andrei Paun, Gheorghe Paun, Alfonso Rodríguez-Patón, Petr Sosík, Sara Woodworth: Normal forms for spiking neural P systems. Theor. Comput. Sci. 372(2-3): 196-217 (2007)
2006
41	EE	Mihai Ionescu, Andrei Paun, Gheorghe Paun, Mario J. Pérez-Jiménez: Computing with Spiking Neural P Systems: Traces and Small Universal Systems. DNA 2006: 1-16
40	EE	Andrei Paun, Bianca Popa: P Systems with Proteins on Membranes and Membrane Division. Developments in Language Theory 2006: 292-303
39	EE	Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun: On Spiking Neural P Systems and Partially Blind Counter Machines. UC 2006: 113-129
38	EE	Andrei Paun, Mario J. Pérez-Jiménez, Francisco José Romero-Campero: Modeling Signal Transduction Using P Systems. Workshop on Membrane Computing 2006: 100-122
37	EE	Hitesh Nagda, Andrei Paun, Alfonso Rodríguez-Patón: P Systems with Symport/Antiport and Time. Workshop on Membrane Computing 2006: 463-476
36	EE	Andrei Paun, Bianca Popa: P Systems with Proteins on Membranes. Fundam. Inform. 72(4): 467-483 (2006)
35	EE	Cezar Câmpeanu, Andrei Paun, Jason R. Smith: Incremental construction of minimal deterministic finite cover automata. Theor. Comput. Sci. 363(2): 135-148 (2006)
2005
34	EE	Cezar Câmpeanu, Andrei Paun, Jason R. Smith: An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. CIAA 2005: 90-103
33	EE	Oscar H. Ibarra, Andrei Paun: Counting Time in Computing with Cells. DNA 2005: 112-128
32	EE	Cezar Câmpeanu, Lila Kari, Andrei Paun: Results on Transforming NFA into DFCA. Fundam. Inform. 64(1-4): 53-63 (2005)
31	EE	Rudolf Freund, Marion Oswald, Andrei Paun: Optimal results for the computational completeness of gemmating (tissue) P systems. Int. J. Found. Comput. Sci. 16(5): 929-942 (2005)
30	EE	Rudolf Freund, Andrei Paun: P systems with active membranes and without polarizations. Soft Comput. 9(9): 657-663 (2005)
2004
29	EE	Lila Kari, Carlos Martín-Vide, Andrei Paun: On the Universality of P Systems with Minimal Symport/Antiport Rules. Aspects of Molecular Computing 2004: 254-265
28	EE	Cezar Câmpeanu, Andrei Paun: Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. CIAA 2004: 306-307
27	EE	Cezar Câmpeanu, Andrei Paun: Computing Beyond the Turing Limit Using the H Systems. DNA 2004: 24-34
26	EE	Rudolf Freund, Marion Oswald, Andrei Paun: P Systems Generating Trees. Workshop on Membrane Computing 2004: 309-319
25	EE	Shankara Narayanan Krishna, Andrei Paun: Results on Catalytic and Evolution-Communication P Systems. New Generation Comput. 22(4): (2004)
2003
24	EE	Francesco Bernardini, Andrei Paun: Universality of Minimal Symport/Antiport: Five Membranes Suffice. Workshop on Membrane Computing 2003: 43-54
23	EE	Cezar Câmpeanu, Andrei Paun: Counting The Number Of Minimal Dfca Obtained By Merging States. Int. J. Found. Comput. Sci. 14(6): 995-1006 (2003)
22	EE	Mihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun: Unexpected universality results for three classes of P systems with symport/antiport. Natural Computing 2(4): 337-348 (2003)
2002
21	EE	Cezar Câmpeanu, Andrei Paun: The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. CIAA 2002: 67-76
20	EE	Mihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun: Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport. DNA 2002: 281-290
19	EE	Rudolf Freund, Andrei Paun: Membrane Systems with Symport/Antiport Rules: Universality Results. WMC-CdeA 2002: 270-287
18		Carlos Martín-Vide, Andrei Paun, Gheorghe Paun: Membrane Computing: New Results, New Problems. Bulletin of the EATCS 78: 204-220 (2002)
17		Carlos Martín-Vide, Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg: ReMembrane Systems with Coupled Transport: Universality and Normal Forms. Fundam. Inform. 49(1-3): 1-15 (2002)
16	EE	Cezar Câmpeanu, Andrei Paun, Sheng Yu: An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. Int. J. Found. Comput. Sci. 13(1): 83-97 (2002)
15	EE	Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg: Computing by Communication in Networks of Membranes. Int. J. Found. Comput. Sci. 13(6): 779-798 (2002)
14	EE	Carlos Martín-Vide, Andrei Paun, Gheorghe Paun: On the Power of P Systems with Symport Rules. J. UCS 8(2): 317-331 (2002)
13		Andrei Paun, Gheorghe Paun: The Power of Communication: P Systems with Symport/Antiport. New Generation Comput. 20(3): 295-306 (2002)
12	EE	Andrei Paun: P Systems with Global Rules. Theory Comput. Syst. 35(5): 471-481 (2002)
2001
11		Sheng Yu, Andrei Paun: Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers Springer 2001
10	EE	Andrei Paun: On P Systems with Global Rules. DNA 2001: 329-339
9		Lila Kari, Andrei Paun: String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. Words, Semigroups, and Transductions 2001: 275-287
8		Andrei Paun, Gheorghe Paun, Alfonso Rodríguez-Patón: Further Remarks on P Systems with Symport Rules. Sci. Ann. Cuza Univ. 10: 3-18 (2001)
2000
7	EE	Andrei Paun, Nicolae Santean, Sheng Yu: An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251
6		Andrei Paun: On P Systems with Active Membranes. UMC 2000: 187-201
5		Andrei Paun: On the Diameter of Various Classes of H Systems. Journal of Automata, Languages and Combinatorics 5(3): 315-324 (2000)
1999
4	EE	Andrei Paun, Mihaela Paun: State and Transition Complexity of Watson-Crick Finite Automata. FCT 1999: 409-420
3		Andrei Paun: On Time-Varying H Systems. Bulletin of the EATCS 67: 157-164 (1999)
1997
2		Andrei Paun: Controlled H Systems of Small Radius. Fundam. Inform. 31(2): 185-193 (1997)
1984
1		G. Stefan, Andrei Paun, V. Bistriceanu, A. Birnbaum: DIALISP - A Lisp Machine. LISP and Functional Programming 1984: 123-128

Coauthor Index

1	Francesco Bernardini	[24]
2	A. Birnbaum	[1]
3	V. Bistriceanu	[1]
4	Cezar Câmpeanu	[16] [21] [23] [27] [28] [32] [34] [35]
5	Haiming Chen	[45]
6	Rudolf Freund	[19] [26] [30] [31]
7	Oscar H. Ibarra	[33] [39] [42] [46]
8	Mihai Ionescu (Armand-Mihai Ionescu)	[20] [22] [41] [45]
9	Tseren-Onolt Ishdorj	[45]
10	Lila Kari (Lila Santean)	[9] [29] [32]
11	Shankara Narayanan Krishna	[25]
12	Carlos Martín-Vide	[14] [17] [18] [20] [22] [29]
13	Hitesh Nagda	[37]
14	Marion Oswald	[26] [31]
15	Gheorghe Paun	[8] [13] [14] [15] [17] [18] [20] [22] [41] [42] [45]
16	Mihaela Paun	[4]
17	Mario J. Pérez-Jiménez	[38] [41] [45]
18	Bianca Popa	[36] [40]
19	Alfonso Rodríguez-Patón	[8] [37] [42] [44]
20	Francisco José Romero-Campero	[38]
21	Grzegorz Rozenberg	[15] [17]
22	Nicolae Santean	[7]
23	Jason R. Smith	[34] [35]
24	Petr Sosík	[42]
25	G. Stefan	[1]
26	Sara Woodworth	[39] [42] [46]
27	Fang Yu	[39] [46]
28	Sheng Yu	[7] [11] [16]

Colors in the list of coauthors