| Publication | Date of Publication | Type |
|---|
| When Stars Control a Grammar's Work | 2024-04-09 | Paper |
| Profit parameterizations of \textsc{Dominating Set} | 2024-02-23 | Paper |
| Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1) | 2024-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187048 | 2024-02-05 | Paper |
| Synchronizing deterministic push-down automata can be really hard | 2024-02-02 | Paper |
| Offensive Alliances in Signed Graphs | 2023-12-19 | Paper |
| Investigations on the power of matrix insertion-deletion systems with small sizes | 2023-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6070610 | 2023-11-23 | Paper |
| The space complexity of sum labelling | 2023-10-30 | Paper |
| Recognizing well-dominated graphs is coNP-complete | 2023-10-12 | Paper |
| Parameterizing path partitions | 2023-10-04 | Paper |
| Order Reconfiguration under Width Constraints | 2023-09-20 | Paper |
| Extension of some edge graph problems: standard, parameterized and approximation complexity | 2023-09-14 | Paper |
| Perfect Roman Domination and Unique Response Roman Domination | 2023-09-13 | Paper |
| On the generative capacity of matrix insertion-deletion systems of small sum-norm | 2023-09-08 | Paper |
| Order Reconfiguration Under Width Constraints. | 2023-08-08 | Paper |
| Combinatorial properties and recognition of unit square visibility graphs | 2023-05-12 | Paper |
| Minimal Roman dominating functions: extensions and enumeration | 2023-05-05 | Paper |
| Preface of the special issue dedicated to selected papers from CSR 2020 | 2023-05-02 | Paper |
| Invited talks | 2023-03-22 | Paper |
| Sum Labelling Graphs of Maximum Degree Two | 2023-01-05 | Paper |
| Synchronizing words and monoid factorization: a parameterized perspective | 2022-12-22 | Paper |
| Insertion-deletion systems with substitutions. I | 2022-12-16 | Paper |
| VALENCE GRAMMARS WITH TARGET SETS | 2022-12-06 | Paper |
| Pattern Matching with Variables | 2022-12-05 | Paper |
| Synchronizing words and monoid factorization, yielding a new parameterized complexity class? | 2022-11-17 | Paper |
| Properties of graphs specified by a regular language | 2022-08-30 | Paper |
| Improved descriptional complexity results on generalized forbidding grammars | 2022-08-04 | Paper |
| Semicomputable points in Euclidean spaces | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089200 | 2022-07-18 | Paper |
| The space complexity of sum labelling | 2022-05-20 | Paper |
| Computer science -- theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 -- July 3, 2020. Proceedings | 2022-04-21 | Paper |
| Parsimonious computational completeness | 2022-03-25 | Paper |
| Properties of graphs specified by a regular language | 2022-03-25 | Paper |
| Adding matrix control: insertion-deletion systems with substitutions. III | 2022-03-24 | Paper |
| On the computational completeness of matrix simple semi-conditional grammars | 2022-03-14 | Paper |
| Insertion-deletion systems with substitutions I | 2022-02-28 | Paper |
| On the complexity of solution extension of optimization problems | 2022-02-01 | Paper |
| Synchronizing series-parallel deterministic finite automata with loops and related problems | 2022-01-12 | Paper |
| Generalized forbidding matrix grammars and their membrane computing perspective | 2021-12-01 | Paper |
| Self-Verifying Pushdown and Queue Automata | 2021-11-15 | Paper |
| Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars | 2021-10-25 | Paper |
| On the power of generalized forbidding insertion-deletion systems | 2021-07-14 | Paper |
| Insertion-deletion with substitutions. II | 2021-07-14 | Paper |
| On the complexity of the smallest grammar problem over fixed alphabets | 2021-06-24 | Paper |
| Algorithmic aspects of upper edge domination | 2021-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994948 | 2021-06-22 | Paper |
| Aspects of upper defensive alliances | 2021-05-19 | Paper |
| On matrix ins-del systems of small sum-norm | 2020-10-22 | Paper |
| Universal insertion grammars of size two | 2020-10-13 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2020-09-08 | Paper |
| Parameterized Dynamic Variants of Red-Blue Dominating Set | 2020-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111244 | 2020-05-26 | Paper |
| Domination chain: characterisation, classical complexity, parameterised complexity and approximability | 2020-05-18 | Paper |
| Descriptional complexity of matrix simple semi-conditional grammars | 2020-05-12 | Paper |
| Regulated tree automata | 2020-05-12 | Paper |
| Extension of Vertex Cover and Independent Set in some classes of graphs | 2020-02-06 | Paper |
| Extension of some edge graph problems: standard and parameterized complexity | 2020-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5208373 | 2020-01-15 | Paper |
| Complexity of independency and cliquy trees | 2019-12-30 | Paper |
| Modern aspects of complexity within formal languages | 2019-12-04 | Paper |
| Improved descriptional complexity results on generalized forbidding grammars | 2019-10-10 | Paper |
| Valuations and unambiguity of languages, with applications to fractal geometry | 2019-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4623037 | 2019-02-18 | Paper |
| On path-controlled insertion-deletion systems | 2019-01-25 | Paper |
| On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems | 2018-11-01 | Paper |
| Computational completeness of simple semi-conditional insertion-deletion systems | 2018-10-18 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2018-09-06 | Paper |
| New nonterminal complexity results for semi-conditional grammars | 2018-09-06 | Paper |
| Problems on finite automata and the exponential time hypothesis | 2018-08-20 | Paper |
| The complexity of probabilistic lobbying | 2018-08-17 | Paper |
| Clustering with lower-bounded sizes. A general graph-theoretic framework | 2018-07-26 | Paper |
| Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case | 2018-06-26 | Paper |
| Extremal kernelization: a commemorative paper | 2018-06-15 | Paper |
| Revisiting Shinohara's algorithm for computing descriptive patterns | 2018-06-05 | Paper |
| Simple picture processing based on finite automata and regular grammars | 2018-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636485 | 2018-04-19 | Paper |
| On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes | 2018-03-29 | Paper |
| The many facets of upper domination | 2018-03-13 | Paper |
| Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors | 2018-01-19 | Paper |
| On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results | 2018-01-11 | Paper |
| On the Complexity of Grammar-Based Compression over Fixed Alphabets | 2017-12-19 | Paper |
| Universal matrix insertion grammars with small size | 2017-08-31 | Paper |
| Graph-controlled insertion-deletion systems generating language classes beyond linearity | 2017-08-31 | Paper |
| Computational completeness of path-structured graph-controlled insertion-deletion systems | 2017-08-22 | Paper |
| Characterization and complexity results on jumping finite automata | 2017-06-19 | Paper |
| Contextual array grammars with matrix control, regular control languages, and tissue P systems control | 2017-06-15 | Paper |
| On the computational completeness of graph-controlled insertion-deletion systems with binary sizes | 2017-06-15 | Paper |
| Parikh Images of Matrix Ins-Del Systems | 2017-05-19 | Paper |
| The differential and the roman domination number of a graph | 2017-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963897 | 2017-02-21 | Paper |
| Learning Tree Languages | 2017-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955004 | 2017-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3178873 | 2016-12-20 | Paper |
| Contextual Array Grammars with Matrix and Regular Control | 2016-11-09 | Paper |
| Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems | 2016-11-09 | Paper |
| Algorithmic Aspects of Upper Domination: A Parameterised Perspective | 2016-11-09 | Paper |
| Problems on Finite Automata and the Exponential Time Hypothesis | 2016-11-09 | Paper |
| Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps | 2016-10-24 | Paper |
| Upper Domination: Complexity and Approximation | 2016-09-29 | Paper |
| Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion | 2016-09-28 | Paper |
| On the parameterised complexity of string morphism problems | 2016-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2811818 | 2016-06-10 | Paper |
| The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems | 2016-04-15 | Paper |
| On the Complexity Landscape of the Domination Chain | 2016-03-23 | Paper |
| Scanning Pictures the Boustrophedon Way | 2016-03-10 | Paper |
| Weak total resolvability in graphs | 2016-01-26 | Paper |
| Data reductions and combinatorial bounds for improved approximation algorithms | 2015-12-30 | Paper |
| Polynomial inference of universal automata from membership and equivalence queries | 2015-12-28 | Paper |
| On the partition dimension of unicyclic graphs | 2015-11-09 | Paper |
| Contextual array grammars and array P systems | 2015-10-06 | Paper |
| Kernelization Algorithms for Packing Problems Allowing Overlaps | 2015-09-30 | Paper |
| Jumping Finite Automata: Characterizations and Complexity | 2015-09-23 | Paper |
| Non-isometric Contextual Array Grammars with Regular Control and Local Selectors | 2015-09-15 | Paper |
| Approximation Algorithms Inspired by Kernelization Methods | 2015-09-11 | Paper |
| Computing the metric dimension for chain graphs | 2015-06-02 | Paper |
| Pattern matching with variables: a multivariate complexity analysis | 2015-06-01 | Paper |
| ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS | 2015-04-29 | Paper |
| A survey on alliances and related parameters in graphs | 2015-03-05 | Paper |
| A multi-parameter analysis of hard problems on deterministic finite automata | 2015-02-20 | Paper |
| On the parameterized complexity of vertex cover and edge cover with connectivity constraints | 2014-12-22 | Paper |
| Combinatorics for smaller kernels: the differential of a graph | 2014-12-02 | Paper |
| Kernel(s) for problems with no kernel | 2014-09-09 | Paper |
| Saving on Phases: Parameterized Approximation for Total Vertex Cover | 2014-08-19 | Paper |
| Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results | 2014-06-24 | Paper |
| Computing the differential of a graph: hardness, approximability and exact algorithms | 2014-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5413909 | 2014-05-02 | Paper |
| Packing paths: recycling saves time | 2014-04-16 | Paper |
| Digraphs of bounded elimination width | 2014-04-02 | Paper |
| A novel parameterised approximation algorithm for \textsc{minimum vertex cover} | 2014-01-13 | Paper |
| Array Insertion and Deletion P Systems | 2013-06-28 | Paper |
| Pattern Matching with Variables: A Multivariate Complexity Analysis | 2013-06-14 | Paper |
| Exact exponential-time algorithms for finding bicliques | 2013-04-04 | Paper |
| MAT Learning of Universal Automata | 2013-03-18 | Paper |
| A Multivariate Analysis of Some DFA Problems | 2013-03-18 | Paper |
| Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} | 2013-03-05 | Paper |
| Parameterized measure \& conquer for problems with no small kernels | 2012-11-21 | Paper |
| Cooperating Distributed Tree Automata | 2012-11-01 | Paper |
| Lower bounds on the differential of a graph | 2012-10-26 | Paper |
| An Optimal Construction of Finite Automata from Regular Expressions | 2012-10-19 | Paper |
| Charge and reduce: A fixed-parameter algorithm for string-to-string correction | 2012-10-16 | Paper |
| On families of categorial grammars of bounded value, their learnability and related complexity questions | 2012-10-11 | Paper |
| An exact exponential-time algorithm for the directed maximum leaf spanning tree problem | 2012-09-13 | Paper |
| Parameterized Approximation Algorithms for Hitting Set | 2012-07-16 | Paper |
| Constraint bipartite vertex cover: simpler exact algorithms and implementations | 2012-07-03 | Paper |
| An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} | 2012-04-26 | Paper |
| Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves | 2012-04-24 | Paper |
| An exact algorithm for the maximum leaf spanning tree problem | 2012-01-09 | Paper |
| Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack | 2011-08-23 | Paper |
| Facility location problems: a parameterized view | 2011-08-10 | Paper |
| On the Expressive Power of Valences in Cooperating Distributed Grammar Systems | 2011-06-24 | Paper |
| Ranking and Drawing in Subexponential Time | 2011-05-19 | Paper |
| A new upper bound for Max-2-SAT: A graph-theoretic approach | 2011-01-20 | Paper |
| Parameterized algorithmics for d-H<scp>itting</scp> S<scp>et</scp> | 2011-01-20 | Paper |
| Combining Two Worlds: Parameterised Approximation for Vertex Cover | 2010-12-09 | Paper |
| Enumerate and Measure: Improving Parameter Budget Management | 2010-12-07 | Paper |
| Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG | 2010-09-10 | Paper |
| Comparing trees via crossing minimization | 2010-08-18 | Paper |
| The Curse of Connectivity: t-Total Vertex (Edge) Cover | 2010-07-20 | Paper |
| A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem | 2010-06-22 | Paper |
| A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance | 2010-05-28 | Paper |
| Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach | 2010-05-26 | Paper |
| Minimum dominating set of queens: a trivial programming exercise? | 2010-05-05 | Paper |
| Parameterized algorithms for \(d\)-hitting set: the weighted case | 2010-04-15 | Paper |
| A top-down approach to search-trees: Improved algorithmics for 3-hitting set | 2010-03-04 | Paper |
| A parameterized perspective on packing paths of length two | 2010-02-24 | Paper |
| PROGRAMMED GRAMMARS WITH RULE QUEUES | 2010-01-29 | Paper |
| An Amortized Search Tree Analysis for k-Leaf Spanning Tree | 2010-01-28 | Paper |
| Exact and Parameterized Algorithms for Max Internal Spanning Tree | 2010-01-21 | Paper |
| An Exact Algorithm for the Maximum Leaf Spanning Tree Problem | 2010-01-14 | Paper |
| The Complexity of Probabilistic Lobbying | 2009-11-17 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| On the complement graph and defensive \(k\)-alliances | 2009-06-24 | Paper |
| Vertex and edge covers with clustering properties: Complexity and algorithms | 2009-06-24 | Paper |
| Searching Trees: An Essay | 2009-06-03 | Paper |
| Algorithms for learning regular expressions from positive data | 2009-04-16 | Paper |
| A simultaneous reduction of several measures of descriptional complexity in scattered context grammars | 2009-03-23 | Paper |
| Parameterized algorithmics for linear arrangement problems | 2009-03-04 | Paper |
| Offensive \(r\)-alliances in graphs | 2009-03-04 | Paper |
| A bounded search tree algorithm for parameterized face cover | 2009-02-23 | Paper |
| A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach | 2009-02-03 | Paper |
| Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees | 2009-01-29 | Paper |
| A Parameterized Perspective on Packing Paths of Length Two | 2009-01-27 | Paper |
| Comparison of some descriptional complexities of 0L systems obtained by a unifying approach | 2008-10-08 | Paper |
| Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size | 2008-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517093 | 2008-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517098 | 2008-08-12 | Paper |
| Fixed parameter algorithms for one-sided crossing minimization revisited | 2008-08-08 | Paper |
| Learning tree languages from text | 2008-07-21 | Paper |
| Facility Location Problems: A Parameterized View | 2008-07-10 | Paper |
| Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations | 2008-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3505884 | 2008-06-11 | Paper |
| edge dominating set: Efficient Enumeration-Based Exact Algorithms | 2008-06-03 | Paper |
| Kernels: Annotated, Proper and Induced | 2008-06-03 | Paper |
| Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs | 2008-03-25 | Paper |
| A sum labelling for the generalised friendship graph | 2008-02-14 | Paper |
| R<scp>OMAN DOMINATION</scp>: a parameterized perspective† | 2008-01-28 | Paper |
| Decidability of code properties | 2007-11-14 | Paper |
| Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs | 2007-05-29 | Paper |
| Speeding up Exact Algorithms With High Probability | 2007-05-29 | Paper |
| Parameterized Algorithms for Hitting Set: The Weighted Case | 2007-05-02 | Paper |
| Iterated sequential transducers as language generating devices | 2007-01-09 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Grammatical Inference: Algorithms and Applications | 2006-10-20 | Paper |
| Grammatical Inference: Algorithms and Applications | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485990 | 2006-09-06 | Paper |
| Two-Layer Planarization: Improving on Parameterized Algorithmics | 2006-04-03 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| A refined search tree technique for dominating set on planar graphs | 2005-12-07 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3022293 | 2005-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662829 | 2005-03-30 | Paper |
| Parameterized complexity: exponential speed-up for planar graph problems | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820785 | 2004-10-01 | Paper |
| Graph separators: A parameterized view | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808679 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808928 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046703 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737915 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473235 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473988 | 2004-08-04 | Paper |
| Identifying terminal distinguishable languages | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4465334 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4458489 | 2004-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453201 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440389 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437814 | 2003-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436354 | 2003-12-04 | Paper |
| Parallel grammars: A phenomenology | 2003-08-25 | Paper |
| Identification of function distinguishable languages. | 2003-08-17 | Paper |
| On the degree of scattered context-sensitivity. | 2003-08-17 | Paper |
| Nonterminal complexity of programmed grammars. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414496 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708960 | 2003-07-09 | Paper |
| Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\) | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797430 | 2003-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4793127 | 2003-02-18 | Paper |
| Even linear simple matrix languages: formal language properties and grammatical inference. | 2003-01-21 | Paper |
| Iterated function systems and control languages | 2003-01-14 | Paper |
| Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782113 | 2002-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779138 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780338 | 2002-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551370 | 2002-09-05 | Paper |
| Sequential grammars and automata with valences | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535799 | 2002-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530000 | 2002-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770675 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729666 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754003 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2752145 | 2001-10-21 | Paper |
| Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization | 2001-08-20 | Paper |
| Parallel communicating grammar systems with terminal transmission | 2001-08-20 | Paper |
| An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover | 2001-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721971 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520334 | 2001-02-26 | Paper |
| Regulated grammars under leftmost derivation | 2001-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939577 | 2000-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939195 | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941917 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942050 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939202 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699300 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218152 | 1999-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247680 | 1999-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226188 | 1999-01-24 | Paper |
| Remarks on regulated limited ET0L systems and regulated context-free grammars | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375812 | 1998-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365821 | 1998-02-26 | Paper |
| Unconditional transfer in regulated rewriting | 1997-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3125181 | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3125170 | 1997-03-16 | Paper |
| A note on uniformly limited ET0L systems with unique interpretation | 1997-02-28 | Paper |
| Valuations of languages, with applications to fractal geometry | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886795 | 1996-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864465 | 1996-06-27 | Paper |
| Valuations, regular expressions, and fractal geometry | 1996-06-24 | Paper |
| Remarks on accepting parallel systems | 1996-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858934 | 1996-05-27 | Paper |
| Accepting grammars with regulation | 1995-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840161 | 1995-07-20 | Paper |
| Infinite Iterated Function Systems | 1995-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4306890 | 1994-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210189 | 1991-01-01 | Paper |
