Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Rudolf Freund
2010 – today
- 2013
[j50]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)- [c73]Rudolf Freund, Marion Oswald: Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness. NCMA 2013: 133-150
- [c72]Henning Fernau, Rudolf Freund, Sergiu Ivanov, Markus L. Schmid, K. G. Subramanian: Array Insertion and Deletion P Systems. UCNC 2013: 67-78
- [e7]Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto (Eds.): 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
- [i2]Rudolf Freund, Gheorghe Paun: How to Obtain Computational Completeness in P Systems with One Catalyst. CoRR abs/1309.1267 (2013)
- [i1]Rudolf Freund, Sergiu Ivanov, Marion Oswald, K. G. Subramanian: One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules. CoRR abs/1309.1268 (2013)
- 2012
- [j49]Marco Antoniotti, Rudolf Freund, Alberto Leporati, Giancarlo Mauri: Self-Stabilization in Membrane Systems. The Computer Science Journal of Moldova 20(2): 133-146 (2012)
- [j48]Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano: Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). RAIRO - Theor. Inf. and Applic. 46(4): 459-460 (2012)
- [j47]Artiom Alhazov, Rudolf Freund, Kenichi Morita: Sequential and maximally parallel multiset rewriting: reversibility and determinism. Natural Computing 11(1): 95-106 (2012)
- [c71]Rudolf Freund: (Tissue) P Systems with Decaying Objects. Int. Conf. on Membrane Computing 2012: 1-25
- [c70]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
- [c69]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
- [c68]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 (Eds.): 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
- 2011
- [j46]Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto: Preface. Fundam. Inform. 112(2-3) (2011)
- [j45]Rudolf Freund, Marian Gheorghe, Solomon Marcus, Victor Mitrana, Mario J. Pérez-Jiménez: Preface. Int. J. Found. Comput. Sci. 22(1) (2011)
- [j44]Rudolf Freund, Sergey Verlan: (Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode. Natural Computing 10(2): 821-833 (2011)
- [c67]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 (Eds.): 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
- 2010
- [c66]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
- [c65]Artiom Alhazov, Rudolf Freund, Kenichi Morita: Reversibility and Determinism in Sequential Multiset Rewriting. UC 2010: 21-31
- [c64]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 (Eds.): 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
2000 – 2009
- 2009
- [j43]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)
- [c63]Rudolf Freund: Transition and Halting Modes in (Tissue) P Systems. Workshop on Membrane Computing 2009: 18-29
- [c62]Rudolf Freund, Marian Kogler: (Tissue) P Systems with Hybrid Transition Modes. Workshop on Membrane Computing 2009: 252-263
- [c61]Rudolf Freund, Marian Kogler, Sergey Verlan: P Automata with Controlled Use of Minimal Communication Rules. NCMA 2009: 107-120
- [c60]Rudolf Freund, Andreas Klein, Martin Kutrib: On the Number of Membranes in Unary P Systems. DCFS 2009: 101-109
- [c59]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 (Eds.): 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
- 2008
- [j42]Rudolf Freund, Marion Oswald: Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems. Fundam. Inform. 83(1-2): 65-73 (2008)
- [j41]Rudolf Freund, Marion Oswald: Cd Grammar Systems with Regular Start Conditions. Int. J. Found. Comput. Sci. 19(4): 767-779 (2008)
- [j40]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)
- [c58]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 (Eds.): 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
- 2007
- [j39]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)
- [j38]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)
- [j37]Rudolf Freund, Marion Oswald: Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode. Fundam. Inform. 76(3): 305-323 (2007)
- [j36]Rudolf Freund, Fritz Tafill: Cellular Automata and Parallel Array Systems. Fundam. Inform. 78(3): 311-327 (2007)
- [j35]Rudolf Freund, Marion Oswald: Partial Halting in P Systems. Int. J. Found. Comput. Sci. 18(6): 1215-1225 (2007)
- [j34]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)
- [j33]Matteo Cavaliere, Rudolf Freund, Marion Oswald, Dragos Sburlan: Multiset random context grammars, checkers, and transducers. Theor. Comput. Sci. 372(2-3): 136-151 (2007)
- [c57]Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg: Contextual Array Grammars. Formal Models, Languages and Applications 2007: 112-136
- [c56]
- [c55]Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan: Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. MCU 2007: 110-121
- [c54]Rudolf Freund, Sergey Verlan: A Formal Framework for Static (Tissue) P Systems. Workshop on Membrane Computing 2007: 271-284
- [c53]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
- [j32]Alexandru Mateescu, Rudolf Freund: Routes and Products of Monoids. Fundam. Inform. 73(1-2): 205-211 (2006)
- [j31]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)
- [j30]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)
- [j29]Rudolf Freund, Marion Oswald: P colonies and prescribed teams. Int. J. Comput. Math. 83(7): 569-592 (2006)
- [j28]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)
- [j27]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)
- [c52]
- [c51]Rudolf Freund, Marion Oswald: A Small Universal Antiport P System with Forbidden Context. DCFS 2006: 259-266
- [c50]Artiom Alhazov, Rudolf Freund, Marion Oswald, Marija Slavkovik: Extended Spiking Neural P Systems. Workshop on Membrane Computing 2006: 123-134
- [c49]Francesco Bernardini, Rudolf Freund: Tissue P Systems with Communication Modes. Workshop on Membrane Computing 2006: 170-182
- [c48]Erzsébet Csuhaj-Varjú, Rudolf Freund, Dragos Sburlan: Modeling Dynamical Parallelism in Bio-systems. Workshop on Membrane Computing 2006: 330-351
- [e1]Rudolf Freund, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa (Eds.): 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
- 2005
- [j26]Henning Fernau, Rudolf Freund, Markus Holzer: Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Fundam. Inform. 64(1-4): 159-170 (2005)
- [j25]Rudolf Freund: P Systems working in the sequential mode on arrays and strings. Int. J. Found. Comput. Sci. 16(4): 663-682 (2005)
- [j24]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)
- [j23]Rudolf Freund, Andrei Paun: P systems with active membranes and without polarizations. Soft Comput. 9(9): 657-663 (2005)
- [j22]Rudolf Freund, Gheorghe Paun, Mario J. Pérez-Jiménez: Tissue P systems with channel states. Theor. Comput. Sci. 330(1): 101-116 (2005)
- [j21]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)
- [c47]Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt: Refining the Nonterminal Complexity of Graph-controlled Grammars. DCFS 2005: 110-121
- [c46]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
- [c45]Artiom Alhazov, Rudolf Freund, Yurii Rogozhin: Computational Power of Symport/Antiport: History, Advances, and Open Problems. Workshop on Membrane Computing 2005: 1-30
- [c44]Artiom Alhazov, Rudolf Freund, Marion Oswald: Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules. Workshop on Membrane Computing 2005: 96-113
- [c43]Artiom Alhazov, Rudolf Freund, Agustin Riscos-Núñez: One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems. SYNASC 2005: 385-394
- [c42]Rudolf Freund, Marion Oswald: P Colonies Working in the Maximally Parallel and in the Sequential Mode. SYNASC 2005: 419-426
- 2004
- [j20]Rudolf Freund, Marion Oswald: P Systems with Conditional Communication Rules Assigned to Membranes. Journal of Automata, Languages and Combinatorics 9(4): 387-397 (2004)
- [j19]Rudolf Freund, Marion Oswald: P Systems with Local Graph Productions. New Generation 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)
- [c41]Franziska Freund, Rudolf Freund, Marion Oswald: Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems. Aspects of Molecular Computing 2004: 139-151
- [c40]Rudolf Freund, Marion Oswald, Andrei Paun: Gemmating P Systems are Computationally Complete with Four Membranes. DCFS 2004: 191-203
- [c39]Rudolf Freund: P Systems Working in the Sequential Mode on Arrays and Strings. Developments in Language Theory 2004: 188-199
- [c38]Artiom Alhazov, Rudolf Freund, Gheorghe Paun: Computational Completeness of P Systems with Active Membranes and Two Polarizations. MCU 2004: 82-92
- [c37]Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron: Sequential P Systems with Unit Rules and Energy Assigned to Membranes. MCU 2004: 200-210
- [c36]Rudolf Freund: Asynchronous P Systems and P Systems Working in the Sequential Mode. Workshop on Membrane Computing 2004: 36-62
- [c35]Artiom Alhazov, Rudolf Freund: On the Efficiency of P Systems with Active Membranes and Two Polarizations. Workshop on Membrane Computing 2004: 146-160
- [c34]Rudolf Freund, Marion Oswald, Andrei Paun: P Systems Generating Trees. Workshop on Membrane Computing 2004: 309-319
- [c33]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. Computers and Artificial Intelligence 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. 1-3(299): 633-662 (2003)
- [c32]Rudolf Freund, Franziska Freund: Generalized Homogeneous P-Systems. Grammars and Automata for String Processing 2003: 381-390
- [c31]Rudolf Freund, Marion Oswald, Petr Sosík: Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities. DCFS 2003: 102-113
- [c30]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
- [c29]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
- [c28]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. Bulletin of the EATCS 78: 231-236 (2002)
- [j14]Rudolf Freund, Marion Oswald: GP Systems with Forbidding Context. Fundam. Inform. 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 Generation Comput. 20(3): 279-294 (2002)
- [c27]
- [c26]Rudolf Freund, Marion Oswald: P Systems with Activated/Prohibited Membrane Channels. WMC-CdeA 2002: 261-269
- [c25]Rudolf Freund, Andrei Paun: Membrane Systems with Symport/Antiport Rules: Universality Results. WMC-CdeA 2002: 270-287
- [c24]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. Bulletin of the 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)
- [c23]Rudolf Freund, Ludwig Staiger: Acceptance of omega-languages by communicating deterministic turing maching. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 115-126
- [c22]Petr Sosík, Rudolf Freund: String Rewriting Sequential P-Systems and Regulated Rewriting. Developments in Language Theory 2001: 379-388
- [c21]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. Journal of Automata, Languages and Combinatorics 5(1): 13-30 (2000)
- [c20]Rudolf Freund, Franziska Freund: Molecular Computing with Generalized Homogeneous P-Systems. DNA Computing 2000: 130-144
- [c19]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
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)
- [c18]Rudolf Freund, Franziska Freund: Test tube systems: when two tubes are enough. Developments in Language Theory 1999: 338-350
- [c17]
- [c16]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
- [c15]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
- [c14]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
- [c13]Henning Fernau, Rudolf Freund, Markus Holzer: The Generative Power of d-Dimensional #-Context-Free Array Grammars. MCU (2) 1998: 43-56
- [c12]
- [c11]Henning Fernau, Rudolf Freund, Markus Holzer: Character Recognition with k-Head Finite Array Automata. SSPR/SPR 1998: 282-291
- 1997
- [c10]Henning Fernau, Rudolf Freund: Accepting Array Grammars with Control Mechanisms. New Trends in Formal Languages 1997: 95-118
- [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. Computers and Artificial Intelligence 15(4) (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. IJPRAI 9(6): 1029-1053 (1995)
- [j4]Rudolf Freund, Gheorghe Paun: A Variant of Team Cooperation in Grammar Systems. J. UCS 1(2): 105-130 (1995)
- [c6]Rudolf Freund: Array Grammars with Prescribed Teams of Array Productions. Developments in Language Theory 1995: 220-229
- 1993
- [j3]Rudolf Freund, Gheorghe Paun: One-dimensional matrix array grammars. Elektronische Informationsverarbeitung und Kybernetik 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]
1980 – 1989
- 1983
- [j2]
- [j1]Rudolf Freund: Real Functions and Numbers Defined by Turing Machines. Theor. Comput. Sci. 23: 287-304 (1983)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-16 21:27 CEST by the dblp team