| Publication | Date of Publication | Type |
|---|
| Benchmarking regular expression matching | 2025-01-20 | Paper |
| Simon's congruence pattern matching | 2024-09-11 | Paper |
| On the decidability of infix inclusion problem | 2024-07-29 | Paper |
| Simon's congruence pattern matching | 2024-03-28 | Paper |
| \(M\)-equivalence of Parikh matrix over a ternary alphabet | 2024-02-28 | Paper |
| Smaller representation of compiled regular expressions | 2024-02-28 | Paper |
| Transcript design problem of oritatami systems | 2024-02-09 | Paper |
| Nondeterministic seedless oritatami systems and hardness of testing their equivalence | 2023-11-30 | Paper |
| Automated grading of regular expressions | 2023-11-24 | Paper |
| Weak inverse neighborhoods of languages | 2023-11-16 | Paper |
| On the Simon's congruence neighborhood of languages | 2023-11-16 | Paper |
| Impossibility of strict assembly of infinite fractals by oritatami | 2023-09-08 | Paper |
| On Simon's congruence closure of a string | 2023-09-07 | Paper |
| Existential and universal width of alternating finite automata | 2023-08-17 | Paper |
| Generalizations of Code Languages with Marginal Errors | 2023-08-15 | Paper |
| Left is Better Than Right for Reducing Nondeterminism of NFAs | 2023-08-15 | Paper |
| Most pseudo-copy languages are not context-free | 2023-03-30 | Paper |
| On Simon's congruence closure of a string | 2023-01-18 | Paper |
| Deciding path size of nondeterministic (and input-driven) pushdown automata | 2022-11-17 | Paper |
| Computing the Shortest String and the Edit-Distance for Parsing Expression Languages | 2022-10-13 | Paper |
| How to settle the ReDoS problem: back to the classical automata theory | 2022-08-16 | Paper |
| On the decidability of infix inclusion problem | 2022-08-11 | Paper |
| Template-based pattern matching in two-dimensional arrays | 2022-05-18 | Paper |
| Consensus string problem for multiple regular languages | 2021-07-21 | Paper |
| A general architecture of oritatami systems for simulating arbitrary finite automata | 2021-06-03 | Paper |
| Closest substring problems for regular languages | 2021-03-09 | Paper |
| Nondeterministic state complexity for suffix-free regular languages | 2021-02-24 | Paper |
| Site-directed insertion: decision problems, maximality and minimality | 2020-06-30 | Paper |
| Limited nondeterminism of input-driven pushdown automata: decidability and complexity | 2020-05-12 | Paper |
| A general architecture of oritatami systems for simulating arbitrary finite automata | 2020-05-06 | Paper |
| Self-attraction removal from oritatami systems | 2019-12-10 | Paper |
| Site-directed insertion: language equations and decision problems | 2019-11-07 | Paper |
| The relative edit-distance between two input-driven languages | 2019-10-15 | Paper |
| Bound-decreasing duplication system | 2019-10-07 | Paper |
| Alignment distance of regular tree languages | 2019-08-20 | Paper |
| Ruleset optimization on isomorphic oritatami systems | 2019-07-31 | Paper |
| Pseudo-inversion: closure properties and decidability | 2019-07-08 | Paper |
| Site-directed deletion | 2018-11-22 | Paper |
| Closest substring problems for regular languages | 2018-11-22 | Paper |
| Transcript design problem of oritatami systems | 2018-11-08 | Paper |
| Construction of geometric structure by oritatami system | 2018-11-08 | Paper |
| Online stochastic pattern matching | 2018-11-07 | Paper |
| Growth rate of minimum branching | 2018-09-17 | Paper |
| Ruleset optimization on isomorphic oritatami systems | 2018-02-02 | Paper |
| State complexity of \(k\)-parallel tree concatenation | 2018-01-19 | Paper |
| Outfix-guided insertion | 2017-12-06 | Paper |
| Pseudoknot-generating operation | 2017-09-28 | Paper |
| Deduplication on finite automata and nested duplication systems | 2017-08-31 | Paper |
| Self-attraction removal from oritatami systems | 2017-08-31 | Paper |
| Ambiguity, nondeterminism and state complexity of finite automata | 2017-08-25 | Paper |
| Alignment distance of regular tree languages | 2017-08-22 | Paper |
| State complexity of permutation on finite languages over a binary alphabet | 2017-06-15 | Paper |
| Consensus string problem for multiple regular languages | 2017-06-01 | Paper |
| State complexity of regular tree languages for tree matching | 2017-04-06 | Paper |
| Edit-distance between visibly pushdown languages | 2017-04-04 | Paper |
| State complexity of insertion | 2017-03-28 | Paper |
| State complexity of basic operations on non-returning regular languages | 2017-03-16 | Paper |
| Operational state complexity of subtree-free regular tree languages | 2016-12-14 | Paper |
| Nondeterministic seedless oritatami systems and hardness of testing their equivalence | 2016-11-30 | Paper |
| Outfix-guided insertion (extended abstract) | 2016-08-30 | Paper |
| State complexity of Kleene-star operations on regular tree languages | 2016-05-03 | Paper |
| Inferring a relax NG schema from XML documents | 2016-04-13 | Paper |
| Frequent pattern mining with non-overlapping inversions | 2016-04-08 | Paper |
| Approximate matching between a context-free grammar and a finite-state automaton | 2016-03-10 | Paper |
| Pseudoknot-generating operation | 2016-03-10 | Paper |
| State complexity of deletion and bipolar deletion | 2016-02-19 | Paper |
| State complexity of boundary of prefix-free regular languages | 2015-12-11 | Paper |
| State complexity of inversion operations | 2015-12-10 | Paper |
| Generalizations of code languages with marginal errors | 2015-11-10 | Paper |
| Non-overlapping inversion on strings and languages | 2015-10-08 | Paper |
| Pseudo-inversion on formal languages | 2015-09-14 | Paper |
| Duplications and pseudo-duplications | 2015-09-14 | Paper |
| The state complexity of permutations on finite languages over binary alphabets | 2015-08-07 | Paper |
| State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages | 2015-07-06 | Paper |
| Alignment with non-overlapping inversions and translocations on two strings | 2015-04-01 | Paper |
| State Complexity of Deletion | 2014-10-14 | Paper |
| Left is better than right for reducing nondeterminism of NFAs | 2014-09-26 | Paper |
| Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time | 2014-09-02 | Paper |
| Decidability of involution hypercodes | 2014-08-26 | Paper |
| State complexity of regular tree languages for tree pattern matching | 2014-08-07 | Paper |
| State complexity of inversion operations | 2014-08-07 | Paper |
| The edit-distance between a regular language and a context-free language | 2014-08-04 | Paper |
| State elimination heuristics for short regular expressions | 2014-04-25 | Paper |
| Top-down tree edit-distance of regular tree languages | 2014-03-31 | Paper |
| An improved prefix-free regular-expression matching | 2014-03-24 | Paper |
| Alignment with non-overlapping inversions on two strings | 2014-02-18 | Paper |
| State complexity of combined operations for suffix-free regular languages | 2014-01-13 | Paper |
| State complexity of \(k\)-union and \(k\)-intersection for prefix-free regular languages | 2013-08-09 | Paper |
| State complexity of basic operations on non-returning regular languages | 2013-08-09 | Paper |
| State complexity of subtree-free regular tree languages | 2013-08-09 | Paper |
| Approximate matching between a context-free grammar and a finite-state automaton | 2013-08-07 | Paper |
| Computing the edit-distance between a regular language and a context-free language | 2012-11-02 | Paper |
| Analysis of a cellular automaton model for car traffic with a junction | 2012-08-09 | Paper |
| Overlap-free languages and solid codes | 2011-10-10 | Paper |
| A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule | 2011-07-29 | Paper |
| Generalized one-unambiguity | 2011-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4929407 | 2010-09-22 | Paper |
| Operational state complexity of prefix-free regular languages | 2010-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396624 | 2009-09-19 | Paper |
| Nondeterministic state complexity of nested word automata | 2009-08-07 | Paper |
| State complexity of basic operations on suffix-free regular languages | 2009-07-10 | Paper |
| Implementation of State Elimination Using Heuristics | 2009-07-09 | Paper |
| Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages | 2009-05-22 | Paper |
| State Complexity of Combined Operations for Prefix-Free Regular Languages | 2009-04-02 | Paper |
| Prime Decompositions of Regular Languages | 2009-03-26 | Paper |
| Infrastructure for Ontological Resource Matching in a Virtual Organization | 2009-03-12 | Paper |
| STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES | 2008-11-24 | Paper |
| Generalizations of 1-deterministic regular languages | 2008-10-08 | Paper |
| State Complexity of Basic Operations on Suffix-Free Regular Languages | 2008-09-17 | Paper |
| Simple regular expressions and languages | 2008-08-12 | Paper |
| Outfix-free regular languages and prime outfix-free decomposition | 2008-03-03 | Paper |
| State Complexity of Union and Intersection of Finite Languages | 2007-11-28 | Paper |
| Overlap-Free Regular Languages | 2007-09-10 | Paper |
| On the existence of prime decompositions | 2007-05-11 | Paper |
| Intercode regular languages | 2007-04-02 | Paper |
| Obtaining shorter regular expressions from finite-state automata | 2007-02-26 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| Theoretical Aspects of Computing – ICTAC 2005 | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA | 2005-08-01 | Paper |
