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.
Jürgen Dassow
2010 – today
- 2013
[j85]Fernando Arroyo, Juan Castellanos, Jürgen Dassow, Victor Mitrana, José-Ramón Sánchez-Couso: Accepting splicing systems with permitting and forbidding words. Acta Inf. 50(1): 1-14 (2013)- [j84]Jürgen Dassow, Florin Manea, Bianca Truthe: Networks of evolutionary processors: the power of subregular filters. Acta Inf. 50(1): 41-75 (2013)
- [c54]Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller: Inner Palindromic Closure. Developments in Language Theory 2013: 155-166
- 2012
- [j83]Jürgen Dassow, Florin Manea, Bianca Truthe: Generating Networks of Splicing Processors. RAIRO - Theor. Inf. and Applic. 46(4): 547-572 (2012)
- [j82]Jürgen Dassow, Tomás Masopust: On restricted context-free grammars. J. Comput. Syst. Sci. 78(1): 293-304 (2012)
- [j81]Jürgen Dassow, Florin Manea, Bianca Truthe: Networks of evolutionary processors: computationally complete normal forms. Natural Computing 11(4): 595-607 (2012)
- [j80]Jürgen Dassow, Florin Manea, Bianca Truthe: On external contextual grammars with subregular selection languages. Theor. Comput. Sci. 449: 64-73 (2012)
- [j79]Sherzod Turaev, Jürgen Dassow, Florin Manea, Mohd Hasan Selamat: Language classes generated by tree controlled grammars with bounded nonterminal complexity. Theor. Comput. Sci. 449: 134-144 (2012)
- [c53]Jürgen Dassow, Florin Manea, Robert Mercas: Connecting Partial Words and Regular Languages. CiE 2012: 151-161
- [c52]Jürgen Dassow, Ronny Harbich: Production Complexity of Some Operations on Context-Free Languages. DCFS 2012: 141-154
- [c51]
- [c50]Jürgen Dassow, Bianca Truthe: Extended Splicing Systems with Subregular Sets of Splicing Rules. NCMA 2012: 65-78
- 2011
- [j78]Jürgen Dassow, Bianca Truthe: On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata. Fundam. Inform. 112(2-3): 157-170 (2011)
- [j77]Jürgen Dassow, Victor Mitrana, Bianca Truthe: The role of evolutionary operations in accepting hybrid networks of evolutionary processors. Inf. Comput. 209(3): 368-382 (2011)
- [j76]Jürgen Dassow, György Vaszil: On the Number of Active Symbols in Lindenmayer Systems. Int. J. Found. Comput. Sci. 22(1): 223-235 (2011)
- [j75]Henning Bordihn, Jürgen Dassow, Martin Kutrib, Bianca Truthe: Editorial. Journal of Automata, Languages and Combinatorics 16(2-4): 71-74 (2011)
- [j74]Sherzod Turaev, Jürgen Dassow, Mohd Hasan Selamat: Nonterminal complexity of tree controlled grammars. Theor. Comput. Sci. 412(41): 5789-5795 (2011)
- [j73]Daniel Lobo, Francisco J. Vico, Jürgen Dassow: Graph grammars with string-regulated rewriting. Theor. Comput. Sci. 412(43): 6101-6111 (2011)
- [c49]Jürgen Dassow, Florin Manea, Bianca Truthe: On Contextual Grammars with Subregular Selection Languages. DCFS 2011: 135-146
- [c48]Sherzod Turaev, Jürgen Dassow, Mohd Hasan Selamat: Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. DCFS 2011: 289-300
- [c47]Jürgen Dassow, Florin Manea, Bianca Truthe: Networks of Evolutionary Processors with Subregular Filters. LATA 2011: 262-273
- [c46]Jürgen Dassow, Florin Manea, Bianca Truthe: Generating Networks of Splicing Processors. NCMA 2011: 121-136
- [c45]Jürgen Dassow, Florin Manea, Bianca Truthe: On Normal Forms for Networks of Evolutionary Processors. UC 2011: 89-100
- 2010
- [j72]Jürgen Dassow, Sherzod Turaev: Petri Net Controlled Grammars with a Bounded Number of Additional Places. Acta Cybern. 19(3): 609-634 (2010)
- [j71]Gema M. Martín, Francisco J. Vico, Jürgen Dassow, Bianca Truthe: Low Disruption Transformations on Cyclic Automata. Fundam. Inform. 104(1-2): 93-110 (2010)
- [j70]Erzsébet Csuhaj-Varjú, Jürgen Dassow, György Vaszil: Variants of Competence-Based Derivations in CD Grammar Systems. Int. J. Found. Comput. Sci. 21(4): 549-569 (2010)
- [j69]Jürgen Dassow, Ralf Stiebe, Bianca Truthe: Generative Capacity of Subregularly Tree Controlled Grammars. Int. J. Found. Comput. Sci. 21(5): 723-740 (2010)
- [j68]Henning Bordihn, Jürgen Dassow, Markus Holzer: Extending regular expressions with homomorphic replacement. RAIRO - Theor. Inf. and Applic. 44(2): 229-255 (2010)
- [j67]Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe: Editorial. Journal of Automata, Languages and Combinatorics 15(1/2): 5 (2010)
- [c44]Jürgen Dassow, Tomás Masopust: On Restricted Context-Free Grammars. Developments in Language Theory 2010: 434-435
- [c43]Jürgen Dassow, Bianca Truthe: On Networks of Evolutionary Processors with State Limited Filters. NCMA 2010: 57-70
- [c42]Jürgen Dassow, Florin Manea: Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication. DCFS 2010: 68-77
2000 – 2009
- 2009
- [j66]Artiom Alhazov, Carlos Martín-Vide, Bianca Truthe, Jürgen Dassow, Yurii Rogozhin: On Networks of Evolutionary Processors with Nodes of Two Types. Fundam. Inform. 91(1): 1-15 (2009)
- [j65]Jürgen Dassow, Gema M. Martín, Francisco J. Vico: A Similarity Measure for Cyclic Unary Regular Languages. Fundam. Inform. 96(1-2): 71-88 (2009)
- [j64]Jürgen Dassow, Andreas Malcher: Editorial. Journal of Automata, Languages and Combinatorics 14(1): 5-6 (2009)
- [j63]Jürgen Dassow, Sherzod Turaev: Petri Net Controlled Grammars: the Case of Special Petri Nets. J. UCS 15(14): 2808-2835 (2009)
- [j62]Jürgen Dassow, Gema M. Martín, Francisco J. Vico: Some operations preserving primitivity of words. Theor. Comput. Sci. 410(30-32): 2910-2919 (2009)
- [j61]Jürgen Dassow, Ralf Stiebe, Bianca Truthe: Two collapsing hierarchies of subregularly tree controlled languages. Theor. Comput. Sci. 410(35): 3261-3271 (2009)
- [j60]Jürgen Dassow, Victor Mitrana: Accepting Networks of Non-inserting Evolutionary Processors. T. Comp. Sys. Biology 11: 187-199 (2009)
- [c41]Jürgen Dassow: Conditional Grammars with Commutative, Circular and Locally Testable Conditions. Automata, Formal Languages, and Related Topics 2009: 27-37
- [c40]
- [c39]Jürgen Dassow, Gema M. Martín, Francisco J. Vico: Evolving Under Small Disruption. NCMA 2009: 91-106
- [e5]Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe (Eds.): Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems. EPTCS 3, 2009
- 2008
- [j59]Jürgen Dassow, Ralf Stiebe: Nonterminal Complexity of Some Operations on Context-Free Languages. Fundam. Inform. 83(1-2): 35-49 (2008)
- [j58]Jürgen Dassow, Henning Fernau: Comparison of some descriptional complexities of 0L systems obtained by a unifying approach. Inf. Comput. 206(9-10): 1095-1103 (2008)
- [c38]Jürgen Dassow, Bianca Truthe: Subregularly Tree Controlled Grammars and Languages. AFL 2008: 158-169
- [c37]Jürgen Dassow, Bianca Truthe: On Two Hierarchies of Subregularly Tree Controlled Languages. DCFS 2008: 145-156
- [c36]Erzsébet Csuhaj-Varjú, Jürgen Dassow, György Vaszil: Some New Modes of Competence-Based Derivations in CD Grammar Systems. Developments in Language Theory 2008: 228-239
- [c35]
- 2007
- [j57]Jürgen Dassow: On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions. Fundam. Inform. 76(3): 293-304 (2007)
- [j56]Jürgen Dassow, Bianca Truthe: On the number of components for some parallel communicating grammar systems. Theor. Comput. Sci. 387(2): 136-146 (2007)
- [c34]Jürgen Dassow, Carlos Martín-Vide, Victor Mitrana: Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors. Formal Models, Languages and Applications 2007: 65-78
- [c33]Jürgen Dassow, Ralf Stiebe: Nonterminal Complexity of Some Operations on Context-Free Languages. DCFS 2007: 162-169
- [c32]Jürgen Dassow, Henning Fernau: Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach. LATA 2007: 249-260
- [c31]Jürgen Dassow, Bianca Truthe: On the Power of Networks of Evolutionary Processors. MCU 2007: 158-169
- 2006
- [j55]Erzsébet Csuhaj-Varjú, Jürgen Dassow, Markus Holzer: CD grammar systems with competence based entry conditions in their cooperation protocols. Int. J. Comput. Math. 83(2): 159-169 (2006)
- [c30]Jürgen Dassow, György Vaszil: On the Number of Active Symbols in Lindenmayer Systems. DCFS 2006: 130-140
- [c29]Jürgen Dassow, Bianca Truthe: On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems. DCFS 2006: 241-249
- [c28]Jürgen Dassow, György Vaszil: Ciliate Bio-operations on Finite String Multisets. Developments in Language Theory 2006: 168-179
- [c27]Jürgen Dassow, György Vaszil: P Finite Automata and Regular Languages over Countably Infinite Alphabets. Workshop on Membrane Computing 2006: 367-381
- 2005
- [j54]Erzsébet Csuhaj-Varjú, Jürgen Dassow: A remark on evolutionary systems. Discrete Applied Mathematics 146(1): 111-115 (2005)
- [j53]
- [j52]Jürgen Dassow, Markus Holzer: Language families defined by a ciliate bio-operation: hierarchies and decision problems. Int. J. Found. Comput. Sci. 16(4): 645-662 (2005)
- 2004
- [j51]Jürgen Dassow: On The Descriptional Complexity Of Lindenmayer Systems. Int. J. Found. Comput. Sci. 15(4): 663-672 (2004)
- [j50]Jürgen Dassow, Victor Mitrana, Gheorghe Paun, Ralf Stiebe: On differentiation functions, structure functions, and related languages of context-free grammars. ITA 38(3): 257-267 (2004)
- [c26]Erzsébet Csuhaj-Varjú, Jürgen Dassow: On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems. Theory Is Forever 2004: 49-59
- [c25]
- [c24]Jürgen Dassow: A Ciliate Bio-operation and Language Families. Developments in Language Theory 2004: 151-162
- 2002
- [j49]Masami Ito, Jürgen Dassow, Ralf Stiebe: Some Remarks on Codes Defined by Petri Nets. J. UCS 8(2): 260-269 (2002)
- [j48]Jürgen Dassow, Victor Mitrana, Arto Salomaa: Operations and language generating devices suggested by the genome evolution. Theor. Comput. Sci. 270(1-2): 701-738 (2002)
- [c23]Jürgen Dassow, Taishin Y. Nishida, Bernd Reichel: On the Descriptional Complexity of Some Variants of Lindenmayer Systems. Developments in Language Theory 2002: 128-139
- [e4]Jürgen Dassow, Maia Hoeberechts, Helmut Jürgensen, Detlef Wotschke (Eds.): Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21 - 24, 2002. Pre-proceedings. Department of Computer Science, The University of Western Ontario, Canada 2002, ISBN 0-7714-2388-8
- 2001
- [j47]Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu: Tree-systems of morphisms. Acta Inf. 38(2): 131-153 (2001)
- [j46]Jürgen Dassow, Gheorghe Paun: P Systems with Communication Based on Concentration. Acta Cybern. 15(1): 9-23 (2001)
- [c22]Jürgen Dassow: Subregularly controlled derivations: restrictions by syntactic parameters. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 51-61
- [c21]Jürgen Dassow: Conditional Grammars with Restrictions by Syntactic Parameters. Words, Semigroups, and Transductions 2001: 59-68
- [e3]Jürgen Dassow, Detlef Wotschke (Eds.): Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20 - 22, 2001. Preproceedings. Fakultät für Informatik, Universität Magdeburg, Magdeburg, Germany 2001
- 2000
- [j45]Jürgen Dassow, Carlos Martín-Vide, Gheorghe Paun, Alfonso Rodríguez-Patón: Conditional Concatenation. Fundam. Inform. 44(4): 353-372 (2000)
- [j44]Henning Bordihn, Jürgen Dassow, György Vaszil: Parallel Communicating Grammar Systems As Language Analyzers. Grammars 3(1): 1-20 (2000)
- [j43]
- [c20]Jürgen Dassow: On the Differentiation Function of some Language Generating Devices. Words, Languages & Combinatorics 2000: 151-161
- [c19]
1990 – 1999
- 1999
- [j42]Jürgen Dassow, Gheorghe Paun: On the Regularity of Languages Generated by Context-free Evolutionary Grammars. Discrete Applied Mathematics 92(2-3): 205-209 (1999)
- [j41]Jürgen Dassow, Victor Mitrana, Gheorghe Paun: On the Regularity of Duplication Closure. Bulletin of the EATCS 69: 133-136 (1999)
- [j40]Jürgen Dassow, Henning Fernau, Gheorghe Paun: On the Leftmost Derivation in Matrix Grammars. Int. J. Found. Comput. Sci. 10(1): 61-80 (1999)
- [j39]Jürgen Dassow, Gheorghe Paun: Min of Mat is not Necessarily Mat. Inf. Process. Lett. 71(5-6): 175-177 (1999)
- [j38]Jürgen Dassow, Victor Mitrana: Stack Cooperation in Multistack Pushdown Automata. J. Comput. Syst. Sci. 58(3): 611-621 (1999)
- [j37]
- [c18]
- [c17]Henning Bordihn, Jürgen Dassow, György Vaszil: Grammar Systems as Language Analyzers and Recursively Enumerable Languages. FCT 1999: 136-147
- [c16]Henning Bordihn, Erzsébet Csuhaj-Varjú, Jürgen Dassow: CD Grammar Systems Versus L Systems. Grammatical Models of Multi-Agent Systems 1999: 18-32
- 1998
- [j36]Jürgen Dassow, Gheorghe Paun: Remarks on Operations Suggested by Mutations in Genomes. Fundam. Inform. 36(2-3): 183-200 (1998)
- [c15]Jürgen Dassow: Some Remarks on Networks of Parallel Language Processors. Rough Sets and Current Trends in Computing 1998: 83-90
- 1997
- [j35]Jürgen Dassow, Victor Mitrana: Cooperation in Context-Free Grammars. Theor. Comput. Sci. 180(1-2): 353-361 (1997)
- [c14]Jürgen Dassow, Victor Mitrana, Gheorghe Paun: Point mutations in context-free languages. Developments in Language Theory 1997: 429-446
- [c13]Jürgen Dassow: Some Remarks on Extended Reular Languages. Developments in Language Theory 1997: 477-488
- 1996
- [j34]
- [j33]Jürgen Dassow, Victor Mitrana: Splicing Grammar Systems. Computers and Artificial Intelligence 15(2-3) (1996)
- [c12]Jürgen Dassow, Victor Mitrana: Evolutionary Grammars: A Granunatical Model for Genome Evolution. German Conference on Bioinformatics 1996: 87-92
- [c11]Jürgen Dassow, Victor Mitrana: Evolutionary Grammars: A Grammatical Model for Genome Evolution. German Conference on Bioinformatics - Selected Papers 1996: 199-209
- 1995
- [j32]Jürgen Dassow, Gheorghe Paun, Sorina Vicolov: On the Generative Capacity of Certain Classes of Cooperating Grammar Systems. Fundam. Inform. 22(3): 217-226 (1995)
- [j31]Jürgen Dassow, Rudolf Freund, Gheorghe Paun: Cooperating Array Grammar Systems. IJPRAI 9(6): 1029-1053 (1995)
- 1994
- [c10]Gheorghe Paun, Jürgen Dassow, Stefan Skalla: On the Size of Components of Cooperating Grammar Systems. Results and Trends in Theoretical Computer Science 1994: 325-343
- [c9]
- [c8]Jürgen Dassow, Annegret Habel, Stefan Taubenberger: Chain-Code Pictures and Collages Generated by Hyperedge Replacement. TAGT 1994: 412-427
- 1993
- [j30]Jürgen Dassow, Friedhelm Hinz: Decision Problems and Regular Chain Code Picture Languages. Discrete Applied Mathematics 45(1): 29-49 (1993)
- [j29]Jürgen Dassow, Gheorghe Paun, Arto Salomaa: Grammars Based on Patterns. Int. J. Found. Comput. Sci. 4(1): 1-14 (1993)
- [j28]Jürgen Dassow, Gheorghe Paun, Arto Salomaa: On the Union of 0L Languages. Inf. Process. Lett. 47(2): 59-63 (1993)
- [j27]Erzsébet Csuhaj-Varjú, Jürgen Dassow, Gheorghe Paun: Dynamically controlled cooperating/distributed grammar systems. Inf. Sci. 69(1): 1-25 (1993)
- [j26]Franz-Josef Brandenburg, Jürgen Dassow: Efficient Reductions of Picture Words. ITA 27(1): 49-56 (1993)
- [j25]Jürgen Dassow, Helmut Jürgensen: Deterministic Soliton Automata with at Most One Cycle. J. Comput. Syst. Sci. 46(2): 155-197 (1993)
- [c7]Henning Bordihn, Jürgen Dassow: A Note on the Degree of Nondeterminism. Developments in Language Theory 1993: 70-80
- [c6]Jürgen Dassow, Solomon Marcus, Gheorghe Paun: Iterative Reading of Numbers: The Ordered Case. Developments in Language Theory 1993: 157-168
- 1992
- [j24]Jürgen Dassow, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure. Acta Cybern. 10(4): 243-253 (1992)
- 1991
- [j23]Jürgen Dassow, Jozef Kelemen: Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence. Bulletin of the EATCS 45: 131-145 (1991)
- [j22]Jürgen Dassow: Cooperating/distributed grammar systems with hypothesis languages. J. Exp. Theor. Artif. Intell. 3(1): 11-16 (1991)
- [j21]Jürgen Dassow: On the Connectedness of Pictures in Chain Code Picture Languages. Theor. Comput. Sci. 81(2): 289-294 (1991)
- [j20]Jürgen Dassow, Helmut Jürgensen: Deterministic Soliton Automata with a Single Exterior Node. Theor. Comput. Sci. 84(2): 281-292 (1991)
- [j19]Erzsébet Csuhaj-Varjú, Jürgen Dassow: On Bounded Interpretations of Grammar Forms. Theor. Comput. Sci. 87(2): 287-313 (1991)
- [c5]Jürgen Dassow, Klaus-Jörn Lange: Computational Calculus and Hardest Languages of Automata with Abstract Storages. FCT 1991: 200-209
- 1990
- [j18]Erzsébet Csuhaj-Varjú, Jürgen Dassow: On Cooperating/Distributed Grammar Systems. Elektronische Informationsverarbeitung und Kybernetik 26(1/2): 49-63 (1990)
- [j17]
- [e2]Jürgen Dassow, Jozef Kelemen (Eds.): Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19-23, 1990, Proceedings. Lecture Notes in Computer Science 464, Springer 1990, ISBN 3-540-53414-8
1980 – 1989
- 1989
- [j16]Friedhelm Hinz, Jürgen Dassow: A undecidability result for regular anguages and its applications to regulated rewriting. Bulletin of the EATCS 38: 168-173 (1989)
- [j15]Jürgen Dassow: Graph-theoretical Properties and Chain Code Picture Languages. Elektronische Informationsverarbeitung und Kybernetik 25(8/9): 423-433 (1989)
- [c4]Jürgen Dassow, Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová: On the Power of Synchronization in Parallel Computations. MFCS 1989: 196-206
- [e1]Jürgen Dassow, Jozef Kelemen (Eds.): Machines, Languages, and Complexity, 5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 14-18, 1988, Proceedings. Lecture Notes in Computer Science 381, Springer 1989, ISBN 3-540-51516-X
- 1988
- [j14]Jürgen Dassow: Pure languages of regulated rewriting and their codings. Acta Cybern. 8(3): 227-235 (1988)
- [j13]Jürgen Dassow: A Remark on Limited OL Systems. Elektronische Informationsverarbeitung und Kybernetik 24(6): 287-291 (1988)
- 1987
- [c3]
- 1985
- [j12]Jürgen Dassow, Gheorghe Paun: On Ordered Variants of Some Regulated Grammars. Elektronische Informationsverarbeitung und Kybernetik 21(10/11): 491-504 (1985)
- 1984
- [j11]Jürgen Dassow: On some extensions of Russian parallel context free grammars. Acta Cybern. 6(4): 355-360 (1984)
- [j10]
- 1983
- [j9]
- 1982
- [j8]Jürgen Dassow: Remark on a Problem of Nguyen Xuan My and Paun. Elektronische Informationsverarbeitung und Kybernetik 18(1/2): 67-68 (1982)
- [j7]Gheorghe Paun, Jürgen Dassow: L(ETOL[5]) = L(ETOL). Elektronische Informationsverarbeitung und Kybernetik 18(6): 345-348 (1982)
- 1981
- [c2]
- 1980
- [j6]Jürgen Dassow: On some extensions of Indian parallel context free grammars. Acta Cybern. 4(4): 303-310 (1980)
1970 – 1979
- 1979
- [j5]Jürgen Dassow: On the Circular Closure of Languages. Elektronische Informationsverarbeitung und Kybernetik 15(1/2): 87-94 (1979)
- 1977
- [c1]
- 1976
- [j4]Jürgen Dassow: Eine neue Funktion für Lindenmayer-Systeme. Elektronische Informationsverarbeitung und Kybernetik 12(11/12): 515-521 (1976)
- 1975
- [j3]Jürgen Dassow: Über metrische Kleene-Vollständigkeit. Elektronische Informationsverarbeitung und Kybernetik 11(9): 557-560 (1975)
- 1974
- [j2]Jürgen Dassow: Kleene-Mengen und Kleene-Vollständigkeit. Elektronische Informationsverarbeitung und Kybernetik 10(5/6): 287-295 (1974)
- [j1]Jürgen Dassow: Kleene-Vollständigkeit bei stark-definiten Ereignissen. Elektronische Informationsverarbeitung und Kybernetik 10(7): 399-405 (1974)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:01 CEST by the dblp team