Jürgen Dassow
Orcid: 0000-0002-4735-4696Affiliations:
- Otto von Guericke University of Magdeburg, Germany
According to our database1,
Jürgen Dassow
authored at least 177 papers
between 1974 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Theor. Comput. Sci., 2024
2023
RAIRO Theor. Informatics Appl., 2023
2022
On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages.
Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022
2021
Accepting networks of evolutionary processors with resources restricted and structure limited filters.
RAIRO Theor. Informatics Appl., 2021
Int. J. Found. Comput. Sci., 2021
Inf. Comput., 2021
2020
Generating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters.
J. Autom. Lang. Comb., 2020
Int. J. Found. Comput. Sci., 2020
2019
Theor. Comput. Sci., 2019
Int. J. Found. Comput. Sci., 2019
2018
2017
Proceedings of the Descriptional Complexity of Formal Systems, 2017
2016
2015
On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters.
Fundam. Informaticae, 2015
Acta Cybern., 2015
2014
RAIRO Theor. Informatics Appl., 2014
Proceedings of the Computing with New Resources, 2014
Restarting Automata with Subregular Constraints.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014
2013
Acta Informatica, 2013
Acta Informatica, 2013
2012
Language classes generated by tree controlled grammars with bounded nonterminal complexity.
Theor. Comput. Sci., 2012
Theor. Comput. Sci., 2012
Nat. Comput., 2012
J. Autom. Lang. Comb., 2012
J. Autom. Lang. Comb., 2012
Extended Splicing Systems with Subregular Sets of Splicing Rules.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012
Subregular Restrictions for Some Language Generating Devices.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012
Proceedings of the Descriptional Complexity of Formal Systems, 2012
Proceedings of the How the World Computes, 2012
2011
Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial.
J. Autom. Lang. Comb., 2011
Int. J. Found. Comput. Sci., 2011
The role of evolutionary operations in accepting hybrid networks of evolutionary processors.
Inf. Comput., 2011
Fundam. Informaticae, 2011
Proceedings of the Unconventional Computation - 10th International Conference, 2011
Proceedings of the Language and Automata Theory and Applications, 2011
Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity.
Proceedings of the Descriptional Complexity of Formal Systems, 2011
Proceedings of the Descriptional Complexity of Formal Systems, 2011
2010
RAIRO Theor. Informatics Appl., 2010
Int. J. Found. Comput. Sci., 2010
Int. J. Found. Comput. Sci., 2010
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010
Acta Cybern., 2010
On Networks of Evolutionary Processors with State Limited Filters.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010
2009
Trans. Comp. Sys. Biology, 2009
Theor. Comput. Sci., 2009
J. Univers. Comput. Sci., 2009
Fundam. Informaticae, 2009
Evolving Under Small Disruption.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009
Proceedings of the Language and Automata Theory and Applications, 2009
Conditional Grammars with Commutative, Circular and Locally Testable Conditions.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009
2008
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach.
Inf. Comput., 2008
Fundam. Informaticae, 2008
Proceedings of the Language and Automata Theory and Applications, 2008
Proceedings of the Developments in Language Theory, 12th International Conference, 2008
On Two Hierarchies of Subregularly Tree Controlled Languages.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008
Subregularly Tree Controlled Grammars and Languages.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008
2007
Theor. Comput. Sci., 2007
On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions.
Fundam. Informaticae, 2007
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007
Proceedings of the Formal Models, 2007
2006
CD grammar systems with competence based entry conditions in their cooperation protocols.
Int. J. Comput. Math., 2006
Proceedings of the Membrane Computing, 7th International Workshop, 2006
Proceedings of the Developments in Language Theory, 10th International Conference, 2006
On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006
2005
Language families defined by a ciliate bio-operation: hierarchies and decision problems.
Int. J. Found. Comput. Sci., 2005
2004
On differentiation functions, structure functions, and related languages of context-free grammars.
RAIRO Theor. Informatics Appl., 2004
Int. J. Found. Comput. Sci., 2004
Proceedings of the Developments in Language Theory, 2004
Proceedings of the Theory Is Forever, 2004
2002
Theor. Comput. Sci., 2002
Proceedings of the Developments in Language Theory, 6th International Conference, 2002
2001
Subregularly controlled derivations: restrictions by syntactic parameters.
Proceedings of the Where Mathematics, 2001
Conditional Grammars with Restrictions by Syntactic Parameters.
Proceedings of the Words, Semigroups, and Transductions, 2001
2000
On the Differentiation Function of some Language Generating Devices.
Proceedings of the International Colloquium on Words, 2000
1999
On the Regularity of Duplication Closure.
Bull. EATCS, 1999
Discret. Appl. Math., 1999
CD Grammar Systems Versus L Systems.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999
Numerical Parameters of Evolutionary Grammars.
Proceedings of the Jewels are Forever, 1999
1998
Proceedings of the Rough Sets and Current Trends in Computing, 1998
1997
Proceedings of the Handbook of Formal Languages, 1997
Point mutations in context-free languages.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997
Some Remarks on Extended Reular Languages.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997
1996
Evolutionary Grammars: A Granunatical Model for Genome Evolution.
Proceedings of the German Conference on Bioinformatics, 1996
Proceedings of the Bioinformatics, German Conference on Bioinformatics, Leipzig, 1996
1995
Fundam. Informaticae, 1995
1994
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994
Proceedings of the Results and Trends in Theoretical Computer Science, 1994
1993
Theor. Comput. Sci., 1993
Discret. Appl. Math., 1993
Iterative Reading of Numbers: The Ordered Case.
Proceedings of the Developments in Language Theory, 1993
A Note on the Degree of Nondeterminism.
Proceedings of the Developments in Language Theory, 1993
1992
Int. J. Comput. Math., 1992
Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure.
Acta Cybern., 1992
1991
Theor. Comput. Sci., 1991
Theor. Comput. Sci., 1991
J. Exp. Theor. Artif. Intell., 1991
Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence.
Bull. EATCS, 1991
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991
1990
On the relations between the degree of synchronization and the degree of nondeterminism in <i>k</i>-limited and uniformly <i>k</i>-limited tol systems.
Int. J. Comput. Math., 1990
Int. J. Comput. Math., 1990
On Cooperating/Distributed Grammar Systems.
J. Inf. Process. Cybern., 1990
1989
Graph-theoretical Properties and Chain Code Picture Languages.
J. Inf. Process. Cybern., 1989
A undecidability result for regular anguages and its applications to regulated rewriting.
Bull. EATCS, 1989
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989
Springer, ISBN: 978-3-642-74934-6, 1989
1988
A Remark on Limited OL Systems.
J. Inf. Process. Cybern., 1988
1985
On Ordered Variants of Some Regulated Grammars.
J. Inf. Process. Cybern., 1985
1984
A note on DTOL Systems.
Bull. EATCS, 1984
1983
1982
L(ETOL<sub>[5]</sub>) = L(ETOL).
J. Inf. Process. Cybern., 1982
Remark on a Problem of Nguyen Xuan My and Paun.
J. Inf. Process. Cybern., 1982
Discret. Appl. Math., 1982
1981
Proceedings of the Fundamentals of Computation Theory, 1981
1980
1979
On the Circular Closure of Languages.
J. Inf. Process. Cybern., 1979
1977
Proceedings of the Fundamentals of Computation Theory, 1977
1976
Eine neue Funktion für Lindenmayer-Systeme.
J. Inf. Process. Cybern., 1976
1975
Über metrische Kleene-Vollständigkeit.
J. Inf. Process. Cybern., 1975
1974
Kleene-Vollständigkeit bei stark-definiten Ereignissen.
J. Inf. Process. Cybern., 1974
Kleene-Mengen und Kleene-Vollständigkeit.
J. Inf. Process. Cybern., 1974