Rudolf Freund - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

PrefaceRudolf Freund, Marian Gheorghe, Solomon Marcus, Victor Mitrana, Mario J. Pérez-Jiménez. ijfcs, 22(1), 2011. [doi]

(Tissue) P systems working in the ::::k::::-restricted minimally or maximally parallel transition modeRudolf Freund, Sergey Verlan. nc, 10(2):821-833, 2011. [doi]

2010

Reversibility and Determinism in Sequential Multiset RewritingArtiom Alhazov, Rudolf Freund, Kenichi Morita. uc 2010: 21-31 [doi]

Computationally Complete Spiking Neural P Systems without Delay: Two Types of Neurons Are EnoughRudolf Freund, Marian Kogler. membrane 2011: 198-207 [doi]

2009

Partial Halting and Minimal Parallelism Based on Arbitrary Rule PartitionsArtiom Alhazov, Marion Oswald, Rudolf Freund, Sergey Verlan. FUIN, 91(1):17-34, 2009. [doi]

Transition and Halting Modes in (Tissue) P SystemsRudolf Freund. membrane 2010: 18-29 [doi]

(Tissue) P Systems with Hybrid Transition ModesRudolf Freund, Marian Kogler. membrane 2010: 252-263 [doi]

2008

Membrane Systems Using Noncooperative Rules with Unconditional HaltingMarkus Beyreder, Rudolf Freund. membrane 2009: 129-136 [doi]

Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. ProceedingsCristian S. Calude, José Félix Costa, Rudolf Freund, Marion Oswald, Grzegorz Rozenberg, editors, Volume 5204 of Lecture Notes in Computer Science, Springer, 2008.

Regular omega-Languages Defined by Finite Extended Spiking Neural P SystemsRudolf Freund, Marion Oswald. FUIN, 83(1-2):65-73, 2008. [doi]

Extended Spiking Neural P Systems with Decaying Spikes and/or Total SpikingRudolf Freund, Mihai Ionescu, Marion Oswald. ijfcs, 19(5):1223-1234, 2008. [doi]

Cd Grammar Systems with Regular Start ConditionsRudolf Freund, Marion Oswald. ijfcs, 19(4):767-779, 2008. [doi]

2007

Partial Halting in P Systems Using Membrane Rules with Permitting ContextsArtiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan. mcu 2007: 110-121 [doi]

Multiset random context grammars, checkers, and transducersMatteo Cavaliere, Rudolf Freund, Marion Oswald, Dragos Sburlan. TCS, 372(2-3):136-151, 2007. [doi]

On String Languages Generated by Spiking Neural P SystemsHaiming Chen, Rudolf Freund, Mihai Ionescu, Gheorghe Paun, Mario J. Pérez-Jiménez. FUIN, 75(1-4):141-162, 2007.

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix GrammarsHenning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt. jalc, 12(1-2):117-138, 2007.

Cellular Automata and Parallel Array SystemsRudolf Freund, Fritz Tafill. FUIN, 78(3):311-327, 2007. [doi]

Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on StringsRudolf Freund, Marion Oswald. ENTCS, 171(2):105-115, 2007. [doi]

Polarizationless P Systems with Active Membranes Working in the Minimally Parallel ModeRudolf Freund, Gheorghe Paun, Mario J. Pérez-Jiménez. uc 2007: 62-76 [doi]

Partial Halting in P SystemsRudolf Freund, Marion Oswald. ijfcs, 18(6):1215-1225, 2007. [doi]

A Formal Framework for Static (Tissue) P SystemsRudolf Freund, Sergey Verlan. membrane 2007: 271-284 [doi]

Modelling Grammar Systems by Tissue P Systems Working in the Sequential ModeRudolf Freund, Marion Oswald. FUIN, 76(3):305-323, 2007. [doi]

2006

Extended Spiking Neural P SystemsArtiom Alhazov, Rudolf Freund, Marion Oswald, Marija Slavkovik. membrane 2006: 123-134 [doi]

Membrane division, restricted membrane creation and object complexity in P systemsArtiom Alhazov, Rudolf Freund, Agustin Riscos-Núñez. ijcm, 83(7):529-547, 2006. [doi]

Cell/symbol complexity of tissue P systems with symport/antiport rulesArtiom Alhazov, Rudolf Freund, Marion Oswald. ijfcs, 17(1):3-25, 2006. [doi]

(Tissue) P Systems with Unit Rules and Energy Assigned to MembranesArtiom Alhazov, Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron. FUIN, 74(4):391-408, 2006. [doi]

Tissue P Systems with Communication ModesFrancesco Bernardini, Rudolf Freund. membrane 2006: 170-182 [doi]

Event-Related Outputs of Computations in P SystemsMatteo Cavaliere, Rudolf Freund, Alexander Leitsch, Gheorghe Paun. jalc, 11(3):263-278, 2006.

Modeling Dynamical Parallelism in Bio-systemsErzsébet Csuhaj-Varjú, Rudolf Freund, Dragos Sburlan. membrane 2006: 330-351 [doi]

Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited PapersRudolf Freund, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, editors, Volume 3850 of Lecture Notes in Computer Science, Springer, 2006.

P colonies and prescribed teamsRudolf Freund, Marion Oswald. ijcm, 83(7):569-592, 2006. [doi]

Routes and Products of MonoidsAlexandru Mateescu, Rudolf Freund. FUIN, 73(1-2):205-211, 2006. [doi]

2005

One and Two Polarizations, Membrane Creation and Objects Complexity in P SystemsArtiom Alhazov, Rudolf Freund, Agustin Riscos-Núñez. synasc 2005: 385-394 [doi]

Computational Power of Symport/Antiport: History, Advances, and Open ProblemsArtiom Alhazov, Rudolf Freund, Yurii Rogozhin. membrane 2006: 1-30 [doi]

Tissue P Systems with Antiport Rules and Small Numbers of Symbols and CellsArtiom Alhazov, Rudolf Freund, Marion Oswald. dlt 2005: 100-111 [doi]

Symbol/Membrane Complexity of P Systems with Symport/Antiport RulesArtiom Alhazov, Rudolf Freund, Marion Oswald. membrane 2006: 96-113 [doi]

Representations of Recursively Enumerable Array Languages by Contextual Array GrammarsHenning Fernau, Rudolf Freund, Markus Holzer. FUIN, 64(1-4):159-170, 2005. [doi]

P Colonies Working in the Maximally Parallel and in the Sequential ModeRudolf Freund, Marion Oswald. synasc 2005: 419-426 [doi]

P systems with active membranes and without polarizationsRudolf Freund, Andrei Paun. soco, 9(9):657-663, 2005. [doi]

Tissue P systems with channel statesRudolf Freund, Gheorghe Paun, Mario J. Pérez-Jiménez. TCS, 330(1):101-116, 2005. [doi]

Computationally universal P systems without priorities: two catalysts are sufficientRudolf Freund, Lila Kari, Marion Oswald, Petr Sosík. TCS, 330(2):251-266, 2005. [doi]

P Systems working in the sequential mode on arrays and stringsRudolf Freund. ijfcs, 16(4):663-682, 2005. [doi]

Optimal results for the computational completeness of gemmating (tissue) P systemsRudolf Freund, Marion Oswald, Andrei Paun. ijfcs, 16(5):929-942, 2005. [doi]

2004

On the Efficiency of P Systems with Active Membranes and Two PolarizationsArtiom Alhazov, Rudolf Freund. membrane 2005: 146-160 [doi]

Computational Completeness of P Systems with Active Membranes and Two PolarizationsArtiom Alhazov, Rudolf Freund, Gheorghe Paun. mcu 2005: 82-92 [doi]

Implementation of Catalytic P SystemsAneta Binder, Rudolf Freund, Georg Lojka, Marion Oswald. wia 2004: 45-56 [doi]

Asynchronous P Systems and P Systems Working in the Sequential ModeRudolf Freund. membrane 2005: 36-62 [doi]

P Systems Generating TreesRudolf Freund, Marion Oswald, Andrei Paun. membrane 2005: 309-319 [doi]

P Systems Working in the Sequential Mode on Arrays and StringsRudolf Freund. dlt 2004: 188-199 [doi]

Splicing Test Tube Systems and Their Relation to Splicing Membrane SystemsFranziska Freund, Rudolf Freund, Marion Oswald. BIRTHDAY 2004: 139-151 [doi]

From regulated rewriting to computing with membranes: collapsing hierarchiesRudolf Freund, Carlos Martín-Vide, Gheorghe Paun. TCS, 312(2-3):143-188, 2004. [doi]

P Systems with Local Graph ProductionsRudolf Freund, Marion Oswald. ngc, 22(4), 2004. [doi]

Sequential P Systems with Unit Rules and Energy Assigned to MembranesRudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron. mcu 2005: 200-210 [doi]

P Systems with Conditional Communication Rules Assigned to MembranesRudolf Freund, Marion Oswald. jalc, 9(4):387-397, 2004.

2003

Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =kHenning Fernau, Markus Holzer, Rudolf Freund. TCS, 1-3(299):633-662, 2003. [doi]

Generalized Homogeneous P-SystemsRudolf Freund, Franziska Freund. BIRTHDAY 2003: 381-390

A Note on Emergence in Multi-Agent String Processing SystemsRudolf Freund, Jozef Kelemen, Gheorghe Paun. cai, 22(6), 2003.

On Three Classes of Automata-Like P SystemsRudolf Freund, Carlos Martín-Vide, Adam Obtulowicz, Gheorghe Paun. dlt 2003: 292-303 [doi]

P Systems with Cutting/Recombination Rules Assigned to MembranesFranziska Freund, Rudolf Freund, Marion Oswald, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan. membrane 2004: 191-202 [doi]

omega-P Automata with Communication RulesRudolf Freund, Marion Oswald, Ludwig Staiger. membrane 2004: 203-217 [doi]

2002

2001

Hybrid modes in cooperating distributed grammar systems: internal versus external hybridizationHenning Fernau, Markus Holzer, Rudolf Freund. TCS, 259(1-2):405-426, 2001. [doi]

Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of MembranesRudolf Freund. eatcs, 75:209-219, 2001.

On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix GrammarsRudolf Freund, Gheorghe Paun. mcu 2001: 214-225 [doi]

String Rewriting Sequential P-Systems and Regulated RewritingPetr Sosík, Rudolf Freund. dlt 2002: 379-388 [doi]

2000

Molecular Computing with Generalized Homogeneous P-SystemsRudolf Freund, Franziska Freund. dna 2001: 130-144 [doi]

A Hybrid System for the Recognition of Hand-Written CharactersRudolf Freund, Markus Neubauer, Martin Summerer, Stefan Gruber, Jürgen Schaffer, Roland Swoboda. gacm 2000: 67-76 [doi]

Array Grammar SystemsRudolf Freund. jalc, 5(1):13-30, 2000.

1999

1998

1997

Bounding resources in Cooperating Distributed Grammar SystemsHenning Fernau, Markus Holzer, Rudolf Freund. dlt 1997: 261-272

Accepting Array Grammars with Control MechanismsHenning Fernau, Rudolf Freund. BIRTHDAY 1997: 95-118

1996

Bounded Parallelism in Array Grammars Used for Character RecognitionHenning Fernau, Rudolf Freund. gacm 1996: 40-49

Cutting/Recombination Systems as Generating DevicesRudolf Freund. gcb 1997: 202-204

Universal Systems with Operations Related to SplicingRudolf Freund, F. Wachtler. cai, 15(4), 1996.

Test Tube Systems or How to Bake a DNA CakeRudolf Freund, Franziska Freund. actaC, 12(4):445-460, 1996. [doi]

1995

Cooperating Array Grammar SystemsJürgen Dassow, Rudolf Freund, Gheorghe Paun. ijprai, 9(6):1029-1053, 1995.

A Variant of Team Cooperation in Grammar SystemsRudolf Freund, Gheorghe Paun. jucs, 1(2):105-130, 1995. [doi]

Array Grammars with Prescribed Teams of Array ProductionsRudolf Freund. dlt 1995: 220-229

1993

Aspects of N-Dimensional Lindenmayer SystemsRudolf Freund. dlt 1993: 250-261

One-dimensional matrix array grammarsRudolf Freund, Gheorghe Paun. eik, 29(6):357-374, 1993.

How Semantical Design Languages Help to Preserve Specification/Design-ConsistencyChristian Stary, Rudolf Freund. seke 1993: 462-471

1992

Applying Graph Grammars for Task-Oriented User Interface DevelopmentRudolf Freund, Brigitte Haberstroh, Christian Stary. icci 1992: 389-392

1991

Modelling Feature Maps by Attributed Parallel Array GrammarsRudolf Freund, Martina Kirchmeyer, Friedrich Tafill. ogai 1991: 83-92

Attributed Elementarz Programmed Graph GrammarsRudolf Freund, Brigitte Haberstroh. criwg 1992: 75-84

1983

Real Functions and Numbers Defined by Turing MachinesRudolf Freund. TCS, 23:287-304, 1983.

PreviousNext