Andrei Paun

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 27

Top Topics

Finite Automata

Systems Biology

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

IEEE Trans. Neural Networks Learn. Syst.

Publications

Ion Petre, Andrei Paun
Special issue on Foundational Methods in Systems Biology. Theor. Comput. Sci. 1005 (2024)
Victor Mitrana, Andrei Paun, Mihaela Paun, José-Ramón Sánchez-Couso
Jump complexity of finite automata with translucent letters. Theor. Comput. Sci. 992 (2024)
Nicoleta Siminea, Victor-Bogdan Popescu, José Ángel Sánchez Martín, Daniela Florea, Georgiana Gavril, Ana Maria Gheorghe, Corina Itcus, Krishna Kanhaiya, Octavian Pacioglu, Laura Ioana Popa, Romica Trandafir, Maria Iris Tusa, Manuela Sidoroff, Mihaela Paun, Eugen Czeizler, Andrei Paun, Ion Petre
Network analytics for drug repurposing in COVID-19. Briefings Bioinform. 23 (1) (2022)
Yara Hamshawi, Florin-Daniel Bîlbîe, Andrei Paun, Assaf Malka, Ron Piran
P systems with protein rules. J. Frankl. Inst. 359 (8) (2022)
José-Ramón Sánchez-Couso, Fernando Arroyo, Victor Mitrana, Andrei Paun, Mihaela Paun
Accepting multiple splicing systems. J. King Saud Univ. Comput. Inf. Sci. 34 (6 Part A) (2022)
Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun
Hairpin completions and reductions: semilinearity properties. Nat. Comput. 20 (2) (2021)
Victor Mitrana, Andrei Paun, Mihaela Paun, José Ángel Sánchez Martín
Non-preserving Accepting Splicing Systems. J. Autom. Lang. Comb. 26 (1-2) (2021)
Florin-Daniel Bîlbîe, Andrei Paun
Small SNQ P Systems with multiple types of spikes. Theor. Comput. Sci. 862 (2021)
Andrei Paun, Florin-Daniel Bîlbîe
Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application. Int. J. Found. Comput. Sci. 31 (1) (2020)
Fernando Arroyo, Victor Mitrana, Andrei Paun, Mihaela Paun, José-Ramón Sánchez-Couso
On the group memory complexity of extended finite automata over groups. J. Log. Algebraic Methods Program. 117 (2020)
Victor Mitrana, Andrei Paun, Mihaela Paun
How Complex is to Solve a Hard Problem with Accepting Splicing Systems. COMPLEXIS (2019)
Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun
Further Properties of Self-assembly by Hairpin Formation. UCNC (2019)
Fernando Arroyo, Victor Mitrana, Andrei Paun, Mihaela Paun
A Multi-agent Model for Cell Population. KES-AMSTA (2019)
Henning Bordihn, Victor Mitrana, Maria C. Negru, Andrei Paun, Mihaela Paun
Small networks of polarized splicing processors are universal. Nat. Comput. 17 (4) (2018)
Alexandru Amarioarei, Gefry Barad, Elena Czeizler, Eugen Czeizler, Ana-Maria Dobre, Corina Itcus, Andrei Paun, Mihaela Paun, Romica Trandafir, Iris Tusa
One Dimensional DNA Tiles Self Assembly Model Simulation. Int. J. Unconv. Comput. 13 (4-5) (2018)
Zhiqiang Zhang, Tingfang Wu, Andrei Paun, Linqiang Pan
Universal enzymatic numerical P systems with small number of enzymatic variables. Sci. China Inf. Sci. 61 (9) (2018)
Tingfang Wu, Florin-Daniel Bîlbîe, Andrei Paun, Linqiang Pan, Ferrante Neri
Simplified and Yet Turing Universal Spiking Neural P Systems with Communication on Request. Int. J. Neural Syst. 28 (8) (2018)
Tingfang Wu, Andrei Paun, Zhiqiang Zhang, Linqiang Pan
Spiking Neural P Systems With Polarizations. IEEE Trans. Neural Networks Learn. Syst. 29 (8) (2018)
Andrei Paun, Florin-Daniel Bîlbîe
A Look at the Descriptional Complexity of SNQ P Systems. Enjoying Natural Computing (2018)
Alexandru Amarioarei, Gefry Barad, Eugen Czeizler, Ana-Maria Dobre, Corina Itcus, Victor Mitrana, Andrei Paun, Mihaela Paun, Frankie Spencer, Romica Trandafir, Iris Tusa
DNA-Guided Assembly of Nanocellulose Meshes. TPNC (2018)
Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun
Networks of Polarized Splicing Processors. TPNC (2017)
Haiming Chen, Mihai Ionescu, Andrei Paun, Gheorghe Paun
On trace languages generated by (small) spiking neural P systems. Theor. Comput. Sci. 682 (2017)
Andrei Paun, Alfonso Rodríguez-Patón
P Systems Simulating Bacterial Conjugation: Universality and Properties. Fundam. Informaticae 153 (1-2) (2017)
Yang Li, Andrei Paun, Mihaela Paun
Improvements on contours based segmentation for DNA microarray image processing. Theor. Comput. Sci. 701 (2017)
Yansen Su, Tingfang Wu, Fei Xu, Andrei Paun
Spiking Neural P Systems with Rules on Synapses Working in Sum Spikes Consumption Strategy. Fundam. Informaticae 156 (2) (2017)
Zhiqiang Zhang, Tingfang Wu, Andrei Paun, Linqiang Pan
Numerical P systems with migrating variables. Theor. Comput. Sci. 641 (2016)
Andrei Paun, Clayton Chandler, Chokchai Leangsuksun, Mihaela Paun
A failure index for HPC applications. J. Parallel Distributed Comput. (2016)
Xingyi Zhang, Linqiang Pan, Andrei Paun
On the Universality of Axon P Systems. IEEE Trans. Neural Networks Learn. Syst. 26 (11) (2015)
Mihaela Paun, Yang Li, Yuan Cheng, Iris Tusa, Andrei Paun
Segmenting microarray images using a contour-based method. Theor. Comput. Sci. 608 (2015)
Andrei Paun, Petr Sosík
Three Universal Homogeneous Spiking Neural P Systems Using Max Spike. Fundam. Informaticae 134 (1-2) (2014)
Petr Sosík, Andrei Paun, Alfonso Rodríguez-Patón
P systems with proteins on membranes characterize PSPACE. Theor. Comput. Sci. 488 (2013)
Tanvir Ahmed, Garrett DeLancy, Andrei Paun
A Case-Study on the Influence of Noise to Log-Gain Principles for Flux Dynamic Discovery. Int. Conf. on Membrane Computing (2012)
John Jack, Andrei Paun, Alfonso Rodríguez-Patón
A review of the nondeterministic waiting time algorithm. Nat. Comput. 10 (1) (2011)
Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón, John Jack
Poster: Biochemical signaling: A discrete simulation with memory enhancement. ICCABS (2011)
Andrei Paun, Manuela Sidoroff
Sequentiality Induced by Spike Number in SNP Systems: Small Universal Machines. Int. Conf. on Membrane Computing (2011)
Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón, Manuela Sidoroff
P Systems with proteins on Membranes: a Survey. Int. J. Found. Comput. Sci. 22 (1) (2011)
John Jack, Andrei Paun
The Nondeterministic Waiting Time Algorithm: A Review DCFS (2009)
Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón
On the Hopcroft's minimization technique for DFA and DFCA. Theor. Comput. Sci. 410 (24-25) (2009)
Petr Sosík, Andrei Paun, Alfonso Rodríguez-Patón, David Pérez
On the Power of Computing with Proteins on Membranes. Workshop on Membrane Computing (2009)
John Jack, Andrei Paun
Discrete Modeling of Biochemical Signaling with Memory Enhancement. Trans. Comp. Sys. Biology 11 (2009)
Oscar H. Ibarra, Andrei Paun, Alfonso Rodríguez-Patón
Sequential SNP systems based on min/max spike number. Theor. Comput. Sci. 410 (30-32) (2009)
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. Nat. Comput. 7 (2) (2008)
John Jack, Alfonso Rodríguez-Patón, Oscar H. Ibarra, Andrei Paun
Discrete Nondeterministic Modeling of the Fas Pathway. Int. J. Found. Comput. Sci. 19 (5) (2008)
Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun
On spiking neural P systems and partially blind counter machines. Nat. Comput. 7 (1) (2008)
Oscar H. Ibarra, Andrei Paun
Computing with cells: membrane systems - some complexity issues. Int. J. Parallel Emergent Distributed Syst. 23 (5) (2008)
John Jack, Andrei Paun, Alfonso Rodríguez-Patón
Effects of HIV-1 Proteins on the Fas-Mediated Apoptotic Signaling Cascade: A Computational Study of Latent CD4+ T Cell Activation. Workshop on Membrane Computing (2008)
Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón
Hopcroft's Minimization Technique: Queues or Stacks?. CIAA (2008)
Oscar H. Ibarra, Andrei Paun, Alfonso Rodríguez-Patón
Sequentiality Induced by Spike Number in SNP Systems. DNA (2008)
Andrei Paun
On the Hopcroft's minimization algorithm CoRR (2007)
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) (2007)
Andrei Paun, Gheorghe Paun
Small universal spiking neural P systems. Biosyst. 90 (1) (2007)
Andrei Paun, Alfonso Rodríguez-Patón
On Flip-Flop Membrane Systems with Proteins. Workshop on Membrane Computing (2007)
Andrei Paun, Bianca Popa
P Systems with Proteins on Membranes and Membrane Division. Developments in Language Theory (2006)
Cezar Câmpeanu, Andrei Paun, Jason R. Smith
Incremental construction of minimal deterministic finite cover automata. Theor. Comput. Sci. 363 (2) (2006)
Andrei Paun, Bianca Popa
P Systems with Proteins on Membranes. Fundam. Informaticae 72 (4) (2006)
Hitesh Nagda, Andrei Paun, Alfonso Rodríguez-Patón
P Systems with Symport/Antiport and Time. Workshop on Membrane Computing (2006)
Andrei Paun, Mario J. Pérez-Jiménez, Francisco José Romero-Campero
Modeling Signal Transduction Using P Systems. Workshop on Membrane Computing (2006)
Haiming Chen, Mihai Ionescu, Andrei Paun, Gheorghe Paun, Bianca Popa
On Trace Languages Generated by (Small) Spiking Neural P Systems. DCFS (2006)
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)
Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun
On Spiking Neural P Systems and Partially Blind Counter Machines. UC (2006)
Cezar Câmpeanu, Andrei Paun, Jason R. Smith
Tight Bounds for the State Complexity of Deterministic Cover Automata. DCFS (2006)
Rudolf Freund, Marion Oswald, Andrei Paun
Optimal results for the computational completeness of gemmating (tissue) P systems. Int. J. Found. Comput. Sci. 16 (5) (2005)
Cezar Câmpeanu, Andrei Paun, Jason R. Smith
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. CIAA (2005)
Rudolf Freund, Andrei Paun
P systems with active membranes and without polarizations. Soft Comput. 9 (9) (2005)
Oscar H. Ibarra, Andrei Paun
Counting Time in Computing with Cells. DNA (2005)
Cezar Câmpeanu, Lila Kari, Andrei Paun
Results on Transforming NFA into DFCA. Fundam. Informaticae 64 (1-4) (2005)
Cezar Câmpeanu, Andrei Paun
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. CIAA (2004)
Rudolf Freund, Marion Oswald, Andrei Paun
Gemmating P Systems are Computationally Complete with Four Membranes. DCFS (2004)
Shankara Narayanan Krishna, Andrei Paun
Results on Catalytic and Evolution-Communication P Systems. New Gener. Comput. 22 (4) (2004)
Cezar Câmpeanu, Andrei Paun
Lower bounds for NFA to DCFA Transformations. DCFS (2004)
Cezar Câmpeanu, Andrei Paun
Computing Beyond the Turing Limit Using the H Systems. DNA (2004)
Lila Kari, Carlos Martín-Vide, Andrei Paun
On the Universality of P Systems with Minimal Symport/Antiport Rules. Aspects of Molecular Computing (2004)
Rudolf Freund, Marion Oswald, Andrei Paun
P Systems Generating Trees. Workshop on Membrane Computing (2004)
Francesco Bernardini, Andrei Paun
Universality of Minimal Symport/Antiport: Five Membranes Suffice. Workshop on Membrane Computing (2003)
Cezar Câmpeanu, Andrei Paun
Counting The Number Of Minimal Dfca Obtained By Merging States. Int. J. Found. Comput. Sci. 14 (6) (2003)
Mihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun
Unexpected universality results for three classes of P systems with symport/antiport. Nat. Comput. 2 (4) (2003)
Cezar Câmpeanu, Andrei Paun
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. CIAA (2002)
Carlos Martín-Vide, Andrei Paun, Gheorghe Paun
On the Power of P Systems with Symport Rules. J. Univers. Comput. Sci. 8 (2) (2002)
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) (2002)
Rudolf Freund, Andrei Paun
Membrane Systems with Symport/Antiport Rules: Universality Results. WMC-CdeA (2002)
Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg
Computing by Communication in Networks of Membranes. Int. J. Found. Comput. Sci. 13 (6) (2002)
Mihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun
Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport. DNA (2002)
Andrei Paun
P Systems with Global Rules. Theory Comput. Syst. 35 (5) (2002)
Carlos Martín-Vide, Andrei Paun, Gheorghe Paun
Membrane Computing: New Results, New Problems. Bull. EATCS 78 (2002)
Carlos Martín-Vide, Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg
ReMembrane Systems with Coupled Transport: Universality and Normal Forms. Fundam. Informaticae 49 (1-3) (2002)
Andrei Paun, Gheorghe Paun
The Power of Communication: P Systems with Symport/Antiport. New Gener. Comput. 20 (3) (2002)
Lila Kari, Andrei Paun
String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. Words, Semigroups, and Transductions (2001)
Andrei Paun, Gheorghe Paun, Alfonso Rodríguez-Patón
Further Remarks on P Systems with Symport Rules. Sci. Ann. Cuza Univ. 10 (2001)
Andrei Paun, Mihaela Paun
On membrane computing based on splicing. Where Mathematics, Computer Science, Linguistics and Biology Meet (2001)
Andrei Paun
On P Systems with Global Rules. DNA (2001)
Andrei Paun
On P Systems with Active Membranes. UMC (2000)
Andrei Paun
On the Diameter of Various Classes of H Systems. J. Autom. Lang. Comb. 5 (3) (2000)
Andrei Paun, Nicolae Santean, Sheng Yu
) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA (2000)
Andrei Paun
On Time-Varying H Systems. Bull. EATCS 67 (1999)
Andrei Paun, Mihaela Paun
State and Transition Complexity of Watson-Crick Finite Automata. FCT (1999)
Andrei Paun
Controlled H Systems of Small Radius. Fundam. Informaticae 31 (2) (1997)