2009 |
95 | EE | Artiom Alhazov,
Marion Oswald,
Rudolf Freund,
Sergey Verlan:
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions.
Fundam. Inform. 91(1): 17-34 (2009) |
2008 |
94 | | 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
Springer 2008 |
93 | EE | Markus Beyreder,
Rudolf Freund:
Membrane Systems Using Noncooperative Rules with Unconditional Halting.
Workshop on Membrane Computing 2008: 129-136 |
92 | EE | Rudolf Freund,
Marion Oswald:
Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems.
Fundam. Inform. 83(1-2): 65-73 (2008) |
91 | EE | Rudolf Freund,
Marion Oswald:
Cd Grammar Systems with Regular Start Conditions.
Int. J. Found. Comput. Sci. 19(4): 767-779 (2008) |
90 | EE | 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) |
2007 |
89 | EE | Artiom Alhazov,
Rudolf Freund,
Marion Oswald,
Sergey Verlan:
Partial Halting in P Systems Using Membrane Rules with Permitting Contexts.
MCU 2007: 110-121 |
88 | EE | 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 |
87 | EE | Rudolf Freund,
Sergey Verlan:
A Formal Framework for Static (Tissue) P Systems.
Workshop on Membrane Computing 2007: 271-284 |
86 | EE | Rudolf Freund,
Marion Oswald:
Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings.
Electr. Notes Theor. Comput. Sci. 171(2): 105-115 (2007) |
85 | | Haiming Chen,
Rudolf Freund,
Mihai Ionescu,
Gheorghe Paun,
Mario J. Pérez-Jiménez:
On String Languages Generated by Spiking Neural P Systems.
Fundam. Inform. 75(1-4): 141-162 (2007) |
84 | EE | Rudolf Freund,
Marion Oswald:
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode.
Fundam. Inform. 76(3): 305-323 (2007) |
83 | EE | Rudolf Freund,
Fritz Tafill:
Cellular Automata and Parallel Array Systems.
Fundam. Inform. 78(3): 311-327 (2007) |
82 | EE | Rudolf Freund,
Marion Oswald:
Partial Halting in P Systems.
Int. J. Found. Comput. Sci. 18(6): 1215-1225 (2007) |
81 | | Henning Fernau,
Rudolf Freund,
Marion Oswald,
Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
Journal of Automata, Languages and Combinatorics 12(1-2): 117-138 (2007) |
80 | EE | Matteo Cavaliere,
Rudolf Freund,
Marion Oswald,
Dragos Sburlan:
Multiset random context grammars, checkers, and transducers.
Theor. Comput. Sci. 372(2-3): 136-151 (2007) |
2006 |
79 | | 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
Springer 2006 |
78 | EE | Artiom Alhazov,
Rudolf Freund,
Marion Oswald,
Marija Slavkovik:
Extended Spiking Neural P Systems.
Workshop on Membrane Computing 2006: 123-134 |
77 | EE | Francesco Bernardini,
Rudolf Freund:
Tissue P Systems with Communication Modes.
Workshop on Membrane Computing 2006: 170-182 |
76 | EE | Erzsébet Csuhaj-Varjú,
Rudolf Freund,
Dragos Sburlan:
Modeling Dynamical Parallelism in Bio-systems.
Workshop on Membrane Computing 2006: 330-351 |
75 | EE | Alexandru Mateescu,
Rudolf Freund:
Routes and Products of Monoids.
Fundam. Inform. 73(1-2): 205-211 (2006) |
74 | EE | Artiom Alhazov,
Rudolf Freund,
Alberto Leporati,
Marion Oswald,
Claudio Zandron:
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes.
Fundam. Inform. 74(4): 391-408 (2006) |
73 | EE | 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) |
72 | EE | Rudolf Freund,
Marion Oswald:
P colonies and prescribed teams.
Int. J. Comput. Math. 83(7): 569-592 (2006) |
71 | EE | 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) |
70 | | Matteo Cavaliere,
Rudolf Freund,
Alexander Leitsch,
Gheorghe Paun:
Event-Related Outputs of Computations in P Systems.
Journal of Automata, Languages and Combinatorics 11(3): 263-278 (2006) |
2005 |
69 | EE | 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 |
68 | EE | Artiom Alhazov,
Rudolf Freund,
Agustin Riscos-Núñez:
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems.
SYNASC 2005: 385-394 |
67 | EE | Rudolf Freund,
Marion Oswald:
P Colonies Working in the Maximally Parallel and in the Sequential Mode.
SYNASC 2005: 419-426 |
66 | EE | Artiom Alhazov,
Rudolf Freund,
Yurii Rogozhin:
Computational Power of Symport/Antiport: History, Advances, and Open Problems.
Workshop on Membrane Computing 2005: 1-30 |
65 | EE | Artiom Alhazov,
Rudolf Freund,
Marion Oswald:
Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules.
Workshop on Membrane Computing 2005: 96-113 |
64 | EE | Henning Fernau,
Rudolf Freund,
Markus Holzer:
Representations of Recursively Enumerable Array Languages by Contextual Array Grammars.
Fundam. Inform. 64(1-4): 159-170 (2005) |
63 | EE | Rudolf Freund:
P Systems working in the sequential mode on arrays and strings.
Int. J. Found. Comput. Sci. 16(4): 663-682 (2005) |
62 | EE | 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) |
61 | EE | Rudolf Freund,
Andrei Paun:
P systems with active membranes and without polarizations.
Soft Comput. 9(9): 657-663 (2005) |
60 | EE | Rudolf Freund,
Gheorghe Paun,
Mario J. Pérez-Jiménez:
Tissue P systems with channel states.
Theor. Comput. Sci. 330(1): 101-116 (2005) |
59 | EE | 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) |
2004 |
58 | EE | Franziska Freund,
Rudolf Freund,
Marion Oswald:
Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems.
Aspects of Molecular Computing 2004: 139-151 |
57 | EE | Aneta Binder,
Rudolf Freund,
Georg Lojka,
Marion Oswald:
Implementation of Catalytic P Systems.
CIAA 2004: 45-56 |
56 | EE | Rudolf Freund:
P Systems Working in the Sequential Mode on Arrays and Strings.
Developments in Language Theory 2004: 188-199 |
55 | EE | Rudolf Freund,
Alberto Leporati,
Marion Oswald,
Claudio Zandron:
Sequential P Systems with Unit Rules and Energy Assigned to Membranes.
MCU 2004: 200-210 |
54 | EE | Artiom Alhazov,
Rudolf Freund,
Gheorghe Paun:
Computational Completeness of P Systems with Active Membranes and Two Polarizations.
MCU 2004: 82-92 |
53 | EE | Artiom Alhazov,
Rudolf Freund:
On the Efficiency of P Systems with Active Membranes and Two Polarizations.
Workshop on Membrane Computing 2004: 146-160 |
52 | EE | Rudolf Freund,
Marion Oswald,
Andrei Paun:
P Systems Generating Trees.
Workshop on Membrane Computing 2004: 309-319 |
51 | EE | Rudolf Freund:
Asynchronous P Systems and P Systems Working in the Sequential Mode.
Workshop on Membrane Computing 2004: 36-62 |
50 | | Rudolf Freund,
Marion Oswald:
P Systems with Conditional Communication Rules Assigned to Membranes.
Journal of Automata, Languages and Combinatorics 9(4): 387-397 (2004) |
49 | EE | Rudolf Freund,
Marion Oswald:
P Systems with Local Graph Productions.
New Generation Comput. 22(4): (2004) |
48 | EE | 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) |
2003 |
47 | EE | 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 |
46 | | Rudolf Freund,
Franziska Freund:
Generalized Homogeneous P-Systems.
Grammars and Automata for String Processing 2003: 381-390 |
45 | EE | 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 |
44 | EE | Rudolf Freund,
Marion Oswald,
Ludwig Staiger:
omega-P Automata with Communication Rules.
Workshop on Membrane Computing 2003: 203-217 |
43 | | Rudolf Freund,
Jozef Kelemen,
Gheorghe Paun:
A Note on Emergence in Multi-Agent String Processing Systems.
Computers and Artificial Intelligence 22(6): (2003) |
42 | EE | 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. 1-3(299): 633-662 (2003) |
2002 |
41 | EE | Rudolf Freund:
Energy-Controlled P Systems.
WMC-CdeA 2002: 247-260 |
40 | EE | Rudolf Freund,
Marion Oswald:
P Systems with Activated/Prohibited Membrane Channels.
WMC-CdeA 2002: 261-269 |
39 | EE | Rudolf Freund,
Andrei Paun:
Membrane Systems with Symport/Antiport Rules: Universality Results.
WMC-CdeA 2002: 270-287 |
38 | EE | Petr Sosík,
Rudolf Freund:
P Systems without Priorities Are Computationally Universal.
WMC-CdeA 2002: 400-409 |
37 | | Rudolf Freund,
Marion Oswald:
A Short Note on Analysing P Systems with Antiport Rules.
Bulletin of the EATCS 78: 231-236 (2002) |
36 | | Rudolf Freund,
Marion Oswald:
GP Systems with Forbidding Context.
Fundam. Inform. 49(1-3): 81-102 (2002) |
35 | | Rudolf Freund,
Carlos Martín-Vide,
Victor Mitrana:
On Some Operations on Strings Suggested by Gene Assembly in Ciliates.
New Generation Comput. 20(3): 279-294 (2002) |
2001 |
34 | EE | Petr Sosík,
Rudolf Freund:
String Rewriting Sequential P-Systems and Regulated Rewriting.
Developments in Language Theory 2001: 379-388 |
33 | EE | Rudolf Freund,
Gheorghe Paun:
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars.
MCU 2001: 214-225 |
32 | | Rudolf Freund:
Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of Membranes.
Bulletin of the EATCS 75: 209-219 (2001) |
31 | EE | 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) |
2000 |
30 | EE | Rudolf Freund,
Franziska Freund:
Molecular Computing with Generalized Homogeneous P-Systems.
DNA Computing 2000: 130-144 |
29 | EE | 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 |
28 | | Rudolf Freund:
Array Grammar Systems.
Journal of Automata, Languages and Combinatorics 5(1): 13-30 (2000) |
1999 |
27 | | Rudolf Freund,
Franziska Freund:
Test tube systems: when two tubes are enough.
Developments in Language Theory 1999: 338-350 |
26 | EE | Rudolf Freund:
Generalized P-Systems.
FCT 1999: 281-292 |
25 | | 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 |
24 | | 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 |
23 | | Rudolf Freund:
Generalized P-Systems with Splicing and Cutting/Recombination.
Grammars 2(3): 189-199 (1999) |
22 | EE | Rudolf Freund,
Lila Kari,
Gheorghe Paun:
DNA Computing Based on Splicing: The Existence of Universal Computers.
Theory Comput. Syst. 32(1): 69-112 (1999) |
1998 |
21 | EE | 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 |
20 | | Henning Fernau,
Rudolf Freund,
Markus Holzer:
The Generative Power of d-Dimensional #-Context-Free Array Grammars.
MCU (2) 1998: 43-56 |
19 | | Rudolf Freund:
Array Grammar Systems.
MFCS Workshop on Grammar Systems 1998: 91-116 |
18 | | Henning Fernau,
Rudolf Freund,
Markus Holzer:
Character Recognition with k-Head Finite Array Automata.
SSPR/SPR 1998: 282-291 |
1997 |
17 | | Henning Fernau,
Markus Holzer,
Rudolf Freund:
Bounding resources in Cooperating Distributed Grammar Systems.
Developments in Language Theory 1997: 261-272 |
16 | | Henning Fernau,
Rudolf Freund:
Accepting Array Grammars with Control Mechanisms.
New Trends in Formal Languages 1997: 95-118 |
1996 |
15 | | Rudolf Freund:
Cutting/Recombination Systems as Generating Devices.
German Conference on Bioinformatics 1996: 202-204 |
14 | | Henning Fernau,
Rudolf Freund:
Bounded Parallelism in Array Grammars Used for Character Recognition.
SSPR 1996: 40-49 |
13 | EE | Rudolf Freund,
Franziska Freund:
Test Tube Systems or How to Bake a DNA Cake.
Acta Cybern. 12(4): 445-460 (1996) |
12 | | Rudolf Freund,
F. Wachtler:
Universal Systems with Operations Related to Splicing.
Computers and Artificial Intelligence 15(4): (1996) |
1995 |
11 | | Rudolf Freund:
Array Grammars with Prescribed Teams of Array Productions.
Developments in Language Theory 1995: 220-229 |
10 | | Jürgen Dassow,
Rudolf Freund,
Gheorghe Paun:
Cooperating Array Grammar Systems.
IJPRAI 9(6): 1029-1053 (1995) |
9 | EE | Rudolf Freund,
Gheorghe Paun:
A Variant of Team Cooperation in Grammar Systems.
J. UCS 1(2): 105-130 (1995) |
1993 |
8 | | Rudolf Freund:
Aspects of N-Dimensional Lindenmayer Systems.
Developments in Language Theory 1993: 250-261 |
7 | | Christian Stary,
Rudolf Freund:
How Semantical Design Languages Help to Preserve Specification/Design-Consistency.
SEKE 1993: 462-471 |
6 | | Rudolf Freund,
Gheorghe Paun:
One-dimensional matrix array grammars.
Elektronische Informationsverarbeitung und Kybernetik 29(6): 357-374 (1993) |
1992 |
5 | | Rudolf Freund,
Brigitte Haberstroh,
Christian Stary:
Applying Graph Grammars for Task-Oriented User Interface Development.
ICCI 1992: 389-392 |
1991 |
4 | | Rudolf Freund,
Martina Kirchmeyer,
Friedrich Tafill:
Modelling Feature Maps by Attributed Parallel Array Grammars.
ÖGAI 1991: 83-92 |
3 | | Rudolf Freund,
Brigitte Haberstroh:
Attributed Elementarz Programmed Graph Grammars.
WG 1991: 75-84 |
1983 |
2 | | Rudolf Freund:
Init and Anf Operating on omega-Languages.
Inf. Process. Lett. 16(5): 265-269 (1983) |
1 | | Rudolf Freund:
Real Functions and Numbers Defined by Turing Machines.
Theor. Comput. Sci. 23: 287-304 (1983) |