Rudolf Freund
Orcid: 0000-0003-1255-1953Affiliations:
- TU Wien, Vienna, Austria
According to our database1,
Rudolf Freund
authored at least 197 papers
between 1983 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on logic.at
On csauthors.net:
Bibliography
2023
A P systems variant for reasoning about sequential controllability of Boolean networks.
Theor. Comput. Sci., August, 2023
2022
Variants of derivation modes for which purely catalytic P systems are computationally complete.
Theor. Comput. Sci., 2022
Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022
Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022
2021
Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete.
J. Membr. Comput., 2021
J. Membr. Comput., 2021
Fundam. Informaticae, 2021
Proceedings of the 21st Conference Information Technologies, 2021
2020
Theor. Comput. Sci., 2020
How derivation modes and halting conditions may influence the computational power of P systems.
J. Membr. Comput., 2020
2019
Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors.
Int. J. Found. Comput. Sci., 2019
Turing machines with activations of transitions.
Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019
Register machines over groups.
Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019
Proceedings of the Descriptional Complexity of Formal Systems, 2019
2018
Extended spiking neural P systems with white hole rules and their red-green variants.
Nat. Comput., 2018
Proceedings of the Unconventional Computation and Natural Computation, 2018
Proceedings of the Membrane Computing, 2018
Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018
Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018
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. Informaticae, 2017
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017
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.
Nat. Comput., 2016
Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting.
Int. J. Unconv. Comput., 2016
P Automata: New ideas and results.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016
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. Informaticae, 2015
Small P Systems with Catalysts or Anti-Matter Simulating Generalized Register Machines and Generalized Counter Automata.
Comput. Sci. J. Moldova, 2015
Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer ω-Languages.
Proceedings of the Unconventional Computation and Natural Computation, 2015
Proceedings of the Membrane Computing, 2015
Proceedings of the Membrane Computing, 2015
Proceedings of the Membrane Computing, 2015
Proceedings of the Membrane Computing, 2015
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015
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.
Nat. Comput., 2014
Fundam. Informaticae, 2014
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
Proceedings of the Membrane Computing, 2014
Proceedings of the Membrane Computing, 2014
Proceedings of the Descriptional Complexity of Formal Systems, 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
Int. J. Comput. Math., 2013
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
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
2012
Nat. Comput., 2012
RAIRO Theor. Informatics Appl., 2012
Proceedings of the Unconventional Computation and Natural Computation, 2012
Proceedings of the Membrane Computing, 2012
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 <i>k</i>-restricted minimally or maximally parallel transition mode.
Nat. Comput., 2011
Proceedings of the Computation, 2011
2010
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010
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
Fundam. Informaticae, 2009
Proceedings of the Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2009
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
Proceedings of the Membrane Computing, 10th International Workshop, 2009
Proceedings of the Membrane Computing, 10th International Workshop, 2009
2008
Int. J. Found. Comput. Sci., 2008
Fundam. Informaticae, 2008
Proceedings of the Membrane Computing - 9th International Workshop, 2008
2007
Theor. Comput. Sci., 2007
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
J. Autom. Lang. Comb., 2007
Fundam. Informaticae, 2007
Fundam. Informaticae, 2007
Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode.
Proceedings of the Unconventional Computation, 6th International Conference, 2007
Proceedings of the Membrane Computing, 8th International Workshop, 2007
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007
2006
Int. J. Found. Comput. Sci., 2006
Int. J. Comput. Math., 2006
Fundam. Informaticae, 2006
Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings.
Proceedings of the First Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2006
Proceedings of the Membrane Computing, 7th International Workshop, 2006
Proceedings of the Membrane Computing, 7th International Workshop, 2006
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
Computationally universal P systems without priorities: two catalysts are sufficient.
Theor. Comput. Sci., 2005
Int. J. Found. Comput. Sci., 2005
Int. J. Found. Comput. Sci., 2005
Representations of Recursively Enumerable Array Languages by Contextual Array Grammars.
Fundam. Informaticae, 2005
Artif. Life Robotics, 2005
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005
Proceedings of the Membrane Computing, 6th International Workshop, 2005
Proceedings of the Membrane Computing, 6th International Workshop, 2005
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
Theor. Comput. Sci., 2004
J. Autom. Lang. Comb., 2004
Proceedings of the Implementation and Application of Automata, 2004
Proceedings of the Membrane Computing, 5th International Workshop, 2004
Proceedings of the Membrane Computing, 5th International Workshop, 2004
Proceedings of the Membrane Computing, 5th International Workshop, 2004
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 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
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
Comput. Artif. Intell., 2003
Proceedings of the Membrane Computing, International Workshop, 2003
Proceedings of the Membrane Computing, International Workshop, 2003
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
New Gener. Comput., 2002
A Short Note on Analysing P Systems with Antiport Rules.
Bull. EATCS, 2002
Proceedings of the Membrane Computing, International Workshop, 2002
Proceedings of the Membrane Computing, International Workshop, 2002
Proceedings of the Membrane Computing, International Workshop, 2002
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.
Bull. EATCS, 2001
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars.
Proceedings of the Machines, 2001
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
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
Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000
Proceedings of the Finite Versus Infinite, 2000
1999
Theory Comput. Syst., 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
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999
Proceedings of the Developments in Language Theory, 1999
1998
Proceedings of the Advances in Pattern Recognition, 1998
The Generative Power of <i>d</i>-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
Proceedings of the New Trends in Formal Languages, 1997
1996
Proceedings of the Advances in Structural and Syntactical Pattern Recognition, 1996
Cutting/Recombination Systems as Generating Devices.
Proceedings of the German Conference on Bioinformatics, 1996
1995
Array Grammars with Prescribed Teams of Array Productions.
Proceedings of the Developments in Language Theory II, 1995
1994
Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994
1993
One-dimensional matrix array grammars.
J. Inf. Process. Cybern., 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
Proceedings of the 17th International Workshop, 1991
Proceedings of the Proc. 7th Austrian Conference on Artificial Intelligence, 1991
1983