| Publication | Date of Publication | Type |
|---|
| Constructing a BPE tokenization DFA | 2025-01-20 | Paper |
| Benchmarking regular expression matching | 2025-01-20 | Paper |
Re-examining regular expressions with backreferences
Theoretical Computer Science | 2023-04-20 | Paper |
| Ordered context-free grammars | 2022-08-16 | Paper |
| Memoized regular expressions | 2022-03-22 | Paper |
| Analyzing catastrophic backtracking behavior in practical regular expression matching | 2021-06-22 | Paper |
Analyzing catastrophic backtracking behavior in practical regular expression matching
(available as arXiv preprint) | 2021-06-22 | Paper |
Formalising and implementing Boost POSIX regular expression matching
Theoretical Computer Science | 2021-01-25 | Paper |
| Formalising Boost POSIX regular expression matching | 2018-11-23 | Paper |
| The output size problem for string-to-tree transducers | 2018-09-17 | Paper |
Tight bounds for cut-operations on deterministic finite automata
Fundamenta Informaticae | 2018-01-19 | Paper |
| On the semantics of atomic subgroups in practical regular expressions | 2017-08-22 | Paper |
On the semantics of regular expression parsing in the wild
Theoretical Computer Science | 2017-06-19 | Paper |
Lower bound methods for the size of nondeterministic finite automata revisited
Language and Automata Theory and Applications | 2017-06-01 | Paper |
Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
Implementation and Application of Automata | 2016-11-09 | Paper |
On the semantics of regular expression parsing in the wild
Implementation and Application of Automata | 2015-09-23 | Paper |
Tight bounds for cut-operations on deterministic finite automata
Lecture Notes in Computer Science | 2015-09-15 | Paper |
| Minimal weighted automata over the Galois field with two elements | 2014-07-10 | Paper |
Graph transformation for incremental natural language analysis
Theoretical Computer Science | 2014-03-28 | Paper |
Cuts in regular expressions
Developments in Language Theory | 2013-06-28 | Paper |
Counting Minimal Symmetric Difference NFAs
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Minimal DFA for symmetric difference NFA
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
Ambiguity of unary symmetric difference NFAs
Theoretical Aspects of Computing – ICTAC 2011 | 2012-01-06 | Paper |
The near-ring of Lipschitz functions on a metric space
International Journal of Mathematics and Mathematical Sciences | 2010-09-28 | Paper |
Bag Context Tree Grammars
Developments in Language Theory | 2009-03-26 | Paper |
| Bag context tree grammars | 2009-02-12 | Paper |
Ducci-sequences and cyclotomic polynomials
Finite Fields and their Applications | 2008-09-25 | Paper |
| scientific article; zbMATH DE number 5251101 (Why is no real title available?) | 2008-03-19 | Paper |
Unique addition modules
Communications in Algebra | 2000-10-03 | Paper |
