default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJürgen Dassow
Person information
- affiliation: Otto von Guericke University of Magdeburg, Germany
SPARQL queries 
🛈 Please note that only 70% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j127]Jürgen Dassow:
Remarks on context-free grammars with subregular control languages. Theor. Comput. Sci. 1010: 114704 (2024)- 2023
- [j126]Jürgen Dassow, Martin Kutrib, Giovanni Pighizzini:
25 Editions of DCFS: Origins and Directions. Bull. EATCS 141 (2023) - [j125]Jürgen Dassow, Bianca Truthe
:
Relations of contextual grammars with strictly locally testable selection languages. RAIRO Theor. Informatics Appl. 57: 10 (2023) - [j124]Jürgen Dassow:
Pareto Grammars. J. Autom. Lang. Comb. 28(4): 279-286 (2023) - 2022
- [j123]Jürgen Dassow, Ismaël Jecker:
Operational complexity and pumping lemmas. Acta Informatica 59(4): 337-355 (2022) - [c58]Jürgen Dassow, Bianca Truthe:
On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages. NCMA 2022: 65-80 - 2021
- [j122]Jürgen Dassow:
Operational complexity and right linear grammars. Acta Informatica 58(4): 281-299 (2021) - [j121]Jürgen Dassow:
Some remarks on the orbit of closure-involution operations on languages. Inf. Comput. 281: 104811 (2021) - [j120]Jürgen Dassow:
Further Remarks on the Operational Nonterminal Complexity. Int. J. Found. Comput. Sci. 32(5): 439-453 (2021) - [j119]Jürgen Dassow, Bianca Truthe:
Accepting networks of evolutionary processors with resources restricted and structure limited filters. RAIRO Theor. Informatics Appl. 55: 1-27 (2021) - [j118]Jürgen Dassow:
Remarks on external contextual grammars with selection. Theor. Comput. Sci. 862: 119-129 (2021) - 2020
- [j117]Jürgen Dassow, Bianca Truthe:
Networks with Evolutionary Processors and Ideals and Codes as Filters. Int. J. Found. Comput. Sci. 31(1): 73-89 (2020) - [j116]Jürgen Dassow:
Lindenmayer Systems with Control by Ideals and Codes. J. Autom. Lang. Comb. 25(1): 3-20 (2020) - [j115]Jürgen Dassow, Bianca Truthe:
Generating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters. J. Autom. Lang. Comb. 25(2-3): 83-113 (2020)
2010 – 2019
- 2019
- [j114]Jürgen Dassow:
Operational Accepting State Complexity: The Unary and Finite Case. Int. J. Found. Comput. Sci. 30(6-7): 959-978 (2019) - [j113]Jürgen Dassow:
On the orbit of closure-involution operations - The case of formal languages. Theor. Comput. Sci. 777: 192-203 (2019) - 2018
- [j112]Jürgen Dassow:
Grammars with Control by Ideals and Codes. J. Autom. Lang. Comb. 23(1-3): 143-164 (2018) - 2017
- [c57]Jürgen Dassow:
Descriptional Complexity and Operations - Two Non-classical Cases. DCFS 2017: 33-44 - 2016
- [j111]Jürgen Dassow:
Editorial. J. Autom. Lang. Comb. 20(1): 3-4 (2016) - [j110]Jürgen Dassow:
On the Number of Accepting States of Finite Automata. J. Autom. Lang. Comb. 21(1-2): 55-67 (2016) - 2015
- [j109]Jürgen Dassow, Stefan Rudolf:
Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case. Acta Cybern. 22(2): 313-334 (2015) - [j108]Jürgen Dassow, Florin Manea, Bianca Truthe:
On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters. Fundam. Informaticae 136(1-2): 1-35 (2015) - 2014
- [j107]Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller:
Inner Palindromic Closure. Int. J. Found. Comput. Sci. 25(8): 1049-1064 (2014) - [j106]Jürgen Dassow, Florin Manea, Robert Mercas:
Regular languages of partial words. Inf. Sci. 268: 290-304 (2014) - [j105]Jürgen Dassow, Stefan Rudolf:
Conditional Lindenmayer systems with subregular conditions: The non-extended case. RAIRO Theor. Informatics Appl. 48(1): 127-147 (2014) - [j104]Jürgen Dassow, Jozef Kelemen, Gheorghe Paun:
Editorial. J. Autom. Lang. Comb. 19(1-4): 3-4 (2014) - [c56]Jürgen Dassow:
Restarting Automata with Subregular Constraints. Discrete Mathematics and Computer Science 2014: 103-117 - [c55]Jürgen Dassow:
Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources. Computing with New Resources 2014: 292-306 - 2013
- [j103]Fernando Arroyo, Juan Castellanos, Jürgen Dassow, Victor Mitrana, José-Ramón Sánchez-Couso:
Accepting splicing systems with permitting and forbidding words. Acta Informatica 50(1): 1-14 (2013) - [j102]Jürgen Dassow, Florin Manea, Bianca Truthe:
Networks of evolutionary processors: the power of subregular filters. Acta Informatica 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
- [j101]Jürgen Dassow, Florin Manea, Bianca Truthe:
Generating Networks of Splicing Processors. RAIRO Theor. Informatics Appl. 46(4): 547-572 (2012) - [j100]Jürgen Dassow, Martin Kutrib, Nelma Moreira, Rogério Reis:
Editorial. J. Autom. Lang. Comb. 17(2-4): 59-60 (2012) - [j99]Jürgen Dassow, Ronny Harbich:
Descriptional Complexity of Union and Star on Context-Free Languages. J. Autom. Lang. Comb. 17(2-4): 123-143 (2012) - [j98]Jürgen Dassow, Florin Manea, Bianca Truthe:
On Subregular Selection Languages in Internal Contextual Grammars. J. Autom. Lang. Comb. 17(2-4): 145-164 (2012) - [j97]Jürgen Dassow, Tomás Masopust:
On restricted context-free grammars. J. Comput. Syst. Sci. 78(1): 293-304 (2012) - [j96]Jürgen Dassow, Florin Manea, Bianca Truthe:
Networks of evolutionary processors: computationally complete normal forms. Nat. Comput. 11(4): 595-607 (2012) - [j95]Jürgen Dassow, Florin Manea, Bianca Truthe:
On external contextual grammars with subregular selection languages. Theor. Comput. Sci. 449: 64-73 (2012) - [j94]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]Jürgen Dassow:
Subregular Restrictions for Some Language Generating Devices. NCMA 2012: 11-26 - [c50]Jürgen Dassow, Bianca Truthe:
Extended Splicing Systems with Subregular Sets of Splicing Rules. NCMA 2012: 65-78 - 2011
- [j93]Jürgen Dassow, Bianca Truthe:
On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata. Fundam. Informaticae 112(2-3): 157-170 (2011) - [j92]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) - [j91]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) - [j90]Henning Bordihn, Jürgen Dassow, Martin Kutrib, Bianca Truthe:
Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial. J. Autom. Lang. Comb. 16(2-4): 71-74 (2011) - [j89]Sherzod Turaev, Jürgen Dassow, Mohd Hasan Selamat:
Nonterminal complexity of tree controlled grammars. Theor. Comput. Sci. 412(41): 5789-5795 (2011) - [j88]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
- [j87]Jürgen Dassow, Sherzod Turaev:
Petri Net Controlled Grammars with a Bounded Number of Additional Places. Acta Cybern. 19(3): 609-634 (2010) - [j86]Gema M. Martín, Francisco J. Vico, Jürgen Dassow, Bianca Truthe:
Low Disruption Transformations on Cyclic Automata. Fundam. Informaticae 104(1-2): 93-110 (2010) - [j85]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) - [j84]Jürgen Dassow, Ralf Stiebe, Bianca Truthe:
Generative Capacity of Subregularly Tree Controlled Grammars. Int. J. Found. Comput. Sci. 21(5): 723-740 (2010) - [j83]Henning Bordihn, Jürgen Dassow, Markus Holzer:
Extending regular expressions with homomorphic replacement. RAIRO Theor. Informatics Appl. 44(2): 229-255 (2010) - [j82]Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe:
Editorial. J. Autom. Lang. Comb. 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
- [j81]Artiom Alhazov, Carlos Martín-Vide, Bianca Truthe, Jürgen Dassow, Yurii Rogozhin:
On Networks of Evolutionary Processors with Nodes of Two Types. Fundam. Informaticae 91(1): 1-15 (2009) - [j80]Jürgen Dassow, Gema M. Martín, Francisco J. Vico:
A Similarity Measure for Cyclic Unary Regular Languages. Fundam. Informaticae 96(1-2): 71-88 (2009) - [j79]Jürgen Dassow, Andreas Malcher:
Editorial. J. Autom. Lang. Comb. 14(1): 5-6 (2009) - [j78]Jürgen Dassow, Sherzod Turaev:
Petri Net Controlled Grammars: the Case of Special Petri Nets. J. Univers. Comput. Sci. 15(14): 2808-2835 (2009) - [j77]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) - [j76]Jürgen Dassow, Ralf Stiebe, Bianca Truthe:
Two collapsing hierarchies of subregularly tree controlled languages. Theor. Comput. Sci. 410(35): 3261-3271 (2009) - [j75]Jürgen Dassow, Victor Mitrana:
Accepting Networks of Non-inserting Evolutionary Processors. Trans. 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]Jürgen Dassow, Sherzod Turaev:
Grammars Controlled by Special Petri Nets. LATA 2009: 326-337 - [c39]Jürgen Dassow, Gema M. Martín, Francisco J. Vico:
Evolving Under Small Disruption. NCMA 2009: 91-106 - [e7]Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe:
Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, Magdeburg, Germany, July 6-9, 2009. EPTCS 3, 2009 [contents] - 2008
- [j74]Jürgen Dassow, Ralf Stiebe:
Nonterminal Complexity of Some Operations on Context-Free Languages. Fundam. Informaticae 83(1-2): 35-49 (2008) - [j73]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]Jürgen Dassow, Sherzod Turaev:
k-Petri Net Controlled Grammars. LATA 2008: 209-220 - 2007
- [j72]Jürgen Dassow:
On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions. Fundam. Informaticae 76(3): 293-304 (2007) - [j71]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
- [j70]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
- [j69]Erzsébet Csuhaj-Varjú, Jürgen Dassow:
A remark on evolutionary systems. Discret. Appl. Math. 146(1): 111-115 (2005) - [j68]Jürgen Dassow:
Contextual Grammars with Subregular Choice. Fundam. Informaticae 64(1-4): 109-118 (2005) - [j67]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
- [j66]Jürgen Dassow:
On The Descriptional Complexity Of Lindenmayer Systems. Int. J. Found. Comput. Sci. 15(4): 663-672 (2004) - [j65]Jürgen Dassow, Victor Mitrana, Gheorghe Paun, Ralf Stiebe:
On differentiation functions, structure functions, and related languages of context-free grammars. RAIRO Theor. Informatics Appl. 38(3): 257-267 (2004) - [j64]Jürgen Dassow, Helmut Jürgensen, Detlef Wotschke:
Editorial. J. Autom. Lang. Comb. 9(2/3): 173 (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]Jürgen Dassow:
On the Descriptional Complexity of Lindenmayer Systems. DCFS 2004: 28-36 - [c24]Jürgen Dassow:
A Ciliate Bio-operation and Language Families. Developments in Language Theory 2004: 151-162 - 2003
- [j63]Jürgen Dassow:
Editorial. J. Autom. Lang. Comb. 8(1): 3-4 (2003) - 2002
- [j62]Jürgen Dassow, Detlef Wotschke, Bernd Reichel:
Editorial. J. Autom. Lang. Comb. 7(4): 417 (2002) - [j61]Masami Ito, Jürgen Dassow, Ralf Stiebe:
Some Remarks on Codes Defined by Petri Nets. J. Univers. Comput. Sci. 8(2): 260-269 (2002) - [j60]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 - [e6]Jürgen Dassow, Maia Hoeberechts, Helmut Jürgensen, Detlef Wotschke:
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 [contents] - 2001
- [j59]Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu:
Tree-systems of morphisms. Acta Informatica 38(2): 131-153 (2001) - [j58]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 - [e5]Jürgen Dassow, Detlef Wotschke:
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 [contents] - 2000
- [j57]Jürgen Dassow, Carlos Martín-Vide, Gheorghe Paun, Alfonso Rodríguez-Patón:
Conditional Concatenation. Fundam. Informaticae 44(4): 353-372 (2000) - [j56]Henning Bordihn, Jürgen Dassow, György Vaszil:
Parallel Communicating Grammar Systems As Language Analyzers. Grammars 3(1): 1-20 (2000) - [j55]Jürgen Dassow, Victor Mitrana:
Finite Automata over Free Groups. Int. J. Algebra Comput. 10(6): 725-738 (2000) - [j54]Jürgen Dassow, Detlef Wotschke:
Editorial. J. Autom. Lang. Comb. 5(3): 173 (2000) - [c20]Jürgen Dassow:
On the Differentiation Function of some Language Generating Devices. Words, Languages & Combinatorics 2000: 151-161 - [c19]Jürgen Dassow:
Parikh Mapping and Iteration. WMP 2000: 85-102
1990 – 1999
- 1999
- [j53]Jürgen Dassow, Gheorghe Paun:
On the Regularity of Languages Generated by Context-free Evolutionary Grammars. Discret. Appl. Math. 92(2-3): 205-209 (1999) - [j52]Jürgen Dassow, Victor Mitrana, Gheorghe Paun:
On the Regularity of Duplication Closure. Bull. EATCS 69: 133-136 (1999) - [j51]Jürgen Dassow, Henning Fernau, Gheorghe Paun:
On the Leftmost Derivation in Matrix Grammars. Int. J. Found. Comput. Sci. 10(1): 61-80 (1999) - [j50]Jürgen Dassow, Gheorghe Paun:
Min of Mat is not Necessarily Mat. Inf. Process. Lett. 71(5-6): 175-177 (1999) - [j49]Jürgen Dassow, Victor Mitrana:
Stack Cooperation in Multistack Pushdown Automata. J. Comput. Syst. Sci. 58(3): 611-621 (1999) - [j48]Jürgen Dassow, Gheorghe Paun:
On the Power of Membrane Computing. J. Univers. Comput. Sci. 5(2): 33-49 (1999) - [c18]Jürgen Dassow:
Numerical Parameters of Evolutionary Grammars. Jewels are Forever 1999: 171-181 - [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
- [j47]Jürgen Dassow, Gheorghe Paun:
Remarks on Operations Suggested by Mutations in Genomes. Fundam. Informaticae 36(2-3): 183-200 (1998) - [j46]Jürgen Dassow, Solomon Marcus, Gheorghe Paun:
Convex and anti-convex languages. Int. J. Comput. Math. 69(1-2): 1-16 (1998) - [c15]Jürgen Dassow:
Some Remarks on Networks of Parallel Language Processors. Rough Sets and Current Trends in Computing 1998: 83-90 - [e4]Jürgen Dassow, Rudolf Kruse:
Informatik '98 - Informatik zwischen Bild und Sprache, 28. Jahrestagung der Gesellschaft für Informatik, Magdeburg, 21.-25. September 1998. Informatik Aktuell, Springer 1998, ISBN 3-540-64938-7 [contents] - 1997
- [j45]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 - [p2]Jürgen Dassow, Gheorghe Paun, Arto Salomaa:
Grammars with Controlled Derivations. Handbook of Formal Languages (2) 1997: 101-154 - [p1]Jürgen Dassow, Gheorghe Paun, Grzegorz Rozenberg:
Grammar Systems. Handbook of Formal Languages (2) 1997: 155-213 - 1996
- [j44]Jürgen Dassow, Victor Mitrana:
Fairness in Grammar Systems. Acta Cybern. 12(4): 331-345 (1996) - [j43]Jürgen Dassow, Victor Mitrana:
Splicing Grammar Systems. Comput. Artif. Intell. 15(2-3): 109-122 (1996) - [j42]Jürgen Dassow:
Editorial. J. Autom. Lang. Comb. 1(1): 3 (1996) - [j41]Jürgen Dassow:
Editorial. J. Autom. Lang. Comb. 1(2): 79 (1996) - [j40]Jürgen Dassow:
Editorial. J. Autom. Lang. Comb. 1(4): 241 (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 - [e3]Jürgen Dassow, Grzegorz Rozenberg, Arto Salomaa:
Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17-21 July 1995. World Scientific, Singapore 1996 [contents] - 1995
- [j39]Jürgen Dassow, Gheorghe Paun, Sorina Vicolov:
On the Generative Capacity of Certain Classes of Cooperating Grammar Systems. Fundam. Informaticae 22(3): 217-226 (1995) - [j38]Jürgen Dassow, Rudolf Freund, Gheorghe Paun:
Cooperating Array Grammar Systems. Int. J. Pattern Recognit. Artif. Intell. 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]Jürgen Dassow:
Decision Problems for Edge Grammars. MFCS 1994: 286-295 - [c8]Jürgen Dassow, Annegret Habel, Stefan Taubenberger:
Chain-Code Pictures and Collages Generated by Hyperedge Replacement. TAGT 1994: 412-427 - 1993
- [j37]Jürgen Dassow, Friedhelm Hinz:
Decision Problems and Regular Chain Code Picture Languages. Discret. Appl. Math. 45(1): 29-49 (1993) - [j36]Jürgen Dassow, Gheorghe Paun, Arto Salomaa:
Grammars Based on Patterns. Int. J. Found. Comput. Sci. 4(1): 1-14 (1993) - [j35]Jürgen Dassow, Gheorghe Paun, Arto Salomaa:
On the Union of 0L Languages. Inf. Process. Lett. 47(2): 59-63 (1993) - [j34]Erzsébet Csuhaj-Varjú, Jürgen Dassow, Gheorghe Paun:
Dynamically controlled cooperating/distributed grammar systems. Inf. Sci. 69(1): 1-25 (1993) - [j33]Franz-Josef Brandenburg, Jürgen Dassow:
Efficient Reductions of Picture Words. RAIRO Theor. Informatics Appl. 27(1): 49-56 (1993) - [j32]Jürgen Dassow, Helmut Jürgensen:
Deterministic Soliton Automata with at Most One Cycle. J. Comput. Syst. Sci. 46(2): 155-197 (1993) - [j31]Mircea Andrasiu, Gheorghe Paun, Jürgen Dassow, Arto Salomaa:
Language-theoretic problems arising from Richelieu cryptosystems. Theor. Comput. Sci. 116(2): 339-357 (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
- [j30]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) - [j29]Erzsébet Csuhaj-Varjú, Jürgen Dassow, Jozef Kelemen:
On cooperating/distributed grammar systems with different styles of acceptance. Int. J. Comput. Math. 42(3-4): 173-183 (1992) - 1991
- [j28]Jürgen Dassow, Jozef Kelemen:
Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence. Bull. EATCS 45: 131-145 (1991) - [j27]Jürgen Dassow:
Cooperating/distributed grammar systems with hypothesis languages. J. Exp. Theor. Artif. Intell. 3(1): 11-16 (1991) - [j26]Jürgen Dassow:
On the Connectedness of Pictures in Chain Code Picture Languages. Theor. Comput. Sci. 81(2): 289-294 (1991) - [j25]Jürgen Dassow, Helmut Jürgensen:
Deterministic Soliton Automata with a Single Exterior Node. Theor. Comput. Sci. 84(2): 281-292 (1991) - [j24]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
- [j23]Erzsébet Csuhaj-Varjú, Jürgen Dassow:
On Cooperating/Distributed Grammar Systems. J. Inf. Process. Cybern. 26(1/2): 49-63 (1990) - [j22]Jürgen Dassow, Dietmar Wätjen:
On the relations between the degree of synchronization and the degree of nondeterminism in k-limited and uniformly k-limited tol systems. Int. J. Comput. Math. 35(1-4): 69-82 (1990) - [j21]Jürgen Dassow, Gheorghe Paun:
On the degree of non-regularity of context-free languages. Int. J. Comput. Math. 36(1-2): 13-29 (1990) - [j20]Jürgen Dassow, Helmut Jürgensen, Wolfgang Rülling:
Information transmission in il systems. Int. J. Comput. Math. 37(1-2): 1-19 (1990) - [j19]Jürgen Dassow, Helmut Jürgensen:
Soliton Automata. J. Comput. Syst. Sci. 40(2): 154-181 (1990) - [e2]Jürgen Dassow, Jozef Kelemen:
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 [contents]
1980 – 1989
- 1989
- [b1]Jürgen Dassow, Gheorghe Paun:
Regulated Rewriting in Formal Language Theory. Springer 1989, ISBN 978-3-642-74934-6 - [j18]Friedhelm Hinz, Jürgen Dassow:
A undecidability result for regular anguages and its applications to regulated rewriting. Bull. EATCS 38: 168-173 (1989) - [j17]Jürgen Dassow:
Graph-theoretical Properties and Chain Code Picture Languages. J. Inf. Process. Cybern. 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:
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 [contents] - 1988
- [j16]Jürgen Dassow:
Pure languages of regulated rewriting and their codings. Acta Cybern. 8(3): 227-235 (1988) - [j15]Jürgen Dassow:
A Remark on Limited OL Systems. J. Inf. Process. Cybern. 24(6): 287-291 (1988) - 1987
- [c3]Jürgen Dassow, Helmut Jürgensen:
Soliton Automata. FCT 1987: 95-102 - 1985
- [j14]Jürgen Dassow, Gheorghe Paun:
On Ordered Variants of Some Regulated Grammars. J. Inf. Process. Cybern. 21(10/11): 491-504 (1985) - [j13]Jürgen Dassow, Gheorghe Paun:
Further remarks on the complexity of regulated rewriting. Kybernetika 21(3): 213-227 (1985) - 1984
- [j12]Jürgen Dassow:
On some extensions of Russian parallel context free grammars. Acta Cybern. 6(4): 355-360 (1984) - [j11]Jürgen Dassow:
A note on DTOL Systems. Bull. EATCS 22: 11-13 (1984) - 1983
- [j10]Jürgen Dassow:
A note on programmed 0L systems. Inf. Sci. 30(1): 1-4 (1983) - 1982
- [j9]Jürgen Dassow:
Grammars with valuations - a discrete model for self-organization of biopolymers. Discret. Appl. Math. 4(3): 161-174 (1982) - [j8]Jürgen Dassow:
Remark on a Problem of Nguyen Xuan My and Paun. J. Inf. Process. Cybern. 18(1/2): 67-68 (1982) - [j7]Gheorghe Paun, Jürgen Dassow:
L(ETOL[5]) = L(ETOL). J. Inf. Process. Cybern. 18(6): 345-348 (1982) - 1981
- [c2]Jürgen Dassow:
Equality Languages and Language Families. FCT 1981: 100-109 - 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. J. Inf. Process. Cybern. 15(1/2): 87-94 (1979) - 1977
- [c1]Jürgen Dassow:
Some Remarks on the Algebra of Automation Mapping. FCT 1977: 78-83 - 1976
- [j4]Jürgen Dassow:
Eine neue Funktion für Lindenmayer-Systeme. J. Inf. Process. Cybern. 12(11/12): 515-521 (1976) - 1975
- [j3]Jürgen Dassow:
Über metrische Kleene-Vollständigkeit. J. Inf. Process. Cybern. 11(9): 557-560 (1975) - 1974
- [j2]Jürgen Dassow:
Kleene-Mengen und Kleene-Vollständigkeit. J. Inf. Process. Cybern. 10(5/6): 287-295 (1974) - [j1]Jürgen Dassow:
Kleene-Vollständigkeit bei stark-definiten Ereignissen. J. Inf. Process. Cybern. 10(7): 399-405 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
