The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Rudolf Freund: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Henning Fernau, Rudolf Freund
    Accepting Array Grammars with Control Mechanisms. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:95-118 [Conf]
  2. Rudolf Freund, Franziska Freund
    Generalized Homogeneous P-Systems. [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:381-390 [Conf]
  3. Franziska Freund, Rudolf Freund, Marion Oswald
    Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems. [Citation Graph (0, 0)][DBLP]
    Aspects of Molecular Computing, 2004, pp:139-151 [Conf]
  4. Rudolf Freund, Christian Stary, Herbert Pötzl, Tatjana Svizensky
    Formal Specification and Simulation of Software through Graph Grammars: A General but Minimal Approach. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 1998, pp:148-153 [Conf]
  5. Rudolf Freund
    P Systems Working in the Sequential Mode on Arrays and Strings. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:188-199 [Conf]
  6. Rudolf Freund
    Aspects of N-Dimensional Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:250-261 [Conf]
  7. Artiom Alhazov, Rudolf Freund, Marion Oswald
    Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:100-111 [Conf]
  8. Rudolf Freund
    Array Grammars with Prescribed Teams of Array Productions. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:220-229 [Conf]
  9. Rudolf Freund, Franziska Freund
    Test tube systems: when two tubes are enough. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:338-350 [Conf]
  10. Rudolf Freund, Carlos Martín-Vide, Adam Obtulowicz, Gheorghe Paun
    On Three Classes of Automata-Like P Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:292-303 [Conf]
  11. Petr Sosík, Rudolf Freund
    String Rewriting Sequential P-Systems and Regulated Rewriting. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:379-388 [Conf]
  12. Rudolf Freund, Franziska Freund
    Molecular Computing with Generalized Homogeneous P-Systems. [Citation Graph (0, 0)][DBLP]
    DNA Computing, 2000, pp:130-144 [Conf]
  13. Rudolf Freund
    Generalized P-Systems. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:281-292 [Conf]
  14. Rudolf Freund
    Cutting/Recombination Systems as Generating Devices. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 1996, pp:202-204 [Conf]
  15. Henning Fernau, Rudolf Freund, Markus Holzer
    Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. [Citation Graph (0, 0)][DBLP]
    Grammatical Models of Multi-Agent Systems, 1999, pp:157-181 [Conf]
  16. Henning Fernau, Rudolf Freund, Markus Holzer
    Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. [Citation Graph (0, 0)][DBLP]
    Grammatical Models of Multi-Agent Systems, 1999, pp:284-296 [Conf]
  17. Rudolf Freund, Brigitte Haberstroh, Christian Stary
    Applying Graph Grammars for Task-Oriented User Interface Development. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:389-392 [Conf]
  18. Artiom Alhazov, Rudolf Freund, Gheorghe Paun
    Computational Completeness of P Systems with Active Membranes and Two Polarizations. [Citation Graph (0, 0)][DBLP]
    MCU, 2004, pp:82-92 [Conf]
  19. Henning Fernau, Rudolf Freund, Markus Holzer
    The Generative Power of d-Dimensional #-Context-Free Array Grammars. [Citation Graph (0, 0)][DBLP]
    MCU (2), 1998, pp:43-56 [Conf]
  20. Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron
    Sequential P Systems with Unit Rules and Energy Assigned to Membranes. [Citation Graph (0, 0)][DBLP]
    MCU, 2004, pp:200-210 [Conf]
  21. Rudolf Freund, Gheorghe Paun
    On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:214-225 [Conf]
  22. Artiom Alhazov, Rudolf Freund
    On the Efficiency of P Systems with Active Membranes and Two Polarizations. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2004, pp:146-160 [Conf]
  23. Erzsébet Csuhaj-Varjú, Rudolf Freund, Dragos Sburlan
    Modeling Dynamical Parallelism in Bio-systems. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2006, pp:330-351 [Conf]
  24. Artiom Alhazov, Rudolf Freund, Marion Oswald
    Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2005, pp:96-113 [Conf]
  25. Francesco Bernardini, Rudolf Freund
    Tissue P Systems with Communication Modes. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2006, pp:170-182 [Conf]
  26. Artiom Alhazov, Rudolf Freund, Yurii Rogozhin
    Computational Power of Symport/Antiport: History, Advances, and Open Problems. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2005, pp:1-30 [Conf]
  27. Rudolf Freund
    Asynchronous P Systems and P Systems Working in the Sequential Mode. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2004, pp:36-62 [Conf]
  28. Franziska Freund, Rudolf Freund, Marion Oswald, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan
    P Systems with Cutting/Recombination Rules Assigned to Membranes. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2003, pp:191-202 [Conf]
  29. Rudolf Freund, Marion Oswald, Andrei Paun
    P Systems Generating Trees. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2004, pp:309-319 [Conf]
  30. Rudolf Freund, Marion Oswald, Ludwig Staiger
    omega-P Automata with Communication Rules. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2003, pp:203-217 [Conf]
  31. Artiom Alhazov, Rudolf Freund, Marion Oswald, Marija Slavkovik
    Extended Spiking Neural P Systems. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2006, pp:123-134 [Conf]
  32. Rudolf Freund
    Array Grammar Systems. [Citation Graph (0, 0)][DBLP]
    MFCS Workshop on Grammar Systems, 1998, pp:91-116 [Conf]
  33. Rudolf Freund, Martina Kirchmeyer, Friedrich Tafill
    Modelling Feature Maps by Attributed Parallel Array Grammars. [Citation Graph (0, 0)][DBLP]
    ÖGAI, 1991, pp:83-92 [Conf]
  34. Christian Stary, Rudolf Freund
    How Semantical Design Languages Help to Preserve Specification/Design-Consistency. [Citation Graph (0, 0)][DBLP]
    SEKE, 1993, pp:462-471 [Conf]
  35. Henning Fernau, Rudolf Freund
    Bounded Parallelism in Array Grammars Used for Character Recognition. [Citation Graph (0, 0)][DBLP]
    SSPR, 1996, pp:40-49 [Conf]
  36. Henning Fernau, Rudolf Freund, Markus Holzer
    Character Recognition with k-Head Finite Array Automata. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 1998, pp:282-291 [Conf]
  37. Rudolf Freund, Markus Neubauer, Martin Summerer, Stefan Gruber, Jürgen Schaffer, Roland Swoboda
    A Hybrid System for the Recognition of Hand-Written Characters. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2000, pp:67-76 [Conf]
  38. Rudolf Freund, Brigitte Haberstroh
    Attributed Elementarz Programmed Graph Grammars. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:75-84 [Conf]
  39. Aneta Binder, Rudolf Freund, Georg Lojka, Marion Oswald
    Implementation of Catalytic P Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:45-56 [Conf]
  40. Rudolf Freund
    Energy-Controlled P Systems. [Citation Graph (0, 0)][DBLP]
    WMC-CdeA, 2002, pp:247-260 [Conf]
  41. Rudolf Freund, Marion Oswald
    P Systems with Activated/Prohibited Membrane Channels. [Citation Graph (0, 0)][DBLP]
    WMC-CdeA, 2002, pp:261-269 [Conf]
  42. Rudolf Freund, Andrei Paun
    Membrane Systems with Symport/Antiport Rules: Universality Results. [Citation Graph (0, 0)][DBLP]
    WMC-CdeA, 2002, pp:270-287 [Conf]
  43. Petr Sosík, Rudolf Freund
    P Systems without Priorities Are Computationally Universal. [Citation Graph (0, 0)][DBLP]
    WMC-CdeA, 2002, pp:400-409 [Conf]
  44. Artiom Alhazov, Rudolf Freund, Agustin Riscos-Núñez
    One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems. [Citation Graph (0, 0)][DBLP]
    SYNASC, 2005, pp:385-394 [Conf]
  45. Rudolf Freund, Marion Oswald
    P Colonies Working in the Maximally Parallel and in the Sequential Mode. [Citation Graph (0, 0)][DBLP]
    SYNASC, 2005, pp:419-426 [Conf]
  46. Rudolf Freund, Franziska Freund
    Test Tube Systems or How to Bake a DNA Cake. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1996, v:12, n:4, pp:445-460 [Journal]
  47. Rudolf Freund, F. Wachtler
    Universal Systems with Operations Related to Splicing. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1996, v:15, n:4, pp:- [Journal]
  48. Rudolf Freund, Jozef Kelemen, Gheorghe Paun
    A Note on Emergence in Multi-Agent String Processing Systems. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2003, v:22, n:6, pp:- [Journal]
  49. Rudolf Freund
    Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of Membranes. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:75, n:, pp:209-219 [Journal]
  50. Rudolf Freund, Marion Oswald
    A Short Note on Analysing P Systems with Antiport Rules. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:78, n:, pp:231-236 [Journal]
  51. Rudolf Freund, Gheorghe Paun
    One-dimensional matrix array grammars. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1993, v:29, n:6, pp:357-374 [Journal]
  52. Henning Fernau, Rudolf Freund, Markus Holzer
    Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:159-170 [Journal]
  53. Rudolf Freund, Marion Oswald
    GP Systems with Forbidding Context. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:49, n:1-3, pp:81-102 [Journal]
  54. Alexandru Mateescu, Rudolf Freund
    Routes and Products of Monoids. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:205-211 [Journal]
  55. Artiom Alhazov, Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron
    (Tissue) P Systems with Unit Rules and Energy Assigned to Membranes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:4, pp:391-408 [Journal]
  56. Haiming Chen, Rudolf Freund, Mihai Ionescu, Gheorghe Paun, Mario J. Pérez-Jiménez
    On String Languages Generated by Spiking Neural P Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:75, n:1-4, pp:141-162 [Journal]
  57. Rudolf Freund, Marion Oswald
    Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:76, n:3, pp:305-323 [Journal]
  58. Rudolf Freund
    Generalized P-Systems with Splicing and Cutting/Recombination. [Citation Graph (0, 0)][DBLP]
    Grammars, 1999, v:2, n:3, pp:189-199 [Journal]
  59. Artiom Alhazov, Rudolf Freund, Marion Oswald
    Cell/symbol complexity of tissue P systems with symport/antiport rules. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:1, pp:3-25 [Journal]
  60. Rudolf Freund, Marion Oswald, Andrei Paun
    Optimal results for the computational completeness of gemmating (tissue) P systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:929-942 [Journal]
  61. Rudolf Freund
    P Systems working in the sequential mode on arrays and strings. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:663-682 [Journal]
  62. Jürgen Dassow, Rudolf Freund, Gheorghe Paun
    Cooperating Array Grammar Systems. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 1995, v:9, n:6, pp:1029-1053 [Journal]
  63. Rudolf Freund
    Init and Anf Operating on omega-Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:5, pp:265-269 [Journal]
  64. Rudolf Freund
    Array Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2000, v:5, n:1, pp:13-30 [Journal]
  65. Rudolf Freund, Gheorghe Paun
    A Variant of Team Cooperation in Grammar Systems. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1995, v:1, n:2, pp:105-130 [Journal]
  66. Rudolf Freund, Lila Kari, Gheorghe Paun
    DNA Computing Based on Splicing: The Existence of Universal Computers. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:1, pp:69-112 [Journal]
  67. Rudolf Freund, Carlos Martín-Vide, Victor Mitrana
    On Some Operations on Strings Suggested by Gene Assembly in Ciliates. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 2002, v:20, n:3, pp:279-294 [Journal]
  68. Rudolf Freund, Marion Oswald
    P Systems with Local Graph Productions. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 2004, v:22, n:4, pp:- [Journal]
  69. Rudolf Freund, Andrei Paun
    P systems with active membranes and without polarizations. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2005, v:9, n:9, pp:657-663 [Journal]
  70. Henning Fernau, Markus Holzer, Rudolf Freund
    Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:405-426 [Journal]
  71. Henning Fernau, Markus Holzer, Rudolf Freund
    Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:633-662 [Journal]
  72. Rudolf Freund
    Real Functions and Numbers Defined by Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:23, n:, pp:287-304 [Journal]
  73. Rudolf Freund, Lila Kari, Marion Oswald, Petr Sosík
    Computationally universal P systems without priorities: two catalysts are sufficient. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:251-266 [Journal]
  74. Rudolf Freund, Carlos Martín-Vide, Gheorghe Paun
    From regulated rewriting to computing with membranes: collapsing hierarchies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:143-188 [Journal]
  75. Rudolf Freund, Gheorghe Paun, Mario J. Pérez-Jiménez
    Tissue P systems with channel states. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:101-116 [Journal]
  76. Matteo Cavaliere, Rudolf Freund, Marion Oswald, Dragos Sburlan
    Multiset random context grammars, checkers, and transducers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:372, n:2-3, pp:136-151 [Journal]
  77. Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan
    Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. [Citation Graph (0, 0)][DBLP]
    MCU, 2007, pp:110-121 [Conf]
  78. Rudolf Freund, Gheorghe Paun, Mario J. Pérez-Jiménez
    Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode. [Citation Graph (0, 0)][DBLP]
    UC, 2007, pp:62-76 [Conf]
  79. Rudolf Freund, Marion Oswald
    Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:171, n:2, pp:105-115 [Journal]
  80. Rudolf Freund, Fritz Tafill
    Cellular Automata and Parallel Array Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:78, n:3, pp:311-327 [Journal]

  81. Bounding resources in Cooperating Distributed Grammar Systems. [Citation Graph (, )][DBLP]


  82. A Formal Framework for Static (Tissue) P Systems. [Citation Graph (, )][DBLP]


  83. Membrane Systems Using Noncooperative Rules with Unconditional Halting. [Citation Graph (, )][DBLP]


  84. Transition and Halting Modes in (Tissue) P Systems. [Citation Graph (, )][DBLP]


  85. (Tissue) P Systems with Hybrid Transition Modes. [Citation Graph (, )][DBLP]


  86. On the Number of Membranes in Unary P Systems [Citation Graph (, )][DBLP]


  87. Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems [Citation Graph (, )][DBLP]


  88. Graph-Controlled Insertion-Deletion Systems [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.022secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002