Jürgen Dassow

Affiliations:
  • Otto von Guericke University of Magdeburg, Germany


According to our database1, Jürgen Dassow authored at least 170 papers between 1974 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Remarks on external contextual grammars with selection.
Theor. Comput. Sci., 2021

Accepting networks of evolutionary processors with resources restricted and structure limited filters.
RAIRO Theor. Informatics Appl., 2021

Further Remarks on the Operational Nonterminal Complexity.
Int. J. Found. Comput. Sci., 2021

Some remarks on the orbit of closure-involution operations on languages.
Inf. Comput., 2021

Operational complexity and right linear grammars.
Acta Informatica, 2021

2020
Generating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters.
J. Autom. Lang. Comb., 2020

Lindenmayer Systems with Control by Ideals and Codes.
J. Autom. Lang. Comb., 2020

Networks with Evolutionary Processors and Ideals and Codes as Filters.
Int. J. Found. Comput. Sci., 2020

2019
On the orbit of closure-involution operations - The case of formal languages.
Theor. Comput. Sci., 2019

Operational Accepting State Complexity: The Unary and Finite Case.
Int. J. Found. Comput. Sci., 2019

2018
Grammars with Control by Ideals and Codes.
J. Autom. Lang. Comb., 2018

2017
Descriptional Complexity and Operations - Two Non-classical Cases.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
On the Number of Accepting States of Finite Automata.
J. Autom. Lang. Comb., 2016

Editorial.
J. Autom. Lang. Comb., 2016

2015
On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters.
Fundam. Informaticae, 2015

Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case.
Acta Cybern., 2015

2014
Editorial.
J. Autom. Lang. Comb., 2014

Conditional Lindenmayer systems with subregular conditions: The non-extended case.
RAIRO Theor. Informatics Appl., 2014

Regular languages of partial words.
Inf. Sci., 2014

Inner Palindromic Closure.
Int. J. Found. Comput. Sci., 2014

Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources.
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
Networks of evolutionary processors: the power of subregular filters.
Acta Informatica, 2013

Accepting splicing systems with permitting and forbidding words.
Acta Informatica, 2013

2012
Language classes generated by tree controlled grammars with bounded nonterminal complexity.
Theor. Comput. Sci., 2012

On external contextual grammars with subregular selection languages.
Theor. Comput. Sci., 2012

Networks of evolutionary processors: computationally complete normal forms.
Nat. Comput., 2012

On restricted context-free grammars.
J. Comput. Syst. Sci., 2012

On Subregular Selection Languages in Internal Contextual Grammars.
J. Autom. Lang. Comb., 2012

Editorial.
J. Autom. Lang. Comb., 2012

Descriptional Complexity of Union and Star on Context-Free Languages.
J. Autom. Lang. Comb., 2012

Generating Networks of Splicing Processors.
RAIRO Theor. Informatics Appl., 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

Production Complexity of Some Operations on Context-Free Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

Connecting Partial Words and Regular Languages.
Proceedings of the How the World Computes, 2012

2011
Nonterminal complexity of tree controlled grammars.
Theor. Comput. Sci., 2011

Graph grammars with string-regulated rewriting.
Theor. Comput. Sci., 2011

Selected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial.
J. Autom. Lang. Comb., 2011

On the Number of Active Symbols in Lindenmayer Systems.
Int. J. Found. Comput. Sci., 2011

The role of evolutionary operations in accepting hybrid networks of evolutionary processors.
Inf. Comput., 2011

On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata.
Fundam. Informaticae, 2011

On Normal Forms for Networks of Evolutionary Processors.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

Networks of Evolutionary Processors with Subregular Filters.
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

On Contextual Grammars with Subregular Selection Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010
Editorial.
J. Autom. Lang. Comb., 2010

Extending regular expressions with homomorphic replacement.
RAIRO Theor. Informatics Appl., 2010

Generative Capacity of Subregularly Tree Controlled Grammars.
Int. J. Found. Comput. Sci., 2010

Variants of Competence-Based Derivations in CD Grammar Systems.
Int. J. Found. Comput. Sci., 2010

Low Disruption Transformations on Cyclic Automata.
Fundam. Informaticae, 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

Petri Net Controlled Grammars with a Bounded Number of Additional Places.
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
Accepting Networks of Non-inserting Evolutionary Processors.
Trans. Comp. Sys. Biology, 2009

Two collapsing hierarchies of subregularly tree controlled languages.
Theor. Comput. Sci., 2009

Some operations preserving primitivity of words.
Theor. Comput. Sci., 2009

Petri Net Controlled Grammars: the Case of Special Petri Nets.
J. Univers. Comput. Sci., 2009

Editorial.
J. Autom. Lang. Comb., 2009

A Similarity Measure for Cyclic Unary Regular Languages.
Fundam. Informaticae, 2009

On Networks of Evolutionary Processors with Nodes of Two Types.
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

Grammars Controlled by Special Petri Nets.
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

Nonterminal Complexity of Some Operations on Context-Free Languages.
Fundam. Informaticae, 2008

k-Petri Net Controlled Grammars.
Proceedings of the Language and Automata Theory and Applications, 2008

Some New Modes of Competence-Based Derivations in CD Grammar Systems.
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
On the number of components for some parallel communicating grammar systems.
Theor. Comput. Sci., 2007

On Cooperating Distributed Grammar Systems with Competence Based Start and Stop Conditions.
Fundam. Informaticae, 2007

On the Power of Networks of Evolutionary Processors.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors.
Proceedings of the Formal Models, 2007

2006
CD grammar systems with competence based entry conditions in their cooperation protocols.
Int. J. Comput. Math., 2006

P Finite Automata and Regular Languages over Countably Infinite Alphabets.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

Ciliate Bio-operations on Finite String Multisets.
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

Contextual Grammars with Subregular Choice.
Fundam. Informaticae, 2005

A remark on evolutionary systems.
Discret. Appl. Math., 2005

2004
Editorial.
J. Autom. Lang. Comb., 2004

On differentiation functions, structure functions, and related languages of context-free grammars.
RAIRO Theor. Informatics Appl., 2004

On The Descriptional Complexity Of Lindenmayer Systems.
Int. J. Found. Comput. Sci., 2004

A Ciliate Bio-operation and Language Families.
Proceedings of the Developments in Language Theory, 2004

On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems.
Proceedings of the Theory Is Forever, 2004

2002
Operations and language generating devices suggested by the genome evolution.
Theor. Comput. Sci., 2002

Some Remarks on Codes Defined by Petri Nets.
J. Univers. Comput. Sci., 2002

Editorial.
J. Autom. Lang. Comb., 2002

On the Descriptional Complexity of Some Variants of Lindenmayer Systems.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
P Systems with Communication Based on Concentration.
Acta Cybern., 2001

Tree-systems of morphisms.
Acta Informatica, 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
Editorial.
J. Autom. Lang. Comb., 2000

Finite Automata over Free Groups.
Int. J. Algebra Comput., 2000

Parallel Communicating Grammar Systems As Language Analyzers.
Grammars, 2000

Conditional Concatenation.
Fundam. Informaticae, 2000

Parikh Mapping and Iteration.
Proceedings of the Multiset Processing, 2000

On the Differentiation Function of some Language Generating Devices.
Proceedings of the International Colloquium on Words, 2000

1999
On the Power of Membrane Computing.
J. Univers. Comput. Sci., 1999

Stack Cooperation in Multistack Pushdown Automata.
J. Comput. Syst. Sci., 1999

Min of Mat is not Necessarily Mat.
Inf. Process. Lett., 1999

On the Leftmost Derivation in Matrix Grammars.
Int. J. Found. Comput. Sci., 1999

On the Regularity of Duplication Closure.
Bull. EATCS, 1999

On the Regularity of Languages Generated by Context-free Evolutionary Grammars.
Discret. Appl. Math., 1999

CD Grammar Systems Versus L Systems.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Grammar Systems as Language Analyzers and Recursively Enumerable Languages.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Numerical Parameters of Evolutionary Grammars.
Proceedings of the Jewels are Forever, 1999

1998
Convex and anti-convex languages.
Int. J. Comput. Math., 1998

Remarks on Operations Suggested by Mutations in Genomes.
Fundam. Informaticae, 1998

Some Remarks on Networks of Parallel Language Processors.
Proceedings of the Rough Sets and Current Trends in Computing, 1998

1997
Grammars with Controlled Derivations.
Proceedings of the Handbook of Formal Languages, 1997

Grammar Systems.
Proceedings of the Handbook of Formal Languages, 1997

Cooperation in Context-Free Grammars.
Theor. Comput. Sci., 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
Splicing Grammar Systems.
Comput. Artif. Intell., 1996

Fairness in Grammar Systems.
Acta Cybern., 1996

Evolutionary Grammars: A Granunatical Model for Genome Evolution.
Proceedings of the German Conference on Bioinformatics, 1996

Evolutionary Grammars: A Grammatical Model for Genome Evolution.
Proceedings of the Bioinformatics, German Conference on Bioinformatics, Leipzig, 1996

1995
Cooperating Array Grammar Systems.
Int. J. Pattern Recognit. Artif. Intell., 1995

On the Generative Capacity of Certain Classes of Cooperating Grammar Systems.
Fundam. Informaticae, 1995

1994
Chain-Code Pictures and Collages Generated by Hyperedge Replacement.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Decision Problems for Edge Grammars.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

On the Size of Components of Cooperating Grammar Systems.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
Language-theoretic problems arising from Richelieu cryptosystems.
Theor. Comput. Sci., 1993

Deterministic Soliton Automata with at Most One Cycle.
J. Comput. Syst. Sci., 1993

Efficient Reductions of Picture Words.
RAIRO Theor. Informatics Appl., 1993

Dynamically controlled cooperating/distributed grammar systems.
Inf. Sci., 1993

On the Union of 0L Languages.
Inf. Process. Lett., 1993

Grammars Based on Patterns.
Int. J. Found. Comput. Sci., 1993

Decision Problems and Regular Chain Code Picture Languages.
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
On cooperating/distributed grammar systems with different styles of acceptance.
Int. J. Comput. Math., 1992

Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure.
Acta Cybern., 1992

1991
Deterministic Soliton Automata with a Single Exterior Node.
Theor. Comput. Sci., 1991

On the Connectedness of Pictures in Chain Code Picture Languages.
Theor. Comput. Sci., 1991

On Bounded Interpretations of Grammar Forms.
Theor. Comput. Sci., 1991

Cooperating/distributed grammar systems with hypothesis languages.
J. Exp. Theor. Artif. Intell., 1991

Cooperating/Distributed Grammar Systems: a Link between Formal Languages and Artificial Intelligence.
Bull. EATCS, 1991

Computational Calculus and Hardest Languages of Automata with Abstract Storages.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
Soliton Automata.
J. Comput. Syst. Sci., 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

On the degree of non-regularity of context-free languages.
Int. J. Comput. Math., 1990

Information transmission in il systems.
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

On the Power of Synchronization in Parallel Computations.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Regulated Rewriting in Formal Language Theory.
Springer, ISBN: 978-3-642-74934-6, 1989

1988
A Remark on Limited OL Systems.
J. Inf. Process. Cybern., 1988

Pure languages of regulated rewriting and their codings.
Acta Cybern., 1988

1985
Further remarks on the complexity of regulated rewriting.
Kybernetika, 1985

On Ordered Variants of Some Regulated Grammars.
J. Inf. Process. Cybern., 1985

1984
A note on DTOL Systems.
Bull. EATCS, 1984

On some extensions of Russian parallel context free grammars.
Acta Cybern., 1984

1983
A note on programmed 0L systems.
Inf. Sci., 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

Grammars with valuations - a discrete model for self-organization of biopolymers.
Discret. Appl. Math., 1982

1981
Equality Languages and Language Families.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
On some extensions of Indian parallel context free grammars.
Acta Cybern., 1980

1979
On the Circular Closure of Languages.
J. Inf. Process. Cybern., 1979

1977
Some Remarks on the Algebra of Automation Mapping.
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


  Loading...