default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRudolf Freund
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j87]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, David Orellana-Martín, Antonio Ramírez-de-Arellano, José-Antonio Rodríguez-Gallego:
P systems with reactive membranes. J. Membr. Comput. 6(2): 82-93 (2024)- [j86]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
On the spectrum between reaction systems and string rewriting. Nat. Comput. 23(2): 159-175 (2024) - 2023
- [j85]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan
:
Numerical networks of cells. Theor. Comput. Sci. 958: 113873 (2023) - [j84]Artiom Alhazov, Vincent Ferrari-Dominguez, Rudolf Freund, Nicolas Glade, Sergiu Ivanov:
A P systems variant for reasoning about sequential controllability of Boolean networks. Theor. Comput. Sci. 970: 114056 (2023) - [e15]Benedek Nagy, Rudolf Freund:
Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2023, Famagusta, North Cyprus, 18th-19th September, 2023. EPTCS 388, 2023 [contents] - [i1]Artiom Alhazov, Vincent Ferrari-Dominguez, Rudolf Freund, Nicolas Glade, Sergiu Ivanov:
A P Systems Variant for Reasoning about Sequential Controllability of Boolean Networks. CoRR abs/2303.00110 (2023) - 2022
- [j83]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Tissue P Systems with Vesicles of Multisets. Int. J. Found. Comput. Sci. 33(3&4): 179-202 (2022) - [j82]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Regulated Insertion-Deletion Systems. J. Autom. Lang. Comb. 27(1-3): 15-45 (2022) - [j81]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Marion Oswald:
Variants of derivation modes for which purely catalytic P systems are computationally complete. Theor. Comput. Sci. 920: 95-112 (2022) - [c114]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Prescribed Teams of Rules Working on Several Objects. MCU 2022: 27-41 - [c113]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks. NCMA 2022: 28-48 - 2021
- [j80]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Marion Oswald:
Relations between Control Mechanisms for Sequential Grammars. Fundam. Informaticae 181(2-3): 239-271 (2021) - [j79]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
P systems with limited number of objects. J. Membr. Comput. 3(1): 1-9 (2021) - [j78]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
When catalytic P systems with one catalyst can be computationally complete. J. Membr. Comput. 3(3): 170-181 (2021) - [j77]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete. J. Membr. Comput. 3(4): 233-245 (2021) - [j76]David Doty, Rudolf Freund, Natasa Jonoska, Jarkko Kari:
Preface. Nat. Comput. 20(4): 637-638 (2021) - [c112]Rudolf Freund:
The Power of Parallelism in Membrane Computing. ITAT 2021: 1-16 - [e14]Rudolf Freund, Tseren-Onolt Ishdorj, Grzegorz Rozenberg, Arto Salomaa, Claudio Zandron:
Membrane Computing - 21st International Conference, CMC 2020, Virtual Event, September 14-18, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12687, Springer 2021, ISBN 978-3-030-77101-0 [contents] - 2020
- [j75]Rudolf Freund:
How derivation modes and halting conditions may influence the computational power of P systems. J. Membr. Comput. 2(1): 14-25 (2020) - [j74]Sergey Verlan, Rudolf Freund, Artiom Alhazov, Sergiu Ivanov, Linqiang Pan:
A formal framework for spiking neural P systems. J. Membr. Comput. 2(4): 355-368 (2020) - [j73]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Linqiang Pan, Bosheng Song:
Time-freeness and clock-freeness and related concepts in P systems. Theor. Comput. Sci. 805: 127-143 (2020) - [j72]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
P systems with randomized right-hand sides of rules. Theor. Comput. Sci. 805: 144-160 (2020)
2010 – 2019
- 2019
- [j71]Rudolf Freund, Vladimir Rogojin, Sergey Verlan:
Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors. Int. J. Found. Comput. Sci. 30(6-7): 1005-1027 (2019) - [j70]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
Variants of P systems with activation and blocking of rules. Nat. Comput. 18(3): 593-608 (2019) - [c111]Rudolf Freund:
A General Framework for Sequential Grammars with Control Mechanisms. DCFS 2019: 1-34 - [c110]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
Register machines over groups. NCMA 2019: 31-46 - [c109]Rudolf Freund, Ludwig Staiger:
Turing machines with activations of transitions. NCMA 2019: 79-91 - [e13]Rudolf Freund, Markus Holzer, José M. Sempere:
Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2019, Valencia, Spain, July 2-3, 2019. Österreichische Computer Gesellschaft 2019, ISBN 978-3-903035-25-6 [contents] - 2018
- [j69]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Marion Oswald, Sergey Verlan:
Extended spiking neural P systems with white hole rules and their red-green variants. Nat. Comput. 17(2): 297-310 (2018) - [c108]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Marion Oswald, Sergey Verlan:
Chocolate P Automata. Enjoying Natural Computing 2018: 1-20 - [c107]Rudolf Freund:
Control Mechanisms for Array Grammars on Cayley Grids. MCU 2018: 1-33 - [c106]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
Sequential Grammars with Activation and Blocking of Rules. MCU 2018: 51-68 - [c105]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Tissue P Systems with Point Mutation Rules. Int. Conf. on Membrane Computing 2018: 33-56 - [c104]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
P Systems with Activation and Blocking of Rules. UCNC 2018: 1-15 - [p3]Artiom Alhazov, Sergey Verlan, Rudolf Freund:
Small Universal Reversible Counter Machines. Reversibility and Universality 2018: 433-446 - [e12]Rudolf Freund, Michal Hospodár, Galina Jirásková, Giovanni Pighizzini:
Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018. Österreichische Computer Gesellschaft 2018, ISBN 978-3-903035-21-8 [contents] - 2017
- [j68]Erzsébet Csuhaj-Varjú, Rudolf Freund, György Vaszil:
Watson-Crick T0L Systems and Red-Green Register Machines. Fundam. Informaticae 155(1-2): 111-129 (2017) - [j67]Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors. Fundam. Informaticae 155(1-2): 209-232 (2017) - [j66]Artiom Alhazov, Henning Fernau, Rudolf Freund, Sergiu Ivanov, Rani Siromoney, K. G. Subramanian:
Contextual array grammars with matrix control, regular control languages, and tissue P systems control. Theor. Comput. Sci. 682: 5-21 (2017) - [c103]Rudolf Freund, Vladimir Rogojin, Sergey Verlan:
Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. DCFS 2017: 140-151 - [c102]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
Hierarchical P Systems with Randomized Right-Hand Sides of Rules. Int. Conf. on Membrane Computing 2017: 15-39 - [c101]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
(Tissue) P Systems with Vesicles of Multisets. AFL 2017: 11-25 - [e11]Rudolf Freund, Frantisek Mráz, Daniel Prusa:
Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA 2017, Prague, Czech Republic, August 17-18, 2017. Österreichische Computer Gesellschaft 2017, ISBN 978-3-903035-18-8 [contents] - 2016
- [j65]Suna Bensch, Rudolf Freund, Mika Hirvensalo, Friedrich Otto:
Preface. Fundam. Informaticae 148(3-4): i-ii (2016) - [j64]Rudolf Freund, Sergiu Ivanov, Ludwig Staiger:
Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting. Int. J. Unconv. Comput. 12(1): 51-69 (2016) - [j63]Artiom Alhazov, Rudolf Freund, Vladimir Rogozhin, Yurii Rogozhin:
Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors. Nat. Comput. 15(1): 51-68 (2016) - [c100]Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Contextual Array Grammars with Matrix and Regular Control. DCFS 2016: 98-110 - [c99]Artiom Alhazov, Bogdan Aman, Rudolf Freund, Sergiu Ivanov:
Simulating R Systems by P Systems. Int. Conf. on Membrane Computing 2016: 51-66 - [c98]Artiom Alhazov, Omar Belingheri, Rudolf Freund, Sergiu Ivanov, Antonio E. Porreca, Claudio Zandron:
Purely Catalytic P Systems over Integers and Their Generative Power. Int. Conf. on Membrane Computing 2016: 67-82 - [c97]Artiom Alhazov, Rudolf Freund, Sergey Verlan:
P Systems Working in Maximal Variants of the Set Derivation Mode. Int. Conf. on Membrane Computing 2016: 83-102 - [c96]Rudolf Freund:
P Automata: New ideas and results. NCMA 2016: 13-40 - [e10]Henning Bordihn, Rudolf Freund, Benedek Nagy, György Vaszil:
Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings. books@ocg.at 321, Österreichische Computer Gesellschaft 2016, ISBN 978-3-903035-10-2 [contents] - 2015
- [j62]Henning Fernau, Rudolf Freund, Markus L. Schmid, K. G. Subramanian, Petra Wiederhold:
Contextual array grammars and array P systems. Ann. Math. Artif. Intell. 75(1-2): 5-26 (2015) - [j61]Artiom Alhazov, Rudolf Freund, Petr Sosík:
Small P Systems with Catalysts or Anti-Matter Simulating Generalized Register Machines and Generalized Counter Automata. Comput. Sci. J. Moldova 23(3): 304-328 (2015) - [j60]Rudolf Freund, Marion Oswald, Gheorghe Paun:
Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness. Fundam. Informaticae 136(1-2): 59-84 (2015) - [j59]Artiom Alhazov, Rudolf Freund:
Variants of Small Universal P Systems with Catalysts. Fundam. Informaticae 138(1-2): 227-250 (2015) - [j58]Henning Fernau, Rudolf Freund, Markus Holzer:
The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems. Int. J. Found. Comput. Sci. 26(8): 1167-1188 (2015) - [c95]Erzsébet Csuhaj-Varjú, Rudolf Freund, György Vaszil:
A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems. MCU 2015: 31-44 - [c94]Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. MCU 2015: 61-78 - [c93]Artiom Alhazov, Rudolf Freund:
Polarizationless P Systems with One Active Membrane. Int. Conf. on Membrane Computing 2015: 51-62 - [c92]Artiom Alhazov, Rudolf Freund, Sergey Verlan:
Bridging Deterministic P Systems and Conditional Grammars. Int. Conf. on Membrane Computing 2015: 63-76 - [c91]Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
P Systems with Generalized Multisets Over Totally Ordered Abelian Groups. Int. Conf. on Membrane Computing 2015: 117-136 - [c90]Rudolf Freund, Petr Sosík:
On the Power of Catalytic P Systems with One Catalyst. Int. Conf. on Membrane Computing 2015: 137-152 - [c89]Rudolf Freund, Sergiu Ivanov, Ludwig Staiger:
Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer ω-Languages. UCNC 2015: 169-180 - [e9]Rudolf Freund, Markus Holzer, Nelma Moreira, Rogério Reis:
Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31 - September 1, 2015. Proceedings. books@ocg.at 318, Österreichische Computer Gesellschaft 2015, ISBN 978-3-903035-07-2 [contents] - 2014
- [j57]Hava T. Siegelmann, Rudolf Freund:
Report on UCNC 2014. Bull. EATCS 114 (2014) - [j56]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
Length P Systems. Fundam. Informaticae 134(1-2): 17-37 (2014) - [j55]Daniel Díaz-Pernil, Francisco Peña-Cantillana, Artiom Alhazov, Rudolf Freund, Miguel Angel Gutiérrez-Naranjo:
Antimatter as a Frontier of Tractability in Membrane Computing. Fundam. Informaticae 134(1-2): 83-96 (2014) - [j54]Rudolf Freund, Marion Oswald:
Array Grammars and Automata on Cayley Grids. J. Autom. Lang. Comb. 19(1-4): 67-80 (2014) - [j53]Rudolf Freund, Yurii Rogozhin, Sergey Verlan:
Generating and accepting P systems with minimal left and right insertion and deletion. Nat. Comput. 13(2): 257-268 (2014) - [c88]Rudolf Freund, Marion Oswald:
Algebraic Representation of Regular Array Languages on Cayley Graphs. Discrete Mathematics and Computer Science 2014: 165-187 - [c87]Rudolf Freund, Gheorghe Paun:
P Systems with Anti-Matter. Computing with New Resources 2014: 409-420 - [c86]Artiom Alhazov, Bogdan Aman, Rudolf Freund, Gheorghe Paun:
Matter and Anti-Matter in Membrane Systems. DCFS 2014: 65-76 - [c85]Artiom Alhazov, Bogdan Aman, Rudolf Freund:
P Systems with Anti-Matter. Int. Conf. on Membrane Computing 2014: 66-85 - [c84]Artiom Alhazov, Rudolf Freund:
Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems. Int. Conf. on Membrane Computing 2014: 86-98 - [c83]Artiom Alhazov, Rudolf Freund:
P Systems with Toxic Objects. Int. Conf. on Membrane Computing 2014: 99-125 - [c82]Artiom Alhazov, Rudolf Freund, Sergey Verlan:
Promoters and Inhibitors in Purely Catalytic P Systems. Int. Conf. on Membrane Computing 2014: 126-138 - [c81]Bogdan Aman, Erzsébet Csuhaj-Varjú, Rudolf Freund:
Red-Green P Automata. Int. Conf. on Membrane Computing 2014: 139-157 - [c80]Artiom Alhazov, Rudolf Freund, Yurii Rogozhin:
Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete. UCNC 2014: 1-13 - [c79]Henning Fernau, Rudolf Freund, Markus Holzer:
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes. AFL 2014: 246-260 - [e8]Suna Bensch, Rudolf Freund, Friedrich Otto:
Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28-29, 2014. Proceedings. books@ocg.at 304, Österreichische Computer Gesellschaft 2014, ISBN 978-3-85403-304-2 [contents] - 2013
- [j52]Rudolf Freund, Ignacio Pérez-Hurtado, Agustin Riscos-Núñez, Sergey Verlan:
A formalization of membrane systems with dynamically evolving structures. Int. J. Comput. Math. 90(4): 801-815 (2013) - [c78]Rudolf Freund, Alberto Leporati, Giancarlo Mauri, Antonio E. Porreca, Sergey Verlan, Claudio Zandron:
Flattening in (Tissue) P Systems. Int. Conf. on Membrane Computing 2013: 173-188 - [c77]Rudolf Freund, Marion Oswald:
Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness. NCMA 2013: 133-150 - [c76]Henning Fernau, Rudolf Freund, Sergiu Ivanov, Markus L. Schmid, K. G. Subramanian:
Array Insertion and Deletion P Systems. UCNC 2013: 67-78 - [c75]Rudolf Freund, Gheorghe Paun:
How to Obtain Computational Completeness in P Systems with One Catalyst. MCU 2013: 47-61 - [c74]Rudolf Freund, Sergiu Ivanov, Marion Oswald, K. G. Subramanian:
One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules. MCU 2013: 62-75 - [e7]Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto:
Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings. books@ocg.at 294, Österreichische Computer Gesellschaft 2013, ISBN 978-3-85403-294-6 [contents] - 2012
- [j51]Marco Antoniotti, Rudolf Freund, Alberto Leporati, Giancarlo Mauri:
Self-Stabilization in Membrane Systems. Comput. Sci. J. Moldova 20(2): 133-146 (2012) - [j50]Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano:
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). RAIRO Theor. Informatics Appl. 46(4): 459-460 (2012) - [j49]Artiom Alhazov, Rudolf Freund, Kenichi Morita:
Sequential and maximally parallel multiset rewriting: reversibility and determinism. Nat. Comput. 11(1): 95-106 (2012) - [c73]Rudolf Freund:
(Tissue) P Systems with Decaying Objects. Int. Conf. on Membrane Computing 2012: 1-25 - [c72]Artiom Alhazov, Rudolf Freund:
Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN. Int. Conf. on Membrane Computing 2012: 101-111 - [c71]Artiom Alhazov, Rudolf Freund, Hilbert Heikenwälder, Marion Oswald, Yurii Rogozhin, Sergey Verlan:
Sequential P Systems with Regular Control. Int. Conf. on Membrane Computing 2012: 112-127 - [c70]Rudolf Freund, Yurii Rogozhin, Sergey Verlan:
P Systems with Minimal Left and Right Insertion and Deletion. UCNC 2012: 82-93 - [e6]Rudolf Freund, Markus Holzer, Bianca Truthe, Ulrich Ultes-Nitsche:
Fourth Workshop on Non-Classical Models for Automata and Applications - NCMA 2012, Fribourg, Switzerland, August 23-24, 2012. Proceedings. books@ocg.at 290, Österreichische Computer Gesellschaft 2012, ISBN 978-3-85403-290-8 [contents] - 2011
- [j48]Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto:
Preface. Fundam. Informaticae 112(2-3) (2011) - [j47]Rudolf Freund, Marian Gheorghe, Solomon Marcus, Victor Mitrana, Mario J. Pérez-Jiménez:
Preface. Int. J. Found. Comput. Sci. 22(1) (2011) - [j46]Rudolf Freund, Sergey Verlan:
(Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode. Nat. Comput. 10(2): 821-833 (2011) - [c69]Rudolf Freund, Marian Kogler, Marion Oswald:
A General Framework for Regulated Rewriting Based on the Applicability of Rules. Computation, Cooperation, and Life 2011: 35-53 - [e5]Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano:
Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings. books@ocg.at 282, Austrian Computer Society 2011, ISBN 978-3-85403-282-3 [contents] - 2010
- [c68]Rudolf Freund, Marian Kogler:
Computationally Complete Spiking Neural P Systems without Delay: Two Types of Neurons Are Enough. Int. Conf. on Membrane Computing 2010: 198-207 - [c67]Artiom Alhazov, Rudolf Freund, Kenichi Morita:
Reversibility and Determinism in Sequential Multiset Rewriting. UC 2010: 21-31 - [c66]Rudolf Freund, Marian Kogler, Yurii Rogozhin, Sergey Verlan:
Graph-Controlled Insertion-Deletion Systems. DCFS 2010: 88-98 - [e4]Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto:
Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings. books@ocg.at 263, Austrian Computer Society 2010, ISBN 978-3-85403-263-2 [contents]
2000 – 2009
- 2009
- [j45]Artiom Alhazov, Marion Oswald, Rudolf Freund, Sergey Verlan:
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions. Fundam. Informaticae 91(1): 17-34 (2009) - [c65]Rudolf Freund:
Transition and Halting Modes in (Tissue) P Systems. Workshop on Membrane Computing 2009: 18-29 - [c64]Rudolf Freund, Marian Kogler:
(Tissue) P Systems with Hybrid Transition Modes. Workshop on Membrane Computing 2009: 252-263 - [c63]Rudolf Freund, Marian Kogler, Sergey Verlan:
P Automata with Controlled Use of Minimal Communication Rules. NCMA 2009: 107-120 - [c62]Rudolf Freund, Andreas Klein, Martin Kutrib:
On the Number of Membranes in Unary P Systems. DCFS 2009: 101-109 - [c61]Rudolf Freund, Marian Kogler:
Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems. MeCBIC 2009: 123-135 - [e3]Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto:
Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings. books@ocg.at 256, Austrian Computer Society 2009, ISBN 978-3-85403-256-4 [contents] - 2008
- [j44]Rudolf Freund, Marion Oswald:
Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems. Fundam. Informaticae 83(1-2): 65-73 (2008) - [j43]Rudolf Freund, Marion Oswald:
Cd Grammar Systems with Regular Start Conditions. Int. J. Found. Comput. Sci. 19(4): 767-779 (2008) - [j42]Rudolf Freund, Mihai Ionescu, Marion Oswald:
Extended Spiking Neural P Systems with Decaying Spikes and/or Total Spiking. Int. J. Found. Comput. Sci. 19(5): 1223-1234 (2008) - [c60]Markus Beyreder, Rudolf Freund:
Membrane Systems Using Noncooperative Rules with Unconditional Halting. Workshop on Membrane Computing 2008: 129-136 - [e2]Cristian S. Calude, José Félix Costa, Rudolf Freund, Marion Oswald, Grzegorz Rozenberg:
Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. Proceedings. Lecture Notes in Computer Science 5204, Springer 2008, ISBN 978-3-540-85193-6 [contents] - 2007
- [j41]Haiming Chen, Rudolf Freund, Mihai Ionescu, Gheorghe Paun, Mario J. Pérez-Jiménez:
On String Languages Generated by Spiking Neural P Systems. Fundam. Informaticae 75(1-4): 141-162 (2007) - [j40]Rudolf Freund, Marion Oswald:
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode. Fundam. Informaticae 76(3): 305-323 (2007) - [j39]Rudolf Freund, Fritz Tafill:
Cellular Automata and Parallel Array Systems. Fundam. Informaticae 78(3): 311-327 (2007) - [j38]Rudolf Freund, Marion Oswald:
Partial Halting in P Systems. Int. J. Found. Comput. Sci. 18(6): 1215-1225 (2007) - [j37]Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. J. Autom. Lang. Comb. 12(1-2): 117-138 (2007) - [j36]Matteo Cavaliere, Rudolf Freund, Marion Oswald, Dragos Sburlan:
Multiset random context grammars, checkers, and transducers. Theor. Comput. Sci. 372(2-3): 136-151 (2007) - [c59]Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg:
Contextual Array Grammars. Formal Models, Languages and Applications 2007: 112-136 - [c58]Rudolf Freund, Marion Oswald:
CD Grammar Systems with Regular Start Conditions. DCFS 2007: 69-80 - [c57]Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan:
Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. MCU 2007: 110-121 - [c56]Rudolf Freund, Sergey Verlan:
A Formal Framework for Static (Tissue) P Systems. Workshop on Membrane Computing 2007: 271-284 - [c55]Rudolf Freund, Gheorghe Paun, Mario J. Pérez-Jiménez:
Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode. UC 2007: 62-76 - 2006
- [j35]Alexandru Mateescu, Rudolf Freund:
Routes and Products of Monoids. Fundam. Informaticae 73(1-2): 205-211 (2006) - [j34]Artiom Alhazov, Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron:
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes. Fundam. Informaticae 74(4): 391-408 (2006) - [j33]Artiom Alhazov, Rudolf Freund, Agustin Riscos-Núñez:
Membrane division, restricted membrane creation and object complexity in P systems. Int. J. Comput. Math. 83(7): 529-547 (2006) - [j32]Rudolf Freund, Marion Oswald:
P colonies and prescribed teams. Int. J. Comput. Math. 83(7): 569-592 (2006) - [j31]Artiom Alhazov, Rudolf Freund, Marion Oswald:
Cell/symbol complexity of tissue P systems with symport/antiport rules. Int. J. Found. Comput. Sci. 17(1): 3-25 (2006) - [j30]Matteo Cavaliere, Rudolf Freund, Alexander Leitsch, Gheorghe Paun:
Event-Related Outputs of Computations in P Systems. J. Autom. Lang. Comb. 11(3): 263-278 (2006) - [c54]Rudolf Freund:
Special Variants of P Systems with One Catalyst in One Membrane. DCFS 2006: 250-258 - [c53]Rudolf Freund, Marion Oswald:
A Small Universal Antiport P System with Forbidden Context. DCFS 2006: 259-266 - [c52]Artiom Alhazov, Rudolf Freund, Marion Oswald, Marija Slavkovik:
Extended Spiking Neural P Systems. Workshop on Membrane Computing 2006: 123-134 - [c51]Francesco Bernardini, Rudolf Freund:
Tissue P Systems with Communication Modes. Workshop on Membrane Computing 2006: 170-182 - [c50]Erzsébet Csuhaj-Varjú, Rudolf Freund, Dragos Sburlan:
Modeling Dynamical Parallelism in Bio-systems. Workshop on Membrane Computing 2006: 330-351 - [c49]Rudolf Freund, Marion Oswald:
Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings. MeCBIC@ICALP 2006: 105-115 - [e1]Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers. Lecture Notes in Computer Science 3850, Springer 2006, ISBN 3-540-30948-9 [contents] - 2005
- [j29]Aneta Binder, Rudolf Freund, Marion Oswald:
Modelling artificial life by attributed eco-array grammars. Artif. Life Robotics 9(1): 63-66 (2005) - [j28]Henning Fernau, Rudolf Freund, Markus Holzer:
Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Fundam. Informaticae 64(1-4): 159-170 (2005) - [j27]Rudolf Freund:
P Systems working in the sequential mode on arrays and strings. Int. J. Found. Comput. Sci. 16(4): 663-682 (2005) - [j26]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) - [j25]Rudolf Freund, Andrei Paun:
P systems with active membranes and without polarizations. Soft Comput. 9(9): 657-663 (2005) - [j24]Rudolf Freund, Gheorghe Paun, Mario J. Pérez-Jiménez:
Tissue P systems with channel states. Theor. Comput. Sci. 330(1): 101-116 (2005) - [j23]Rudolf Freund, Lila Kari, Marion Oswald, Petr Sosík:
Computationally universal P systems without priorities: two catalysts are sufficient. Theor. Comput. Sci. 330(2): 251-266 (2005) - [c48]Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-controlled Grammars. DCFS 2005: 110-121 - [c47]Artiom Alhazov, Rudolf Freund, Marion Oswald:
Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells. Developments in Language Theory 2005: 100-111 - [c46]Artiom Alhazov, Rudolf Freund, Yurii Rogozhin:
Computational Power of Symport/Antiport: History, Advances, and Open Problems. Workshop on Membrane Computing 2005: 1-30 - [c45]Artiom Alhazov, Rudolf Freund, Marion Oswald:
Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules. Workshop on Membrane Computing 2005: 96-113 - [c44]Artiom Alhazov, Rudolf Freund, Agustin Riscos-Núñez:
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems. SYNASC 2005: 385-394 - [c43]Rudolf Freund, Marion Oswald:
P Colonies Working in the Maximally Parallel and in the Sequential Mode. SYNASC 2005: 419-426 - 2004
- [j22]Rudolf Freund, Marion Oswald:
P Automata with membrane channels. Artif. Life Robotics 8(2): 186-189 (2004) - [j21]Rudolf Freund, Marion Oswald:
P Automata with membrane channels. Artif. Life Robotics 8(2): 186-189 (2004) - [j20]Rudolf Freund, Marion Oswald:
P Systems with Conditional Communication Rules Assigned to Membranes. J. Autom. Lang. Comb. 9(4): 387-397 (2004) - [j19]Rudolf Freund, Marion Oswald:
P Systems with Local Graph Productions. New Gener. Comput. 22(4): 365-375 (2004) - [j18]Rudolf Freund, Carlos Martín-Vide, Gheorghe Paun:
From regulated rewriting to computing with membranes: collapsing hierarchies. Theor. Comput. Sci. 312(2-3): 143-188 (2004) - [c42]Franziska Freund, Rudolf Freund, Marion Oswald:
Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems. Aspects of Molecular Computing 2004: 139-151 - [c41]Rudolf Freund, Marion Oswald, Andrei Paun:
Gemmating P Systems are Computationally Complete with Four Membranes. DCFS 2004: 191-203 - [c40]Rudolf Freund:
P Systems Working in the Sequential Mode on Arrays and Strings. Developments in Language Theory 2004: 188-199 - [c39]Artiom Alhazov, Rudolf Freund, Gheorghe Paun:
Computational Completeness of P Systems with Active Membranes and Two Polarizations. MCU 2004: 82-92 - [c38]Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron:
Sequential P Systems with Unit Rules and Energy Assigned to Membranes. MCU 2004: 200-210 - [c37]Rudolf Freund:
Asynchronous P Systems and P Systems Working in the Sequential Mode. Workshop on Membrane Computing 2004: 36-62 - [c36]Artiom Alhazov, Rudolf Freund:
On the Efficiency of P Systems with Active Membranes and Two Polarizations. Workshop on Membrane Computing 2004: 146-160 - [c35]Rudolf Freund, Marion Oswald, Andrei Paun:
P Systems Generating Trees. Workshop on Membrane Computing 2004: 309-319 - [c34]Aneta Binder, Rudolf Freund, Georg Lojka, Marion Oswald:
Implementation of Catalytic P Systems. CIAA 2004: 45-56 - 2003
- [j17]Jozef Kelemen, Rudolf Freund, Gheorghe Paun:
A Note on Emergence in Multi-Agent String Processing Systems. Comput. Artif. Intell. 22(6): 623-637 (2003) - [j16]Henning Fernau, Markus Holzer, Rudolf Freund:
Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. Theor. Comput. Sci. 299(1-3): 633-662 (2003) - [c33]Rudolf Freund, Franziska Freund:
Generalized Homogeneous P-Systems. Grammars and Automata for String Processing 2003: 381-390 - [c32]Rudolf Freund, Marion Oswald, Petr Sosík:
Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities. DCFS 2003: 102-113 - [c31]Rudolf Freund, Carlos Martín-Vide, Adam Obtulowicz, Gheorghe Paun:
On Three Classes of Automata-Like P Systems. Developments in Language Theory 2003: 292-303 - [c30]Franziska Freund, Rudolf Freund, Marion Oswald, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
P Systems with Cutting/Recombination Rules Assigned to Membranes. Workshop on Membrane Computing 2003: 191-202 - [c29]Rudolf Freund, Marion Oswald, Ludwig Staiger:
omega-P Automata with Communication Rules. Workshop on Membrane Computing 2003: 203-217 - 2002
- [j15]Rudolf Freund, Marion Oswald:
A Short Note on Analysing P Systems with Antiport Rules. Bull. EATCS 78: 231-236 (2002) - [j14]Rudolf Freund, Marion Oswald:
GP Systems with Forbidding Context. Fundam. Informaticae 49(1-3): 81-102 (2002) - [j13]Rudolf Freund, Carlos Martín-Vide, Victor Mitrana:
On Some Operations on Strings Suggested by Gene Assembly in Ciliates. New Gener. Comput. 20(3): 279-294 (2002) - [c28]Rudolf Freund:
Energy-Controlled P Systems. WMC-CdeA 2002: 247-260 - [c27]Rudolf Freund, Marion Oswald:
P Systems with Activated/Prohibited Membrane Channels. WMC-CdeA 2002: 261-269 - [c26]Rudolf Freund, Andrei Paun:
Membrane Systems with Symport/Antiport Rules: Universality Results. WMC-CdeA 2002: 270-287 - [c25]Petr Sosík, Rudolf Freund:
P Systems without Priorities Are Computationally Universal. WMC-CdeA 2002: 400-409 - 2001
- [j12]Rudolf Freund:
Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of Membranes. Bull. EATCS 75: 209-219 (2001) - [j11]Henning Fernau, Markus Holzer, Rudolf Freund:
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theor. Comput. Sci. 259(1-2): 405-426 (2001) - [c24]Rudolf Freund, Ludwig Staiger:
Acceptance of omega-languages by communicating deterministic turing maching. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 115-126 - [c23]Petr Sosík, Rudolf Freund:
String Rewriting Sequential P-Systems and Regulated Rewriting. Developments in Language Theory 2001: 379-388 - [c22]Rudolf Freund, Gheorghe Paun:
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars. MCU 2001: 214-225 - 2000
- [j10]Rudolf Freund:
Array Grammar Systems. J. Autom. Lang. Comb. 5(1): 13-29 (2000) - [c21]Rudolf Freund, Franziska Freund:
Molecular Computing with Generalized Homogeneous P-Systems. DNA Computing 2000: 130-144 - [c20]Rudolf Freund, Markus Neubauer, Martin Summerer, Stefan Gruber, Jürgen Schaffer, Roland Swoboda:
A Hybrid System for the Recognition of Hand-Written Characters. SSPR/SPR 2000: 67-76 - [p2]Rudolf Freund, Alexandru Mateescu, Arto Salomaa:
Algebraic Representations of Regular Array Languages. Finite Versus Infinite 2000: 127-148
1990 – 1999
- 1999
- [j9]Rudolf Freund:
Generalized P-Systems with Splicing and Cutting/Recombination. Grammars 2(3): 189-199 (1999) - [j8]Rudolf Freund, Lila Kari, Gheorghe Paun:
DNA Computing Based on Splicing: The Existence of Universal Computers. Theory Comput. Syst. 32(1): 69-112 (1999) - [c19]Rudolf Freund, Franziska Freund:
Test tube systems: when two tubes are enough. Developments in Language Theory 1999: 338-350 - [c18]Rudolf Freund:
Generalized P-Systems. FCT 1999: 281-292 - [c17]Henning Fernau, Rudolf Freund, Markus Holzer:
Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. Grammatical Models of Multi-Agent Systems 1999: 157-181 - [c16]Henning Fernau, Rudolf Freund, Markus Holzer:
Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. Grammatical Models of Multi-Agent Systems 1999: 284-296 - 1998
- [c15]Rudolf Freund, Christian Stary, Herbert Pötzl, Tatjana Svizensky:
Formal Specification and Simulation of Software through Graph Grammars: A General but Minimal Approach. COMPSAC 1998: 148-153 - [c14]Henning Fernau, Rudolf Freund, Markus Holzer:
The Generative Power of d-Dimensional #-Context-Free Array Grammars. MCU (2) 1998: 43-56 - [c13]Rudolf Freund:
Array Grammar Systems. MFCS Workshop on Grammar Systems 1998: 91-116 - [c12]Henning Fernau, Rudolf Freund, Markus Holzer:
Character Recognition with k-Head Finite Array Automata. SSPR/SPR 1998: 282-291 - 1997
- [c11]Henning Fernau, Rudolf Freund:
Accepting Array Grammars with Control Mechanisms. New Trends in Formal Languages 1997: 95-118 - [c10]Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Watson-Crick finite automata. DNA Based Computers 1997: 297-327 - [c9]Henning Fernau, Markus Holzer, Rudolf Freund:
Bounding resources in Cooperating Distributed Grammar Systems. Developments in Language Theory 1997: 261-272 - 1996
- [j7]Rudolf Freund, Franziska Freund:
Test Tube Systems or How to Bake a DNA Cake. Acta Cybern. 12(4): 445-459 (1996) - [j6]Rudolf Freund, F. Wachtler:
Universal Systems with Operations Related to Splicing. Comput. Artif. Intell. 15(4): 273-294 (1996) - [c8]Rudolf Freund:
Cutting/Recombination Systems as Generating Devices. German Conference on Bioinformatics 1996: 202-204 - [c7]Henning Fernau, Rudolf Freund:
Bounded Parallelism in Array Grammars Used for Character Recognition. SSPR 1996: 40-49 - 1995
- [j5]Jürgen Dassow, Rudolf Freund, Gheorghe Paun:
Cooperating Array Grammar Systems. Int. J. Pattern Recognit. Artif. Intell. 9(6): 1029-1053 (1995) - [j4]Rudolf Freund, Gheorghe Paun:
A Variant of Team Cooperation in Grammar Systems. J. Univers. Comput. Sci. 1(2): 105-130 (1995) - [c6]Rudolf Freund:
Array Grammars with Prescribed Teams of Array Productions. Developments in Language Theory 1995: 220-229 - 1994
- [p1]Rudolf Freund:
Control Mechanisms on #-Context-Free Array Grammars. Mathematical Aspects of Natural and Formal Languages 1994: 97-136 - 1993
- [j3]Rudolf Freund, Gheorghe Paun:
One-dimensional matrix array grammars. J. Inf. Process. Cybern. 29(6): 357-374 (1993) - [c5]Rudolf Freund:
Aspects of N-Dimensional Lindenmayer Systems. Developments in Language Theory 1993: 250-261 - [c4]Christian Stary, Rudolf Freund:
How Semantical Design Languages Help to Preserve Specification/Design-Consistency. SEKE 1993: 462-471 - 1992
- [c3]Rudolf Freund, Brigitte Haberstroh, Christian Stary:
Applying Graph Grammars for Task-Oriented User Interface Development. ICCI 1992: 389-392 - 1991
- [c2]Rudolf Freund, Martina Kirchmeyer, Friedrich Tafill:
Modelling Feature Maps by Attributed Parallel Array Grammars. ÖGAI 1991: 83-92 - [c1]Rudolf Freund, Brigitte Haberstroh:
Attributed Elementarz Programmed Graph Grammars. WG 1991: 75-84
1980 – 1989
- 1983
- [j2]Rudolf Freund:
Init and Anf Operating on omega-Languages. Inf. Process. Lett. 16(5): 265-269 (1983) - [j1]Rudolf Freund:
Real Functions and Numbers Defined by Turing Machines. Theor. Comput. Sci. 23: 287-304 (1983)
Coauthor Index
[j87] [j86] [j85] [j84] [i1] [j83] [j82] [j81] [c114] [c113] [j80] [j79] [j78] [j77] [j74] [j73] [j72] [j70] [c110] [j69] [c108] [c106] [c105] [c104] [p3] [j66] [c102] [c101] [j63] [c99] [c98] [c97] [j61] [j59] [c93] [c92] [j56] [j55] [c86] [c85] [c84] [c83] [c82] [c80] [j49] [c72] [c71] [c67] [j45] [c57] [j34] [j33] [j31] [c52] [c47] [c46] [c45] [c44] [c39] [c36]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
