Rudolf Freund

According to our database1, Rudolf Freund authored at least 173 papers between 1983 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Extended spiking neural P systems with white hole rules and their red-green variants.
Natural Computing, 2018

P Systems with Activation and Blocking of Rules.
Proceedings of the Unconventional Computation and Natural Computation, 2018

Control Mechanisms for Array Grammars on Cayley Grids.
Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018

Sequential Grammars with Activation and Blocking of Rules.
Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018

Small Universal Reversible Counter Machines.
Proceedings of the Reversibility and Universality, 2018

2017
Contextual array grammars with matrix control, regular control languages, and tissue P systems control.
Theor. Comput. Sci., 2017

Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors.
Fundam. Inform., 2017

Watson-Crick T0L Systems and Red-Green Register Machines.
Fundam. Inform., 2017

(Tissue) P Systems with Vesicles of Multisets.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Hierarchical P Systems with Randomized Right-Hand Sides of Rules.
Proceedings of the Membrane Computing, 2017

Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors.
Natural Computing, 2016

Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting.
IJUC, 2016

Preface.
Fundam. Inform., 2016

P Automata: New ideas and results.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

P Systems Working in Maximal Variants of the Set Derivation Mode.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Purely Catalytic P Systems over Integers and Their Generative Power.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Simulating R Systems by P Systems.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Contextual Array Grammars with Matrix and Regular Control.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015
The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems.
Int. J. Found. Comput. Sci., 2015

Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness.
Fundam. Inform., 2015

Variants of Small Universal P Systems with Catalysts.
Fundam. Inform., 2015

Small P Systems with Catalysts or Anti-Matter Simulating Generalized Register Machines and Generalized Counter Automata.
The Computer Science Journal of Moldova, 2015

Contextual array grammars and array P systems.
Ann. Math. Artif. Intell., 2015

Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer ω-Languages.
Proceedings of the Unconventional Computation and Natural Computation, 2015

On the Power of Catalytic P Systems with One Catalyst.
Proceedings of the Membrane Computing, 2015

P Systems with Generalized Multisets Over Totally Ordered Abelian Groups.
Proceedings of the Membrane Computing, 2015

Bridging Deterministic P Systems and Conditional Grammars.
Proceedings of the Membrane Computing, 2015

Polarizationless P Systems with One Active Membrane.
Proceedings of the Membrane Computing, 2015

Non-isometric Contextual Array Grammars with Regular Control and Local Selectors.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

2014
Generating and accepting P systems with minimal left and right insertion and deletion.
Natural Computing, 2014

Array Grammars and Automata on Cayley Grids.
Journal of Automata, Languages and Combinatorics, 2014

Antimatter as a Frontier of Tractability in Membrane Computing.
Fundam. Inform., 2014

Length P Systems.
Fundam. Inform., 2014

Report on UCNC 2014.
Bulletin of the EATCS, 2014

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete.
Proceedings of the Unconventional Computation and Natural Computation, 2014

Red-Green P Automata.
Proceedings of the Membrane Computing, 2014

Promoters and Inhibitors in Purely Catalytic P Systems.
Proceedings of the Membrane Computing, 2014

P Systems with Toxic Objects.
Proceedings of the Membrane Computing, 2014

Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems.
Proceedings of the Membrane Computing, 2014

P Systems with Anti-Matter.
Proceedings of the Membrane Computing, 2014

Matter and Anti-Matter in Membrane Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

P Systems with Anti-Matter.
Proceedings of the Computing with New Resources, 2014

Algebraic Representation of Regular Array Languages on Cayley Graphs.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
A formalization of membrane systems with dynamically evolving structures.
Int. J. Comput. Math., 2013

How to Obtain Computational Completeness in P Systems with One Catalyst.
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules.
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

Array Insertion and Deletion P Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2013

Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

Flattening in (Tissue) P Systems.
Proceedings of the Membrane Computing, 2013

2012
Sequential and maximally parallel multiset rewriting: reversibility and determinism.
Natural Computing, 2012

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011).
RAIRO - Theor. Inf. and Applic., 2012

Self-Stabilization in Membrane Systems.
The Computer Science Journal of Moldova, 2012

P Systems with Minimal Left and Right Insertion and Deletion.
Proceedings of the Unconventional Computation and Natural Computation, 2012

(Tissue) P Systems with Decaying Objects.
Proceedings of the Membrane Computing, 2012

Sequential P Systems with Regular Control.
Proceedings of the Membrane Computing, 2012

Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN.
Proceedings of the Membrane Computing, 2012

2011
(Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode.
Natural Computing, 2011

Preface.
Int. J. Found. Comput. Sci., 2011

Preface.
Fundam. Inform., 2011

A General Framework for Regulated Rewriting Based on the Applicability of Rules.
Proceedings of the Computation, 2011

2010
Graph-Controlled Insertion-Deletion Systems
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Reversibility and Determinism in Sequential Multiset Rewriting.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

Computationally Complete Spiking Neural P Systems without Delay: Two Types of Neurons Are Enough.
Proceedings of the Membrane Computing, 2010

2009
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions.
Fundam. Inform., 2009

Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems
Proceedings of the Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2009

On the Number of Membranes in Unary P Systems
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

P Automata with Controlled Use of Minimal Communication Rules.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

(Tissue) P Systems with Hybrid Transition Modes.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

Transition and Halting Modes in (Tissue) P Systems.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

2008
Cd Grammar Systems with Regular Start Conditions.
Int. J. Found. Comput. Sci., 2008

Extended Spiking Neural P Systems with Decaying Spikes and/or Total Spiking.
Int. J. Found. Comput. Sci., 2008

Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems.
Fundam. Inform., 2008

Membrane Systems Using Noncooperative Rules with Unconditional Halting.
Proceedings of the Membrane Computing - 9th International Workshop, 2008

2007
Multiset random context grammars, checkers, and transducers.
Theor. Comput. Sci., 2007

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
Journal of Automata, Languages and Combinatorics, 2007

Partial Halting in P Systems.
Int. J. Found. Comput. Sci., 2007

Cellular Automata and Parallel Array Systems.
Fundam. Inform., 2007

Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode.
Fundam. Inform., 2007

On String Languages Generated by Spiking Neural P Systems.
Fundam. Inform., 2007

Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings.
Electr. Notes Theor. Comput. Sci., 2007

Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode.
Proceedings of the Unconventional Computation, 6th International Conference, 2007

A Formal Framework for Static (Tissue) P Systems.
Proceedings of the Membrane Computing, 8th International Workshop, 2007

Partial Halting in P Systems Using Membrane Rules with Permitting Contexts.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

CD Grammar Systems with Regular Start Conditions.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

Contextual Array Grammars.
Proceedings of the Formal Models, 2007

2006
Event-Related Outputs of Computations in P Systems.
Journal of Automata, Languages and Combinatorics, 2006

Cell/symbol complexity of tissue P systems with symport/antiport rules.
Int. J. Found. Comput. Sci., 2006

P colonies and prescribed teams.
Int. J. Comput. Math., 2006

Membrane division, restricted membrane creation and object complexity in P systems.
Int. J. Comput. Math., 2006

Routes and Products of Monoids.
Fundam. Inform., 2006

(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes.
Fundam. Inform., 2006

Modeling Dynamical Parallelism in Bio-systems.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

Tissue P Systems with Communication Modes.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

Extended Spiking Neural P Systems.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

A Small Universal Antiport P System with Forbidden Context.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

Special Variants of P Systems with One Catalyst in One Membrane.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005
Tissue P systems with channel states.
Theor. Comput. Sci., 2005

Computationally universal P systems without priorities: two catalysts are sufficient.
Theor. Comput. Sci., 2005

P systems with active membranes and without polarizations.
Soft Comput., 2005

Optimal results for the computational completeness of gemmating (tissue) P systems.
Int. J. Found. Comput. Sci., 2005

P Systems working in the sequential mode on arrays and strings.
Int. J. Found. Comput. Sci., 2005

Representations of Recursively Enumerable Array Languages by Contextual Array Grammars.
Fundam. Inform., 2005

P Colonies Working in the Maximally Parallel and in the Sequential Mode.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

Computational Power of Symport/Antiport: History, Advances, and Open Problems.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

Refining the Nonterminal Complexity of Graph-controlled Grammars.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
From regulated rewriting to computing with membranes: collapsing hierarchies.
Theor. Comput. Sci., 2004

P Systems with Local Graph Productions.
New Generation Comput., 2004

P Systems with Conditional Communication Rules Assigned to Membranes.
Journal of Automata, Languages and Combinatorics, 2004

Implementation of Catalytic P Systems.
Proceedings of the Implementation and Application of Automata, 2004

P Systems Generating Trees.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Asynchronous P Systems and P Systems Working in the Sequential Mode.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

On the Efficiency of P Systems with Active Membranes and Two Polarizations.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Sequential P Systems with Unit Rules and Energy Assigned to Membranes.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Computational Completeness of P Systems with Active Membranes and Two Polarizations.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

P Systems Working in the Sequential Mode on Arrays and Strings.
Proceedings of the Developments in Language Theory, 2004

Gemmating P Systems are Computationally Complete with Four Membranes.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems.
Proceedings of the Aspects of Molecular Computing, 2004

2003
Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k.
Theor. Comput. Sci., 2003

A Note on Emergence in Multi-Agent String Processing Systems.
Computers and Artificial Intelligence, 2003

omega-P Automata with Communication Rules.
Proceedings of the Membrane Computing, International Workshop, 2003

P Systems with Cutting/Recombination Rules Assigned to Membranes.
Proceedings of the Membrane Computing, International Workshop, 2003

On Three Classes of Automata-Like P Systems.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

Generalized Homogeneous P-Systems.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
On Some Operations on Strings Suggested by Gene Assembly in Ciliates.
New Generation Comput., 2002

GP Systems with Forbidding Context.
Fundam. Inform., 2002

A Short Note on Analysing P Systems with Antiport Rules.
Bulletin of the EATCS, 2002

P Systems without Priorities Are Computationally Universal.
Proceedings of the Membrane Computing, International Workshop, 2002

Membrane Systems with Symport/Antiport Rules: Universality Results.
Proceedings of the Membrane Computing, International Workshop, 2002

P Systems with Activated/Prohibited Membrane Channels.
Proceedings of the Membrane Computing, International Workshop, 2002

Energy-Controlled P Systems.
Proceedings of the Membrane Computing, International Workshop, 2002

2001
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization.
Theor. Comput. Sci., 2001

Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of Membranes.
Bulletin of the EATCS, 2001

On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars.
Proceedings of the Machines, 2001

String Rewriting Sequential P-Systems and Regulated Rewriting.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Acceptance of omega-languages by communicating deterministic turing maching.
Proceedings of the Where Mathematics, 2001

2000
Array Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2000

A Hybrid System for the Recognition of Hand-Written Characters.
Proceedings of the Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, [8th International Workshop on Structural and Syntactic Pattern Recognition, 3rd International Workshop on Statistical Techniques in Pattern Recognition], Alicante, Spain, August 30, 2000

Molecular Computing with Generalized Homogeneous P-Systems.
Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000

1999
DNA Computing Based on Splicing: The Existence of Universal Computers.
Theory Comput. Syst., 1999

Generalized P-Systems with Splicing and Cutting/Recombination.
Grammars, 1999

Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Generalized P-Systems.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Test tube systems: when two tubes are enough.
Proceedings of the Developments in Language Theory, 1999

1998
Character Recognition with k-Head Finite Array Automata.
Proceedings of the Advances in Pattern Recognition, 1998

Array Grammar Systems.
Proceedings of the Progreedings of the MFCS '98 Satellite Workshop on Grammar Systems, 1998

The Generative Power of d-Dimensional #-Context-Free Array Grammars.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

Formal Specification and Simulation of Software through Graph Grammars: A General but Minimal Approach.
Proceedings of the COMPSAC '98, 1998

1997
Bounding resources in Cooperating Distributed Grammar Systems.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Watson-Crick finite automata.
Proceedings of the DNA Based Computers, 1997

Accepting Array Grammars with Control Mechanisms.
Proceedings of the New Trends in Formal Languages, 1997

1996
Universal Systems with Operations Related to Splicing.
Computers and Artificial Intelligence, 1996

Test Tube Systems or How to Bake a DNA Cake.
Acta Cybern., 1996

Bounded Parallelism in Array Grammars Used for Character Recognition.
Proceedings of the Advances in Structural and Syntactical Pattern Recognition, 1996

Cutting/Recombination Systems as Generating Devices.
German Conference on Bioinformatics, 1996

1995
A Variant of Team Cooperation in Grammar Systems.
J. UCS, 1995

Cooperating Array Grammar Systems.
IJPRAI, 1995

Array Grammars with Prescribed Teams of Array Productions.
Proceedings of the Developments in Language Theory II, 1995

1993
One-dimensional matrix array grammars.
Elektronische Informationsverarbeitung und Kybernetik, 1993

How Semantical Design Languages Help to Preserve Specification/Design-Consistency.
Proceedings of the SEKE'93, 1993

Aspects of N-Dimensional Lindenmayer Systems.
Proceedings of the Developments in Language Theory, 1993

1992
Applying Graph Grammars for Task-Oriented User Interface Development.
Proceedings of the Computing and Information, 1992

1991
Attributed Elementarz Programmed Graph Grammars.
Proceedings of the 17th International Workshop, 1991

Modelling Feature Maps by Attributed Parallel Array Grammars.
Proceedings of the Proc. 7th Austrian Conference on Artificial Intelligence, 1991

1983
Real Functions and Numbers Defined by Turing Machines.
Theor. Comput. Sci., 1983

Init and Anf Operating on omega-Languages.
Inf. Process. Lett., 1983


  Loading...