Init and Anf Operating on omega-Languages. - Rudolf Freund (Inf. Process. Lett., 1983)

Real Functions and Numbers Defined by Turing Machines. - Rudolf Freund (Theor. Comput. Sci., 1983)

Modelling Feature Maps by Attributed Parallel Array Grammars. - Rudolf Freund; Martina Kirchmeyer; Friedrich Tafill (ÖGAI, 1991)

Attributed Elementary Programmed Graph Grammars. - Rudolf Freund; Brigitte Haberstroh (WG, 1991)

Applying Graph Grammars for Task-Oriented User Interface Development. - Rudolf Freund; Brigitte Haberstroh; Christian Stary (ICCI, 1992)

Aspects of N-Dimensional Lindenmayer Systems. - Rudolf Freund (Developments in Language Theory, 1993)

How Semantical Design Languages Help to Preserve Specification/Design-Consistency. - Christian Stary; Rudolf Freund (SEKE, 1993)

One-dimensional matrix array grammars. - Rudolf Freund; Gheorghe Paun (J. Inf. Process. Cybern., 1993)

Control Mechanisms on #-Context-Free Array Grammars. - Rudolf Freund (Mathematical Aspects of Natural and Formal Languages, 1994)

Array Grammars with Prescribed Teams of Array Productions. - Rudolf Freund (Developments in Language Theory, 1995)

Cooperating Array Grammar Systems. - Jürgen Dassow; Rudolf Freund; Gheorghe Paun (Int. J. Pattern Recognit. Artif. Intell., 1995)

A Variant of Team Cooperation in Grammar Systems. - Rudolf Freund; Gheorghe Paun (J. Univers. Comput. Sci., 1995)

Cutting/Recombination Systems as Generating Devices. - Rudolf Freund (German Conference on Bioinformatics, 1996)

Bounded Parallelism in Array Grammars Used for Character Recognition. - Henning Fernau; Rudolf Freund (SSPR, 1996)

Test Tube Systems or How to Bake a DNA Cake. - Rudolf Freund; Franziska Freund (Acta Cybern., 1996)

Universal Systems with Operations Related to Splicing. - Rudolf Freund; F. Wachtler (Comput. Artif. Intell., 1996)

Accepting Array Grammars with Control Mechanisms. - Henning Fernau; Rudolf Freund (New Trends in Formal Languages, 1997)

Watson-Crick finite automata. - Rudolf Freund; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa (DNA Based Computers, 1997)

Bounding resources in Cooperating Distributed Grammar Systems. - Henning Fernau; Markus Holzer 001; Rudolf Freund (Developments in Language Theory, 1997)

Test tube systems with controlled applications of rules. - Rudolf Freund; Franziska Freund (ICEC, 1997)

Formal Specification and Simulation of Software through Graph Grammars: A General but Minimal Approach. - Rudolf Freund; Christian Stary; Herbert Pötzl; Tatjana Svizensky (COMPSAC, 1998)

The Generative Power of d-Dimensional #-Context-Free Array Grammars. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (MCU (2), 1998)

Character Recognition with k-Head Finite Array Automata. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (SSPR/SPR, 1998)

Test tube systems: when two tubes are enough. - Rudolf Freund; Franziska Freund (Developments in Language Theory, 1999)

Generalized P-Systems. - Rudolf Freund (FCT, 1999)

Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (Grammatical Models of Multi-Agent Systems, 1999)

Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (Grammatical Models of Multi-Agent Systems, 1999)

Generalized P-Systems with Splicing and Cutting/Recombination. - Rudolf Freund (Grammars, 1999)

DNA Computing Based on Splicing: The Existence of Universal Computers. - Rudolf Freund; Lila Kari; Gheorghe Paun (Theory Comput. Syst., 1999)

Algebraic Representations of Regular Array Languages. - Rudolf Freund; Alexandru Mateescu; Arto Salomaa (Finite Versus Infinite, 2000)

Molecular Computing with Generalized Homogeneous P-Systems. - Rudolf Freund; Franziska Freund (DNA Computing, 2000)

A Hybrid System for the Recognition of Hand-Written Characters. - Rudolf Freund; Markus Neubauer; Martin Summerer; Stefan Gruber; Jürgen Schaffer; Roland Swoboda (SSPR/SPR, 2000)

Array Grammar Systems. - Rudolf Freund (J. Autom. Lang. Comb., 2000)

Acceptance of omega-languages by communicating deterministic turing maching. - Rudolf Freund; Ludwig Staiger (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

String Rewriting Sequential P-Systems and Regulated Rewriting. - Petr Sosík; Rudolf Freund (Developments in Language Theory, 2001)

On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars. - Rudolf Freund; Gheorghe Paun (MCU, 2001)

Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of Membranes. - Rudolf Freund (Bull. EATCS, 2001)

Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. - Henning Fernau; Markus Holzer 001; Rudolf Freund (Theor. Comput. Sci., 2001)

Energy-Controlled P Systems. - Rudolf Freund (WMC-CdeA, 2002)

P Systems with Activated/Prohibited Membrane Channels. - Rudolf Freund; Marion Oswald (WMC-CdeA, 2002)

Membrane Systems with Symport/Antiport Rules: Universality Results. - Rudolf Freund; Andrei Paun (WMC-CdeA, 2002)

P Systems without Priorities Are Computationally Universal. - Petr Sosík; Rudolf Freund (WMC-CdeA, 2002)

A Short Note on Analysing P Systems with Antiport Rules. - Rudolf Freund; Marion Oswald (Bull. EATCS, 2002)

GP Systems with Forbidding Context. - Rudolf Freund; Marion Oswald (Fundam. Informaticae, 2002)

On Some Operations on Strings Suggested by Gene Assembly in Ciliates. - Rudolf Freund; Carlos Martín-Vide; Victor Mitrana (New Gener. Comput., 2002)

Generalized Homogeneous P-Systems. - Rudolf Freund; Franziska Freund (Grammars and Automata for String Processing, 2003)

Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities. - Rudolf Freund; Marion Oswald; Petr Sosík (DCFS, 2003)

On Three Classes of Automata-Like P Systems. - Rudolf Freund; Carlos Martín-Vide; Adam Obtulowicz; Gheorghe Paun (Developments in Language Theory, 2003)

P Systems with Cutting/Recombination Rules Assigned to Membranes. - Franziska Freund; Rudolf Freund; Marion Oswald; Maurice Margenstern; Yurii Rogozhin; Sergey Verlan (Workshop on Membrane Computing, 2003)

omega-P Automata with Communication Rules. - Rudolf Freund; Marion Oswald; Ludwig Staiger (Workshop on Membrane Computing, 2003)

A Note on Emergence in Multi-Agent String Processing Systems. - Jozef Kelemen; Rudolf Freund; Gheorghe Paun (Comput. Artif. Intell., 2003)

Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. - Henning Fernau; Markus Holzer 001; Rudolf Freund (Theor. Comput. Sci., 2003)

Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems. - Franziska Freund; Rudolf Freund; Marion Oswald (Aspects of Molecular Computing, 2004)

Gemmating P Systems are Computationally Complete with Four Membranes. - Rudolf Freund; Marion Oswald; Andrei Paun (DCFS, 2004)

Computational Completeness of P Systems with Active Membranes and Two Polarizations. - Artiom Alhazov; Rudolf Freund; Gheorghe Paun (MCU, 2004)

Sequential P Systems with Unit Rules and Energy Assigned to Membranes. - Rudolf Freund; Alberto Leporati; Marion Oswald; Claudio Zandron (MCU, 2004)

On the Efficiency of P Systems with Active Membranes and Two Polarizations. - Artiom Alhazov; Rudolf Freund (Workshop on Membrane Computing, 2004)

Asynchronous P Systems and P Systems Working in the Sequential Mode. - Rudolf Freund (Workshop on Membrane Computing, 2004)

P Systems Generating Trees. - Rudolf Freund; Marion Oswald; Andrei Paun (Workshop on Membrane Computing, 2004)

Implementation of Catalytic P Systems. - Aneta Binder; Rudolf Freund; Georg Lojka; Marion Oswald (CIAA, 2004)

P Automata with membrane channels. - Rudolf Freund; Marion Oswald (Artif. Life Robotics, 2004)

P Systems with Conditional Communication Rules Assigned to Membranes. - Rudolf Freund; Marion Oswald (J. Autom. Lang. Comb., 2004)

P Systems with Local Graph Productions. - Rudolf Freund; Marion Oswald (New Gener. Comput., 2004)

From regulated rewriting to computing with membranes: collapsing hierarchies. - Rudolf Freund; Carlos Martín-Vide; Gheorghe Paun (Theor. Comput. Sci., 2004)

Refining the Nonterminal Complexity of Graph-controlled Grammars. - Henning Fernau; Rudolf Freund; Marion Oswald; Klaus Reinhardt (DCFS, 2005)

Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells. - Artiom Alhazov; Rudolf Freund; Marion Oswald (Developments in Language Theory, 2005)

Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules. - Artiom Alhazov; Rudolf Freund; Marion Oswald (Workshop on Membrane Computing, 2005)

Computational Power of Symport/Antiport: History, Advances, and Open Problems. - Artiom Alhazov; Rudolf Freund; Yurii Rogozhin (Workshop on Membrane Computing, 2005)

One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems. - Artiom Alhazov; Rudolf Freund; Agustin Riscos-Núñez (SYNASC, 2005)

P Colonies Working in the Maximally Parallel and in the Sequential Mode. - Rudolf Freund; Marion Oswald (SYNASC, 2005)

Modelling artificial life by attributed eco-array grammars. - Aneta Binder; Rudolf Freund; Marion Oswald (Artif. Life Robotics, 2005)

Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (Fundam. Informaticae, 2005)

P Systems working in the sequential mode on arrays and strings. - Rudolf Freund (Int. J. Found. Comput. Sci., 2005)

Optimal results for the computational completeness of gemmating (tissue) P systems. - Rudolf Freund; Marion Oswald; Andrei Paun (Int. J. Found. Comput. Sci., 2005)

P systems with active membranes and without polarizations. - Rudolf Freund; Andrei Paun (Soft Comput., 2005)

Computationally universal P systems without priorities: two catalysts are sufficient. - Rudolf Freund; Lila Kari; Marion Oswald; Petr Sosík (Theor. Comput. Sci., 2005)

Tissue P systems with channel states. - Rudolf Freund; Gheorghe Paun; Mario J. Pérez-Jiménez (Theor. Comput. Sci., 2005)

Special Variants of P Systems with One Catalyst in One Membrane. - Rudolf Freund (DCFS, 2006)

A Small Universal Antiport P System with Forbidden Context. - Rudolf Freund; Marion Oswald (DCFS, 2006)

Extended Spiking Neural P Systems. - Artiom Alhazov; Rudolf Freund; Marion Oswald; Marija Slavkovik 001 (Workshop on Membrane Computing, 2006)

Tissue P Systems with Communication Modes. - Francesco Bernardini; Rudolf Freund (Workshop on Membrane Computing, 2006)

Modeling Dynamical Parallelism in Bio-systems. - Erzsébet Csuhaj-Varjú; Rudolf Freund; Dragos Sburlan (Workshop on Membrane Computing, 2006)

Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings. - Rudolf Freund; Marion Oswald (MeCBIC@ICALP, 2006)

(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes. - Artiom Alhazov; Rudolf Freund; Alberto Leporati; Marion Oswald; Claudio Zandron (Fundam. Informaticae, 2006)

Routes and Products of Monoids. - Alexandru Mateescu; Rudolf Freund (Fundam. Informaticae, 2006)

Membrane division, restricted membrane creation and object complexity in P systems. - Artiom Alhazov; Rudolf Freund; Agustin Riscos-Núñez (Int. J. Comput. Math., 2006)

P colonies and prescribed teams. - Rudolf Freund; Marion Oswald (Int. J. Comput. Math., 2006)

Cell/symbol complexity of tissue P systems with symport/antiport rules. - Artiom Alhazov; Rudolf Freund; Marion Oswald (Int. J. Found. Comput. Sci., 2006)

Event-Related Outputs of Computations in P Systems. - Matteo Cavaliere; Rudolf Freund; Alexander Leitsch; Gheorghe Paun (J. Autom. Lang. Comb., 2006)

Contextual Array Grammars. - Rudolf Freund; Gheorghe Paun; Grzegorz Rozenberg (Formal Models, Languages and Applications, 2007)

Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. - Artiom Alhazov; Rudolf Freund; Marion Oswald; Sergey Verlan (MCU, 2007)

A Formal Framework for Static (Tissue) P Systems. - Rudolf Freund; Sergey Verlan (Workshop on Membrane Computing, 2007)

Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode. - Rudolf Freund; Gheorghe Paun; Mario J. Pérez-Jiménez (UC, 2007)

On String Languages Generated by Spiking Neural P Systems. - Haiming Chen 001; Rudolf Freund; Mihai Ionescu; Gheorghe Paun; Mario J. Pérez-Jiménez (Fundam. Informaticae, 2007)

Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode. - Rudolf Freund; Marion Oswald (Fundam. Informaticae, 2007)

Cellular Automata and Parallel Array Systems. - Rudolf Freund; Fritz Tafill (Fundam. Informaticae, 2007)

Partial Halting in P Systems. - Rudolf Freund; Marion Oswald (Int. J. Found. Comput. Sci., 2007)

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. - Henning Fernau; Rudolf Freund; Marion Oswald; Klaus Reinhardt (J. Autom. Lang. Comb., 2007)

Multiset random context grammars, checkers, and transducers. - Matteo Cavaliere; Rudolf Freund; Marion Oswald; Dragos Sburlan (Theor. Comput. Sci., 2007)

Membrane Systems Using Noncooperative Rules with Unconditional Halting. - Markus Beyreder; Rudolf Freund (Workshop on Membrane Computing, 2008)

Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems. - Rudolf Freund; Marion Oswald (Fundam. Informaticae, 2008)

Extended Spiking Neural P Systems with Decaying Spikes and/or Total Spiking. - Rudolf Freund; Mihai Ionescu; Marion Oswald (Int. J. Found. Comput. Sci., 2008)

Cd Grammar Systems with Regular Start Conditions. - Rudolf Freund; Marion Oswald (Int. J. Found. Comput. Sci., 2008)

Transition and Halting Modes in (Tissue) P Systems. - Rudolf Freund (Workshop on Membrane Computing, 2009)

(Tissue) P Systems with Hybrid Transition Modes. - Rudolf Freund; Marian Kogler 001 (Workshop on Membrane Computing, 2009)

P Automata with Controlled Use of Minimal Communication Rules. - Rudolf Freund; Marian Kogler 001; Sergey Verlan (NCMA, 2009)

On the Number of Membranes in Unary P Systems - Rudolf Freund; Andreas Klein 001; Martin Kutrib (DCFS, 2009)

Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems - Rudolf Freund; Marian Kogler 001 (MeCBIC, 2009)

Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions. - Artiom Alhazov; Marion Oswald; Rudolf Freund; Sergey Verlan (Fundam. Informaticae, 2009)

Computationally Complete Spiking Neural P Systems without Delay: Two Types of Neurons Are Enough. - Rudolf Freund; Marian Kogler 001 (Int. Conf. on Membrane Computing, 2010)

Reversibility and Determinism in Sequential Multiset Rewriting. - Artiom Alhazov; Rudolf Freund; Kenichi Morita (UC, 2010)

Graph-Controlled Insertion-Deletion Systems - Rudolf Freund; Marian Kogler 001; Yurii Rogozhin; Sergey Verlan (DCFS, 2010)

A General Framework for Regulated Rewriting Based on the Applicability of Rules. - Rudolf Freund; Marian Kogler 001; Marion Oswald (Computation, Cooperation, and Life, 2011)

Preface. - Henning Bordihn; Rudolf Freund; Mika Hirvensalo; Markus Holzer 001; Martin Kutrib; Friedrich Otto (Fundam. Informaticae, 2011)

Preface. - Rudolf Freund; Marian Gheorghe 001; Solomon Marcus; Victor Mitrana; Mario J. Pérez-Jiménez (Int. J. Found. Comput. Sci., 2011)

(Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode. - Rudolf Freund; Sergey Verlan (Nat. Comput., 2011)

Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN. - Artiom Alhazov; Rudolf Freund (Int. Conf. on Membrane Computing, 2012)

Sequential P Systems with Regular Control. - Artiom Alhazov; Rudolf Freund; Hilbert Heikenwälder; Marion Oswald; Yurii Rogozhin; Sergey Verlan (Int. Conf. on Membrane Computing, 2012)

(Tissue) P Systems with Decaying Objects. - Rudolf Freund (Int. Conf. on Membrane Computing, 2012)

P Systems with Minimal Left and Right Insertion and Deletion. - Rudolf Freund; Yurii Rogozhin; Sergey Verlan (UCNC, 2012)

Self-Stabilization in Membrane Systems. - Marco Antoniotti; Rudolf Freund; Alberto Leporati; Giancarlo Mauri (Comput. Sci. J. Moldova, 2012)

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). - Rudolf Freund; Markus Holzer 001; Carlo Mereghetti; Friedrich Otto; Beatrice Palano (RAIRO Theor. Informatics Appl., 2012)

Sequential and maximally parallel multiset rewriting: reversibility and determinism. - Artiom Alhazov; Rudolf Freund; Kenichi Morita (Nat. Comput., 2012)

Flattening in (Tissue) P Systems. - Rudolf Freund; Alberto Leporati; Giancarlo Mauri; Antonio E. Porreca; Sergey Verlan; Claudio Zandron (Int. Conf. on Membrane Computing, 2013)

Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness. - Rudolf Freund; Marion Oswald (NCMA, 2013)

Array Insertion and Deletion P Systems. - Henning Fernau; Rudolf Freund; Sergiu Ivanov 001; Markus L. Schmid; K. G. Subramanian 001 (UCNC, 2013)

One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules. - Rudolf Freund; Sergiu Ivanov 001; Marion Oswald; K. G. Subramanian 001 (MCU, 2013)

How to Obtain Computational Completeness in P Systems with One Catalyst. - Rudolf Freund; Gheorghe Paun (MCU, 2013)

A formalization of membrane systems with dynamically evolving structures. - Rudolf Freund; Ignacio Pérez-Hurtado; Agustin Riscos-Núñez; Sergey Verlan (Int. J. Comput. Math., 2013)

Algebraic Representation of Regular Array Languages on Cayley Graphs. - Rudolf Freund; Marion Oswald (Discrete Mathematics and Computer Science, 2014)

P Systems with Anti-Matter. - Rudolf Freund; Gheorghe Paun (Computing with New Resources, 2014)

Matter and Anti-Matter in Membrane Systems. - Artiom Alhazov; Bogdan Aman; Rudolf Freund; Gheorghe Paun (DCFS, 2014)

P Systems with Anti-Matter. - Artiom Alhazov; Bogdan Aman; Rudolf Freund (Int. Conf. on Membrane Computing, 2014)

Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems. - Artiom Alhazov; Rudolf Freund (Int. Conf. on Membrane Computing, 2014)

P Systems with Toxic Objects. - Artiom Alhazov; Rudolf Freund (Int. Conf. on Membrane Computing, 2014)

Promoters and Inhibitors in Purely Catalytic P Systems. - Artiom Alhazov; Rudolf Freund; Sergey Verlan (Int. Conf. on Membrane Computing, 2014)

Red-Green P Automata. - Bogdan Aman; Erzsébet Csuhaj-Varjú; Rudolf Freund (Int. Conf. on Membrane Computing, 2014)

Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete. - Artiom Alhazov; Rudolf Freund; Yurii Rogozhin (UCNC, 2014)

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (AFL, 2014)

Report on UCNC 2014. - Hava T. Siegelmann; Rudolf Freund (Bull. EATCS, 2014)

Length P Systems. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (Fundam. Informaticae, 2014)

Antimatter as a Frontier of Tractability in Membrane Computing. - Daniel Díaz-Pernil; Francisco Peña-Cantillana; Artiom Alhazov; Rudolf Freund; Miguel Angel Gutiérrez-Naranjo (Fundam. Informaticae, 2014)

Array Grammars and Automata on Cayley Grids. - Rudolf Freund; Marion Oswald (J. Autom. Lang. Comb., 2014)

Generating and accepting P systems with minimal left and right insertion and deletion. - Rudolf Freund; Yurii Rogozhin; Sergey Verlan (Nat. Comput., 2014)

A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems. - Erzsébet Csuhaj-Varjú; Rudolf Freund; György Vaszil (MCU, 2015)

Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. - Henning Fernau; Rudolf Freund; Rani Siromoney; K. G. Subramanian 001 (MCU, 2015)

Polarizationless P Systems with One Active Membrane. - Artiom Alhazov; Rudolf Freund (Int. Conf. on Membrane Computing, 2015)

Bridging Deterministic P Systems and Conditional Grammars. - Artiom Alhazov; Rudolf Freund; Sergey Verlan (Int. Conf. on Membrane Computing, 2015)

P Systems with Generalized Multisets Over Totally Ordered Abelian Groups. - Rudolf Freund; Sergiu Ivanov 001; Sergey Verlan (Int. Conf. on Membrane Computing, 2015)

On the Power of Catalytic P Systems with One Catalyst. - Rudolf Freund; Petr Sosík (Int. Conf. on Membrane Computing, 2015)

Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer ω-Languages. - Rudolf Freund; Sergiu Ivanov 001; Ludwig Staiger (UCNC, 2015)

Contextual array grammars and array P systems. - Henning Fernau; Rudolf Freund; Markus L. Schmid; K. G. Subramanian 001; Petra Wiederhold (Ann. Math. Artif. Intell., 2015)

Small P Systems with Catalysts or Anti-Matter Simulating Generalized Register Machines and Generalized Counter Automata. - Artiom Alhazov; Rudolf Freund; Petr Sosík (Comput. Sci. J. Moldova, 2015)

Variants of Small Universal P Systems with Catalysts. - Artiom Alhazov; Rudolf Freund (Fundam. Informaticae, 2015)

Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness. - Rudolf Freund; Marion Oswald; Gheorghe Paun (Fundam. Informaticae, 2015)

The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems. - Henning Fernau; Rudolf Freund; Markus Holzer 001 (Int. J. Found. Comput. Sci., 2015)

Contextual Array Grammars with Matrix and Regular Control. - Henning Fernau; Rudolf Freund; Rani Siromoney; K. G. Subramanian 001 (DCFS, 2016)

Simulating R Systems by P Systems. - Artiom Alhazov; Bogdan Aman; Rudolf Freund; Sergiu Ivanov 001 (Int. Conf. on Membrane Computing, 2016)

Purely Catalytic P Systems over Integers and Their Generative Power. - Artiom Alhazov; Omar Belingheri; Rudolf Freund; Sergiu Ivanov 001; Antonio E. Porreca; Claudio Zandron (Int. Conf. on Membrane Computing, 2016)

P Systems Working in Maximal Variants of the Set Derivation Mode. - Artiom Alhazov; Rudolf Freund; Sergey Verlan (Int. Conf. on Membrane Computing, 2016)

P Automata: New ideas and results. - Rudolf Freund (NCMA, 2016)

Preface. - Suna Bensch; Rudolf Freund; Mika Hirvensalo; Friedrich Otto (Fundam. Informaticae, 2016)

Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting. - Rudolf Freund; Sergiu Ivanov 001; Ludwig Staiger (Int. J. Unconv. Comput., 2016)

Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors. - Artiom Alhazov; Rudolf Freund; Vladimir Rogozhin; Yurii Rogozhin (Nat. Comput., 2016)

Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. - Rudolf Freund; Vladimir Rogojin; Sergey Verlan (DCFS, 2017)

Hierarchical P Systems with Randomized Right-Hand Sides of Rules. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (Int. Conf. on Membrane Computing, 2017)

Watson-Crick T0L Systems and Red-Green Register Machines. - Erzsébet Csuhaj-Varjú; Rudolf Freund; György Vaszil (Fundam. Informaticae, 2017)

Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors. - Henning Fernau; Rudolf Freund; Rani Siromoney; K. G. Subramanian 001 (Fundam. Informaticae, 2017)

Contextual array grammars with matrix control, regular control languages, and tissue P systems control. - Artiom Alhazov; Henning Fernau; Rudolf Freund; Sergiu Ivanov 001; Rani Siromoney; K. G. Subramanian 001 (Theor. Comput. Sci., 2017)

Chocolate P Automata. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Marion Oswald; Sergey Verlan (Enjoying Natural Computing, 2018)

Small Universal Reversible Counter Machines. - Artiom Alhazov; Sergey Verlan; Rudolf Freund (Reversibility and Universality, 2018)

Sequential Grammars with Activation and Blocking of Rules. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (MCU, 2018)

Control Mechanisms for Array Grammars on Cayley Grids. - Rudolf Freund (MCU, 2018)

Tissue P Systems with Point Mutation Rules. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Sergey Verlan (Int. Conf. on Membrane Computing, 2018)

P Systems with Activation and Blocking of Rules. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (UCNC, 2018)

Extended spiking neural P systems with white hole rules and their red-green variants. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Marion Oswald; Sergey Verlan (Nat. Comput., 2018)

A General Framework for Sequential Grammars with Control Mechanisms. - Rudolf Freund (DCFS, 2019)

Register machines over groups. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (NCMA, 2019)

Turing machines with activations of transitions. - Rudolf Freund; Ludwig Staiger (NCMA, 2019)

Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors. - Rudolf Freund; Vladimir Rogojin; Sergey Verlan (Int. J. Found. Comput. Sci., 2019)

Variants of P systems with activation and blocking of rules. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (Nat. Comput., 2019)

How derivation modes and halting conditions may influence the computational power of P systems. - Rudolf Freund (J. Membr. Comput., 2020)

A formal framework for spiking neural P systems. - Sergey Verlan; Rudolf Freund; Artiom Alhazov; Sergiu Ivanov 001; Linqiang Pan (J. Membr. Comput., 2020)

P systems with randomized right-hand sides of rules. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (Theor. Comput. Sci., 2020)

Time-freeness and clock-freeness and related concepts in P systems. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Linqiang Pan; Bosheng Song (Theor. Comput. Sci., 2020)

The Power of Parallelism in Membrane Computing. - Rudolf Freund (ITAT, 2021)

Relations between Control Mechanisms for Sequential Grammars. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Marion Oswald (Fundam. Informaticae, 2021)

P systems with limited number of objects. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (J. Membr. Comput., 2021)

When catalytic P systems with one catalyst can be computationally complete. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (J. Membr. Comput., 2021)

Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Sergey Verlan (J. Membr. Comput., 2021)

Preface. - David Doty; Rudolf Freund; Natasa Jonoska; Jarkko Kari (Nat. Comput., 2021)

Prescribed Teams of Rules Working on Several Objects. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Sergey Verlan (MCU, 2022)

P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (NCMA, 2022)

Tissue P Systems with Vesicles of Multisets. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Sergey Verlan (Int. J. Found. Comput. Sci., 2022)

Regulated Insertion-Deletion Systems. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Sergey Verlan (J. Autom. Lang. Comb., 2022)

Variants of derivation modes for which purely catalytic P systems are computationally complete. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Marion Oswald (Theor. Comput. Sci., 2022)

Numerical networks of cells. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Sergey Verlan (Theor. Comput. Sci., 2023)

A P systems variant for reasoning about sequential controllability of Boolean networks. - Artiom Alhazov; Vincent Ferrari-Dominguez; Rudolf Freund; Nicolas Glade; Sergiu Ivanov 001 (Theor. Comput. Sci., 2023)

Universality of Turing Tumble of Finite Size. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; Sergey Verlan (MCU, 2024)

Preface. - Rudolf Freund (Comput. Sci. J. Moldova, 2024)

P systems with reactive membranes. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001; David Orellana-Martín; Antonio Ramírez-de-Arellano; José-Antonio Rodríguez-Gallego (J. Membr. Comput., 2024)

On the spectrum between reaction systems and string rewriting. - Artiom Alhazov; Rudolf Freund; Sergiu Ivanov 001 (Nat. Comput., 2024)