Jürgen Dassow
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jürgen Dassow has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Bianca Truthe
Institut für Informatik Universität Giessen Arndtstr. 2 35392 Giessen Germany
7 shared publications - Gheorghe Păun
Rovira i Virgili University
5 shared publications - Florin Manea
Kiel University
4 shared publications - Victor Mitrana
Polytechnic University of Madrid
3 shared publications - Florin Manea
Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Christian-Albrechts-Platz 4, D-24098 Kiel, Germany
2 shared publications - Francisco J. Vico
Universidad de Málaga Calle Severo Ochoa 4, 119 Campanillas 29590 Málaga Spain
2 shared publications
Latest Publications
- 29 October 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 37 (02) , 379-398
On Deterministic Finite Automata Equipped with Partial Orders
We consider deterministic finite automata equipped with a reflexive partial order on the set of states which is preserved by the transition function. We define the width of a deterministic finite automaton by the minimal width of such reflexive partial orders. For a regular language, we define its width as the minimal width of deterministic finite automata accepting the language. We discuss the unary case, study the relation between state complexity and width, and investigate the behaviour of the width under operations.
- 29 October 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 37 (02) , 379-398
On Deterministic Finite Automata Equipped with Partial Orders
We consider deterministic finite automata equipped with a reflexive partial order on the set of states which is preserved by the transition function. We define the width of a deterministic finite automaton by the minimal width of such reflexive partial orders. For a regular language, we define its width as the minimal width of deterministic finite automata accepting the language. We discuss the unary case, study the relation between state complexity and width, and investigate the behaviour of the width under operations.
- 3 July 2025
- Published by Springer Nature
- p. 41-53
Further Remarks on Context-Free Grammars with Subregular Control Languages
- 3 July 2025
- Published by Springer Nature
- p. 41-53
Further Remarks on Context-Free Grammars with Subregular Control Languages
- 1 November 2024
- Published by Moldova State University in Computer Science Journal of Moldova
- Vol. 32 (3(96)) , 372-388
Insertion Systems Controlled by Ideals and Codes
We study the generative power of controlled insertion systems where the control languages are special codes or ideals instead of arbitrary regular languages.
- 1 November 2024
- Published by Moldova State University in Computer Science Journal of Moldova
- Vol. 32 (3(96)) , 372-388
Insertion Systems Controlled by Ideals and Codes
We study the generative power of controlled insertion systems where the control languages are special codes or ideals instead of arbitrary regular languages.
- 8 August 2024
- Published by Elsevier in Focus on Catalysts
- Vol. 2024 (8) , 5
Rondo Energy announces EUR 75 M project funding with Breakthrough Energy Catalyst and the European Investment Bank
- 8 August 2024
- Published by Elsevier in Focus on Catalysts
- Vol. 2024 (8) , 5
Rondo Energy announces EUR 75 M project funding with Breakthrough Energy Catalyst and the European Investment Bank
- Open Access
- 26 June 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 1010
Remarks on context-free grammars with subregular control languages
- 26 June 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 1010
Open AccessRemarks on context-free grammars with subregular control languages
- Open Access
- 20 July 2022
- Published by Springer Nature in Acta Informatica
- Vol. 59 (4) , 337-355
Operational complexity and pumping lemmas
The well-known pumping lemma for regular languages states that, for any regular language L, there is a constant p (depending on L) such that the following holds: If $$w\in L$$ and $$\vert w\vert \ge p$$ , then there are words $$x\in V^{*}$$ , $$y\in V^+$$ , and $$z\in V^{*}$$ such that $$w=xyz$$ and $$xy^tz\in L$$ for $$t\ge 0$$ . The minimal pumping constant $${{{\,\mathrm{mpc}\,}}(L)}$$ of L is the minimal number p for which the conditions of the pumping lemma are satisfied. We investigate the behaviour of $${{{\,\mathrm{mpc}\,}}}$$ with respect to operations, i. e., for an n-ary regularity preserving operation $$\circ $$ , we study the set $${g_{\circ }^{{{\,\mathrm{mpc}\,}}}(k_1,k_2,\ldots ,k_n)}$$ of all numbers k such that there are regular languages $$L_1,L_2,\ldots ,L_n$$ with $${{{\,\mathrm{mpc}\,}}(L_i)=k_i}$$ for $$1\le i\le n$$ and $${{{\,\mathrm{mpc}\,}}(\circ (L_1,L_2,\ldots ,L_n)=~k}$$ . With respect to Kleene closure, complement, reversal, prefix and suffix-closure, circular shift, union, intersection, set-subtraction, symmetric difference,and concatenation, we determine $${g_{\circ }^{{{\,\mathrm{mpc}\,}}}(k_1,k_2,\ldots ,k_n)}$$ completely. Furthermore, we give some results with respect to the minimal pumping length where, in addition, $$\vert xy\vert \le p$$ has to hold.- 20 July 2022
- Published by Springer Nature in Acta Informatica
- Vol. 59 (4) , 337-355
Open AccessOperational complexity and pumping lemmas
The well-known pumping lemma for regular languages states that, for any regular language L, there is a constant p (depending on L) such that the following holds: If $$w\in L$$ and $$\vert w\vert \ge p$$ , then there are words $$x\in V^{*}$$ , $$y\in V^+$$ , and $$z\in V^{*}$$ such that $$w=xyz$$ and $$xy^tz\in L$$ for $$t\ge 0$$ . The minimal pumping constant $${{{\,\mathrm{mpc}\,}}(L)}$$ of L is the minimal number p for which the conditions of the pumping lemma are satisfied. We investigate the behaviour of $${{{\,\mathrm{mpc}\,}}}$$ with respect to operations, i. e., for an n-ary regularity preserving operation $$\circ $$ , we study the set $${g_{\circ }^{{{\,\mathrm{mpc}\,}}}(k_1,k_2,\ldots ,k_n)}$$ of all numbers k such that there are regular languages $$L_1,L_2,\ldots ,L_n$$ with $${{{\,\mathrm{mpc}\,}}(L_i)=k_i}$$ for $$1\le i\le n$$ and $${{{\,\mathrm{mpc}\,}}(\circ (L_1,L_2,\ldots ,L_n)=~k}$$ . With respect to Kleene closure, complement, reversal, prefix and suffix-closure, circular shift, union, intersection, set-subtraction, symmetric difference,and concatenation, we determine $${g_{\circ }^{{{\,\mathrm{mpc}\,}}}(k_1,k_2,\ldots ,k_n)}$$ completely. Furthermore, we give some results with respect to the minimal pumping length where, in addition, $$\vert xy\vert \le p$$ has to hold. - 1 December 2021
- Published by Elsevier in Information and Computation
- Vol. 281, 104811
Some remarks on the orbit of closure-involution operations on languages
- 1 December 2021
- Published by Elsevier in Information and Computation
- Vol. 281, 104811
Some remarks on the orbit of closure-involution operations on languages
- Open Access
- 19 July 2021
- Published by Springer Nature in Acta Informatica
- Vol. 58 (4) , 281-299
Operational complexity and right linear grammars
For a regular language L, let $${{\,\mathrm{Var}\,}}(L)$$ be the minimal number of nonterminals necessary to generate L by right linear grammars. Moreover, for natural numbers $$k_1,k_2,\ldots ,k_n$$ and an n-ary regularity preserving operation f, let $$g_f^{{{\,\mathrm{Var}\,}}}(k_1,k_2,\ldots ,k_n)$$ be the set of all numbers k such that there are regular languages $$L_1,L_2,\ldots , L_n$$ such that $${{\,\mathrm{Var}\,}}(L_i)=k_i$$ for $$1\le i\le n$$ and $${{\,\mathrm{Var}\,}}(f(L_1,L_2,\ldots , L_n))=k$$ . We completely determine the sets $$g_f^{{{\,\mathrm{Var}\,}}}$$ for the operations reversal, Kleene-closures $$+$$ and $$*$$ , and union; and we give partial results for product and intersection.- 19 July 2021
- Published by Springer Nature in Acta Informatica
- Vol. 58 (4) , 281-299
Open AccessOperational complexity and right linear grammars
For a regular language L, let $${{\,\mathrm{Var}\,}}(L)$$ be the minimal number of nonterminals necessary to generate L by right linear grammars. Moreover, for natural numbers $$k_1,k_2,\ldots ,k_n$$ and an n-ary regularity preserving operation f, let $$g_f^{{{\,\mathrm{Var}\,}}}(k_1,k_2,\ldots ,k_n)$$ be the set of all numbers k such that there are regular languages $$L_1,L_2,\ldots , L_n$$ such that $${{\,\mathrm{Var}\,}}(L_i)=k_i$$ for $$1\le i\le n$$ and $${{\,\mathrm{Var}\,}}(f(L_1,L_2,\ldots , L_n))=k$$ . We completely determine the sets $$g_f^{{{\,\mathrm{Var}\,}}}$$ for the operations reversal, Kleene-closures $$+$$ and $$*$$ , and union; and we give partial results for product and intersection. - Open Access
- 15 May 2021
- Published by Springer Nature in Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry
- Vol. 63 (2) , 321-334
The orbit of closure-involution operations: the case of Boolean functions
For a setAof Boolean functions, a closure operatorcand an involutioni, let $$\mathcal{N}_{c,i}(A)$$ be the number of sets which can be obtained fromAby repeated applications ofcandi. The orbit $$\mathcal{O}(c,i)$$ is defined as the set of all these numbers. We determine the orbits $$\mathcal{O}(S,i)$$ whereSis the closure defined by superposition andiis the complement or the duality. For the negation $${{\,\mathrm{non}\,}}$$ , the orbit $$\mathcal{O}(S,{{\,\mathrm{non}\,}})$$ is almost determined. Especially, we show that the orbit in all these cases contains at most seven numbers. Moreover, we present some closure operators where the orbit with respect to duality and negation is arbitrarily large.- 15 May 2021
- Published by Springer Nature in Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry
- Vol. 63 (2) , 321-334
Open AccessThe orbit of closure-involution operations: the case of Boolean functions
For a setAof Boolean functions, a closure operatorcand an involutioni, let $$\mathcal{N}_{c,i}(A)$$ be the number of sets which can be obtained fromAby repeated applications ofcandi. The orbit $$\mathcal{O}(c,i)$$ is defined as the set of all these numbers. We determine the orbits $$\mathcal{O}(S,i)$$ whereSis the closure defined by superposition andiis the complement or the duality. For the negation $${{\,\mathrm{non}\,}}$$ , the orbit $$\mathcal{O}(S,{{\,\mathrm{non}\,}})$$ is almost determined. Especially, we show that the orbit in all these cases contains at most seven numbers. Moreover, we present some closure operators where the orbit with respect to duality and negation is arbitrarily large. - 19 September 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 30 (06n07) , 959-978
Operational Accepting State Complexity: The Unary and Finite Case
- 19 September 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 30 (06n07) , 959-978
Operational Accepting State Complexity: The Unary and Finite Case