Kleene-Mengen und Kleene-Vollständigkeit. - Jürgen Dassow (J. Inf. Process. Cybern., 1974)

Kleene-Vollständigkeit bei stark-definiten Ereignissen. - Jürgen Dassow (J. Inf. Process. Cybern., 1974)

Über metrische Kleene-Vollständigkeit. - Jürgen Dassow (J. Inf. Process. Cybern., 1975)

Eine neue Funktion für Lindenmayer-Systeme. - Jürgen Dassow (J. Inf. Process. Cybern., 1976)

Some Remarks on the Algebra of Automation Mapping. - Jürgen Dassow (FCT, 1977)

On the Circular Closure of Languages. - Jürgen Dassow (J. Inf. Process. Cybern., 1979)

On some extensions of Indian parallel context free grammars. - Jürgen Dassow (Acta Cybern., 1980)

Equality Languages and Language Families. - Jürgen Dassow (FCT, 1981)

Grammars with valuations - a discrete model for self-organization of biopolymers. - Jürgen Dassow (Discret. Appl. Math., 1982)

Remark on a Problem of Nguyen Xuan My and Paun. - Jürgen Dassow (J. Inf. Process. Cybern., 1982)

L(ETOL[5]) = L(ETOL). - Gheorghe Paun; Jürgen Dassow (J. Inf. Process. Cybern., 1982)

A note on programmed 0L systems. - Jürgen Dassow (Inf. Sci., 1983)

On some extensions of Russian parallel context free grammars. - Jürgen Dassow (Acta Cybern., 1984)

A note on DTOL Systems. - Jürgen Dassow (Bull. EATCS, 1984)

On Ordered Variants of Some Regulated Grammars. - Jürgen Dassow; Gheorghe Paun (J. Inf. Process. Cybern., 1985)

Further remarks on the complexity of regulated rewriting. - Jürgen Dassow; Gheorghe Paun (Kybernetika, 1985)

Pure languages of regulated rewriting and their codings. - Jürgen Dassow (Acta Cybern., 1988)

A Remark on Limited OL Systems. - Jürgen Dassow (J. Inf. Process. Cybern., 1988)

Regulated Rewriting in Formal Language Theory. - Jürgen Dassow; Gheorghe Paun (Springer, 1989)

On the Power of Synchronization in Parallel Computations. - Jürgen Dassow; Juraj Hromkovic; Juhani Karhumäki; Branislav Rovan; Anna Slobodová (MFCS, 1989)

A undecidability result for regular anguages and its applications to regulated rewriting. - Friedhelm Hinz; Jürgen Dassow (Bull. EATCS, 1989)

Graph-theoretical Properties and Chain Code Picture Languages. - Jürgen Dassow (J. Inf. Process. Cybern., 1989)

On Cooperating/Distributed Grammar Systems. - Erzsébet Csuhaj-Varjú; Jürgen Dassow (J. Inf. Process. Cybern., 1990)

Information transmission in il systems. - Jürgen Dassow; Helmut Jürgensen; Wolfgang Rülling (Int. J. Comput. Math., 1990)

On the degree of non-regularity of context-free languages. - Jürgen Dassow; Gheorghe Paun (Int. J. Comput. Math., 1990)

On the relations between the degree of synchronization and the degree of nondeterminism in k-limited and uniformly k-limited tol systems. - Jürgen Dassow; Dietmar Wätjen (Int. J. Comput. Math., 1990)

Soliton Automata. - Jürgen Dassow; Helmut Jürgensen (J. Comput. Syst. Sci., 1990)

Computational Calculus and Hardest Languages of Automata with Abstract Storages. - Jürgen Dassow; Klaus-Jörn Lange (FCT, 1991)

Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence. - Jürgen Dassow; Jozef Kelemen (Bull. EATCS, 1991)

Cooperating/distributed grammar systems with hypothesis languages. - Jürgen Dassow (J. Exp. Theor. Artif. Intell., 1991)

On Bounded Interpretations of Grammar Forms. - Erzsébet Csuhaj-Varjú; Jürgen Dassow (Theor. Comput. Sci., 1991)

On the Connectedness of Pictures in Chain Code Picture Languages. - Jürgen Dassow (Theor. Comput. Sci., 1991)

Deterministic Soliton Automata with a Single Exterior Node. - Jürgen Dassow; Helmut Jürgensen (Theor. Comput. Sci., 1991)

Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure. - Jürgen Dassow; Alexandru Mateescu; Gheorghe Paun; Arto Salomaa (Acta Cybern., 1992)

On cooperating/distributed grammar systems with different styles of acceptance. - Erzsébet Csuhaj-Varjú; Jürgen Dassow; Jozef Kelemen (Int. J. Comput. Math., 1992)

A Note on the Degree of Nondeterminism. - Henning Bordihn; Jürgen Dassow (Developments in Language Theory, 1993)

Iterative Reading of Numbers: The Ordered Case. - Jürgen Dassow; Solomon Marcus; Gheorghe Paun (Developments in Language Theory, 1993)

Decision Problems and Regular Chain Code Picture Languages. - Jürgen Dassow; Friedhelm Hinz (Discret. Appl. Math., 1993)

Grammars Based on Patterns. - Jürgen Dassow; Gheorghe Paun; Arto Salomaa (Int. J. Found. Comput. Sci., 1993)

On the Union of 0L Languages. - Jürgen Dassow; Gheorghe Paun; Arto Salomaa (Inf. Process. Lett., 1993)

Dynamically controlled cooperating/distributed grammar systems. - Erzsébet Csuhaj-Varjú; Jürgen Dassow; Gheorghe Paun (Inf. Sci., 1993)

Efficient Reductions of Picture Words. - Franz-Josef Brandenburg; Jürgen Dassow (RAIRO Theor. Informatics Appl., 1993)

Deterministic Soliton Automata with at Most One Cycle. - Jürgen Dassow; Helmut Jürgensen (J. Comput. Syst. Sci., 1993)

Language-theoretic problems arising from Richelieu cryptosystems. - Mircea Andrasiu; Gheorghe Paun; Jürgen Dassow; Arto Salomaa (Theor. Comput. Sci., 1993)

On the Size of Components of Cooperating Grammar Systems. - Gheorghe Paun; Jürgen Dassow; Stefan Skalla (Results and Trends in Theoretical Computer Science, 1994)

Decision Problems for Edge Grammars. - Jürgen Dassow (MFCS, 1994)

Chain-Code Pictures and Collages Generated by Hyperedge Replacement. - Jürgen Dassow; Annegret Habel; Stefan Taubenberger (TAGT, 1994)

On the Generative Capacity of Certain Classes of Cooperating Grammar Systems. - Jürgen Dassow; Gheorghe Paun; Sorina Vicolov (Fundam. Informaticae, 1995)

Cooperating Array Grammar Systems. - Jürgen Dassow; Rudolf Freund; Gheorghe Paun (Int. J. Pattern Recognit. Artif. Intell., 1995)

Evolutionary Grammars: A Grammatical Model for Genome Evolution. - Jürgen Dassow; Victor Mitrana (German Conference on Bioinformatics - Selected Papers, 1996)

Evolutionary Grammars: A Granunatical Model for Genome Evolution. - Jürgen Dassow; Victor Mitrana (German Conference on Bioinformatics, 1996)

Fairness in Grammar Systems. - Jürgen Dassow; Victor Mitrana (Acta Cybern., 1996)

Splicing Grammar Systems. - Jürgen Dassow; Victor Mitrana (Comput. Artif. Intell., 1996)

Some Remarks on Extended Reular Languages. - Jürgen Dassow (Developments in Language Theory, 1997)

Point mutations in context-free languages. - Jürgen Dassow; Victor Mitrana; Gheorghe Paun (Developments in Language Theory, 1997)

Cooperation in Context-Free Grammars. - Jürgen Dassow; Victor Mitrana (Theor. Comput. Sci., 1997)

Grammar Systems. - Jürgen Dassow; Gheorghe Paun; Grzegorz Rozenberg (Handbook of Formal Languages (2), 1997)

Grammars with Controlled Derivations. - Jürgen Dassow; Gheorghe Paun; Arto Salomaa (Handbook of Formal Languages (2), 1997)

Some Remarks on Networks of Parallel Language Processors. - Jürgen Dassow (Rough Sets and Current Trends in Computing, 1998)

Remarks on Operations Suggested by Mutations in Genomes. - Jürgen Dassow; Gheorghe Paun (Fundam. Informaticae, 1998)

Convex and anti-convex languages. - Jürgen Dassow; Solomon Marcus; Gheorghe Paun (Int. J. Comput. Math., 1998)

Numerical Parameters of Evolutionary Grammars. - Jürgen Dassow (Jewels are Forever, 1999)

Grammar Systems as Language Analyzers and Recursively Enumerable Languages. - Henning Bordihn; Jürgen Dassow; György Vaszil (FCT, 1999)

CD Grammar Systems Versus L Systems. - Henning Bordihn; Erzsébet Csuhaj-Varjú; Jürgen Dassow (Grammatical Models of Multi-Agent Systems, 1999)

On the Regularity of Languages Generated by Context-free Evolutionary Grammars. - Jürgen Dassow; Gheorghe Paun (Discret. Appl. Math., 1999)

On the Regularity of Duplication Closure. - Jürgen Dassow; Victor Mitrana; Gheorghe Paun (Bull. EATCS, 1999)

On the Leftmost Derivation in Matrix Grammars. - Jürgen Dassow; Henning Fernau; Gheorghe Paun (Int. J. Found. Comput. Sci., 1999)

Min of Mat is not Necessarily Mat. - Jürgen Dassow; Gheorghe Paun (Inf. Process. Lett., 1999)

Stack Cooperation in Multistack Pushdown Automata. - Jürgen Dassow; Victor Mitrana (J. Comput. Syst. Sci., 1999)

On the Power of Membrane Computing. - Jürgen Dassow; Gheorghe Paun (J. Univers. Comput. Sci., 1999)

On the Differentiation Function of some Language Generating Devices. - Jürgen Dassow (Words, Languages & Combinatorics, 2000)

Parikh Mapping and Iteration. - Jürgen Dassow (WMP, 2000)

Conditional Concatenation. - Jürgen Dassow; Carlos Martín-Vide; Gheorghe Paun; Alfonso Rodríguez-Patón (Fundam. Informaticae, 2000)

Parallel Communicating Grammar Systems As Language Analyzers. - Henning Bordihn; Jürgen Dassow; György Vaszil (Grammars, 2000)

Finite Automata over Free Groups. - Jürgen Dassow; Victor Mitrana (Int. J. Algebra Comput., 2000)

Editorial. - Jürgen Dassow; Detlef Wotschke (J. Autom. Lang. Comb., 2000)

Conditional Grammars with Restrictions by Syntactic Parameters. - Jürgen Dassow (Words, Semigroups, and Transductions, 2001)

Subregularly controlled derivations: restrictions by syntactic parameters. - Jürgen Dassow (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Tree-systems of morphisms. - Jürgen Dassow; Gheorghe Paun; Gabriel Thierrin; Sheng Yu 001 (Acta Informatica, 2001)

P Systems with Communication Based on Concentration. - Jürgen Dassow; Gheorghe Paun (Acta Cybern., 2001)

On the Descriptional Complexity of Some Variants of Lindenmayer Systems. - Jürgen Dassow; Taishin Y. Nishida; Bernd Reichel (Developments in Language Theory, 2002)

Editorial. - Jürgen Dassow; Detlef Wotschke; Bernd Reichel (J. Autom. Lang. Comb., 2002)

Some Remarks on Codes Defined by Petri Nets. - Masami Ito; Jürgen Dassow; Ralf Stiebe (J. Univers. Comput. Sci., 2002)

Operations and language generating devices suggested by the genome evolution. - Jürgen Dassow; Victor Mitrana; Arto Salomaa (Theor. Comput. Sci., 2002)

On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems. - Erzsébet Csuhaj-Varjú; Jürgen Dassow (Theory Is Forever, 2004)

A Ciliate Bio-operation and Language Families. - Jürgen Dassow (Developments in Language Theory, 2004)

On The Descriptional Complexity Of Lindenmayer Systems. - Jürgen Dassow (Int. J. Found. Comput. Sci., 2004)

On differentiation functions, structure functions, and related languages of context-free grammars. - Jürgen Dassow; Victor Mitrana; Gheorghe Paun; Ralf Stiebe (RAIRO Theor. Informatics Appl., 2004)

Editorial. - Jürgen Dassow; Helmut Jürgensen; Detlef Wotschke (J. Autom. Lang. Comb., 2004)

A remark on evolutionary systems. - Erzsébet Csuhaj-Varjú; Jürgen Dassow (Discret. Appl. Math., 2005)

Contextual Grammars with Subregular Choice. - Jürgen Dassow (Fundam. Informaticae, 2005)

Language families defined by a ciliate bio-operation: hierarchies and decision problems. - Jürgen Dassow; Markus Holzer 001 (Int. J. Found. Comput. Sci., 2005)

On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems. - Jürgen Dassow; Bianca Truthe (DCFS, 2006)

Ciliate Bio-operations on Finite String Multisets. - Jürgen Dassow; György Vaszil (Developments in Language Theory, 2006)

P Finite Automata and Regular Languages over Countably Infinite Alphabets. - Jürgen Dassow; György Vaszil (Workshop on Membrane Computing, 2006)

CD grammar systems with competence based entry conditions in their cooperation protocols. - Erzsébet Csuhaj-Varjú; Jürgen Dassow; Markus Holzer 001 (Int. J. Comput. Math., 2006)

Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors. - Jürgen Dassow; Carlos Martín-Vide; Victor Mitrana (Formal Models, Languages and Applications, 2007)

On the Power of Networks of Evolutionary Processors. - Jürgen Dassow; Bianca Truthe (MCU, 2007)

On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions. - Jürgen Dassow (Fundam. Informaticae, 2007)

On the number of components for some parallel communicating grammar systems. - Jürgen Dassow; Bianca Truthe (Theor. Comput. Sci., 2007)

Subregularly Tree Controlled Grammars and Languages. - Jürgen Dassow; Bianca Truthe (AFL, 2008)

On Two Hierarchies of Subregularly Tree Controlled Languages. - Jürgen Dassow; Bianca Truthe (DCFS, 2008)

Some New Modes of Competence-Based Derivations in CD Grammar Systems. - Erzsébet Csuhaj-Varjú; Jürgen Dassow; György Vaszil (Developments in Language Theory, 2008)

k-Petri Net Controlled Grammars. - Jürgen Dassow; Sherzod Turaev (LATA, 2008)

Nonterminal Complexity of Some Operations on Context-Free Languages. - Jürgen Dassow; Ralf Stiebe (Fundam. Informaticae, 2008)

Comparison of some descriptional complexities of 0L systems obtained by a unifying approach. - Jürgen Dassow; Henning Fernau (Inf. Comput., 2008)

Conditional Grammars with Commutative, Circular and Locally Testable Conditions. - Jürgen Dassow (Automata, Formal Languages, and Related Topics, 2009)

Grammars Controlled by Special Petri Nets. - Jürgen Dassow; Sherzod Turaev (LATA, 2009)

Evolving Under Small Disruption. - Jürgen Dassow; Gema M. Martín; Francisco J. Vico (NCMA, 2009)

On Networks of Evolutionary Processors with Nodes of Two Types. - Artiom Alhazov; Carlos Martín-Vide; Bianca Truthe; Jürgen Dassow; Yurii Rogozhin (Fundam. Informaticae, 2009)

A Similarity Measure for Cyclic Unary Regular Languages. - Jürgen Dassow; Gema M. Martín; Francisco J. Vico (Fundam. Informaticae, 2009)

Editorial. - Jürgen Dassow; Andreas Malcher (J. Autom. Lang. Comb., 2009)

Petri Net Controlled Grammars: the Case of Special Petri Nets. - Jürgen Dassow; Sherzod Turaev (J. Univers. Comput. Sci., 2009)

Some operations preserving primitivity of words. - Jürgen Dassow; Gema M. Martín; Francisco J. Vico (Theor. Comput. Sci., 2009)

Two collapsing hierarchies of subregularly tree controlled languages. - Jürgen Dassow; Ralf Stiebe; Bianca Truthe (Theor. Comput. Sci., 2009)

Accepting Networks of Non-inserting Evolutionary Processors. - Jürgen Dassow; Victor Mitrana (Trans. Comp. Sys. Biology, 2009)

On Networks of Evolutionary Processors with State Limited Filters. - Jürgen Dassow; Bianca Truthe (NCMA, 2010)

Petri Net Controlled Grammars with a Bounded Number of Additional Places. - Jürgen Dassow; Sherzod Turaev (Acta Cybern., 2010)

Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication - Jürgen Dassow; Florin Manea (DCFS, 2010)

Low Disruption Transformations on Cyclic Automata. - Gema M. Martín; Francisco J. Vico; Jürgen Dassow; Bianca Truthe (Fundam. Informaticae, 2010)

Variants of Competence-Based Derivations in CD Grammar Systems. - Erzsébet Csuhaj-Varjú; Jürgen Dassow; György Vaszil (Int. J. Found. Comput. Sci., 2010)

Generative Capacity of Subregularly Tree Controlled Grammars. - Jürgen Dassow; Ralf Stiebe; Bianca Truthe (Int. J. Found. Comput. Sci., 2010)

Extending regular expressions with homomorphic replacement. - Henning Bordihn; Jürgen Dassow; Markus Holzer 001 (RAIRO Theor. Informatics Appl., 2010)

Editorial. - Jürgen Dassow; Giovanni Pighizzini; Bianca Truthe (J. Autom. Lang. Comb., 2010)

On Contextual Grammars with Subregular Selection Languages. - Jürgen Dassow; Florin Manea; Bianca Truthe (DCFS, 2011)

Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. - Sherzod Turaev; Jürgen Dassow; Mohd Hasan Selamat (DCFS, 2011)

Networks of Evolutionary Processors with Subregular Filters. - Jürgen Dassow; Florin Manea; Bianca Truthe (LATA, 2011)

On Normal Forms for Networks of Evolutionary Processors. - Jürgen Dassow; Florin Manea; Bianca Truthe (UC, 2011)

On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata. - Jürgen Dassow; Bianca Truthe (Fundam. Informaticae, 2011)

The role of evolutionary operations in accepting hybrid networks of evolutionary processors. - Jürgen Dassow; Victor Mitrana; Bianca Truthe (Inf. Comput., 2011)

On the Number of Active Symbols in Lindenmayer Systems. - Jürgen Dassow; György Vaszil (Int. J. Found. Comput. Sci., 2011)

Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial. - Henning Bordihn; Jürgen Dassow; Martin Kutrib; Bianca Truthe (J. Autom. Lang. Comb., 2011)

Graph grammars with string-regulated rewriting. - Daniel Lobo; Francisco J. Vico; Jürgen Dassow (Theor. Comput. Sci., 2011)

Nonterminal complexity of tree controlled grammars. - Sherzod Turaev; Jürgen Dassow; Mohd Hasan Selamat (Theor. Comput. Sci., 2011)

Connecting Partial Words and Regular Languages. - Jürgen Dassow; Florin Manea; Robert Mercas (CiE, 2012)

Production Complexity of Some Operations on Context-Free Languages. - Jürgen Dassow; Ronny Harbich (DCFS, 2012)

Subregular Restrictions for Some Language Generating Devices. - Jürgen Dassow (NCMA, 2012)

Extended Splicing Systems with Subregular Sets of Splicing Rules. - Jürgen Dassow; Bianca Truthe (NCMA, 2012)

Generating Networks of Splicing Processors. - Jürgen Dassow; Florin Manea; Bianca Truthe (RAIRO Theor. Informatics Appl., 2012)

Descriptional Complexity of Union and Star on Context-Free Languages. - Jürgen Dassow; Ronny Harbich (J. Autom. Lang. Comb., 2012)

Editorial. - Jürgen Dassow; Martin Kutrib; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2012)

On Subregular Selection Languages in Internal Contextual Grammars. - Jürgen Dassow; Florin Manea; Bianca Truthe (J. Autom. Lang. Comb., 2012)

On restricted context-free grammars. - Jürgen Dassow; Tomás Masopust (J. Comput. Syst. Sci., 2012)

Networks of evolutionary processors: computationally complete normal forms. - Jürgen Dassow; Florin Manea; Bianca Truthe (Nat. Comput., 2012)

On external contextual grammars with subregular selection languages. - Jürgen Dassow; Florin Manea; Bianca Truthe (Theor. Comput. Sci., 2012)

Language classes generated by tree controlled grammars with bounded nonterminal complexity. - Sherzod Turaev; Jürgen Dassow; Florin Manea; Mohd Hasan Selamat (Theor. Comput. Sci., 2012)

Accepting splicing systems with permitting and forbidding words. - Fernando Arroyo; Juan Castellanos; Jürgen Dassow; Victor Mitrana; José-Ramón Sánchez-Couso (Acta Informatica, 2013)

Networks of evolutionary processors: the power of subregular filters. - Jürgen Dassow; Florin Manea; Bianca Truthe (Acta Informatica, 2013)

Restarting Automata with Subregular Constraints. - Jürgen Dassow (Discrete Mathematics and Computer Science, 2014)

Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources. - Jürgen Dassow (Computing with New Resources, 2014)

Inner Palindromic Closure. - Jürgen Dassow; Florin Manea; Robert Mercas; Mike Müller (Int. J. Found. Comput. Sci., 2014)

Regular languages of partial words. - Jürgen Dassow; Florin Manea; Robert Mercas (Inf. Sci., 2014)

Conditional Lindenmayer systems with subregular conditions: The non-extended case. - Jürgen Dassow; Stefan Rudolf (RAIRO Theor. Informatics Appl., 2014)

Editorial. - Jürgen Dassow; Jozef Kelemen; Gheorghe Paun (J. Autom. Lang. Comb., 2014)

Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case. - Jürgen Dassow; Stefan Rudolf (Acta Cybern., 2015)

On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters. - Jürgen Dassow; Florin Manea; Bianca Truthe (Fundam. Informaticae, 2015)

Editorial. - Jürgen Dassow (J. Autom. Lang. Comb., 2016)

On the Number of Accepting States of Finite Automata. - Jürgen Dassow (J. Autom. Lang. Comb., 2016)

Descriptional Complexity and Operations - Two Non-classical Cases. - Jürgen Dassow (DCFS, 2017)

Grammars with Control by Ideals and Codes. - Jürgen Dassow (J. Autom. Lang. Comb., 2018)

Operational Accepting State Complexity: The Unary and Finite Case. - Jürgen Dassow (Int. J. Found. Comput. Sci., 2019)

On the orbit of closure-involution operations - The case of formal languages. - Jürgen Dassow (Theor. Comput. Sci., 2019)

Networks with Evolutionary Processors and Ideals and Codes as Filters. - Jürgen Dassow; Bianca Truthe (Int. J. Found. Comput. Sci., 2020)

Lindenmayer Systems with Control by Ideals and Codes. - Jürgen Dassow (J. Autom. Lang. Comb., 2020)

Generating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters. - Jürgen Dassow; Bianca Truthe (J. Autom. Lang. Comb., 2020)

Operational complexity and right linear grammars. - Jürgen Dassow (Acta Informatica, 2021)

Some remarks on the orbit of closure-involution operations on languages. - Jürgen Dassow (Inf. Comput., 2021)

Further Remarks on the Operational Nonterminal Complexity. - Jürgen Dassow (Int. J. Found. Comput. Sci., 2021)

Accepting networks of evolutionary processors with resources restricted and structure limited filters. - Jürgen Dassow; Bianca Truthe (RAIRO Theor. Informatics Appl., 2021)

Remarks on external contextual grammars with selection. - Jürgen Dassow (Theor. Comput. Sci., 2021)

Operational complexity and pumping lemmas. - Jürgen Dassow; Ismaël Jecker (Acta Informatica, 2022)

On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages. - Jürgen Dassow; Bianca Truthe (NCMA, 2022)

25 Editions of DCFS: Origins and Directions. - Jürgen Dassow; Martin Kutrib; Giovanni Pighizzini (Bull. EATCS, 2023)

Relations of contextual grammars with strictly locally testable selection languages. - Jürgen Dassow; Bianca Truthe (RAIRO Theor. Informatics Appl., 2023)

Pareto Grammars. - Jürgen Dassow (J. Autom. Lang. Comb., 2023)

Insertion Systems Controlled by Ideals and Codes. - Jürgen Dassow; Bianca Truthe (Comput. Sci. J. Moldova, 2024)

Remarks on context-free grammars with subregular control languages. - Jürgen Dassow (Theor. Comput. Sci., 2024)