| Publication | Date of Publication | Type |
|---|
| Simon's congruence pattern matching | 2024-09-11 | Paper |
| Simon's congruence pattern matching | 2024-03-28 | Paper |
| Smaller representation of compiled regular expressions | 2024-02-28 | Paper |
| Automated grading of regular expressions | 2023-11-24 | Paper |
| On the Simon's congruence neighborhood of languages | 2023-11-16 | 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 |
| Efficient enumeration of regular expressions for faster regular expression synthesis | 2022-03-22 | Paper |
| Reachability problems in low-dimensional nondeterministic polynomial maps over integers | 2021-11-25 | Paper |
| On the Identity Problem for the Special Linear Group and the Heisenberg Group. | 2021-07-28 | Paper |
| Consensus string problem for multiple regular languages | 2021-07-21 | Paper |
| Closest substring problems for regular languages | 2021-03-09 | Paper |
| Limited nondeterminism of input-driven pushdown automata: decidability and complexity | 2020-05-12 | Paper |
| The relative edit-distance between two input-driven languages | 2019-10-15 | Paper |
| Alignment distance of regular tree languages | 2019-08-20 | Paper |
| Pseudo-inversion: closure properties and decidability | 2019-07-08 | Paper |
| Reachability problems in nondeterministic polynomial maps on the integers | 2018-11-22 | Paper |
| Closest substring problems for regular languages | 2018-11-22 | Paper |
| Vector Ambiguity and Freeness Problems in SL(2, ℤ) | 2018-10-02 | Paper |
| State Complexity of k-Parallel Tree Concatenation | 2018-01-19 | Paper |
| Alignment distance of regular tree languages | 2017-08-22 | Paper |
| Composition problems for braids: Membership, Identity and Freeness | 2017-07-26 | 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 |
| Vector Ambiguity and Freeness Problems in SL $$(2,\mathbb {Z})$$ | 2017-05-19 | Paper |
| State Complexity of Regular Tree Languages for Tree Matching | 2017-04-06 | Paper |
| Matrix Semigroup Freeness Problems in SL $$(2,\mathbb {Z})$$ | 2017-04-04 | Paper |
| Edit-Distance Between Visibly Pushdown Languages | 2017-04-04 | Paper |
| State Complexity of Insertion | 2017-03-28 | Paper |
| Operational State Complexity of Subtree-Free Regular Tree Languages | 2016-12-14 | 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 |
| Approximate matching between a context-free grammar and a finite-state automaton | 2016-03-10 | Paper |
| State complexity of deletion and bipolar deletion | 2016-02-19 | Paper |
| State complexity of inversion operations | 2015-12-10 | Paper |
| Generalizations of Code Languages with Marginal Errors | 2015-11-10 | Paper |
| Pseudo-inversion on Formal Languages | 2015-09-14 | Paper |
| The State Complexity of Permutations on Finite Languages over Binary Alphabets | 2015-08-07 | Paper |
| State Complexity of Deletion | 2014-10-14 | Paper |
| Left is Better than Right for Reducing Nondeterminism of NFAs | 2014-09-26 | 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 |
| Top-Down Tree Edit-Distance of Regular Tree Languages | 2014-03-31 | 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 |
| A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule | 2011-07-29 | Paper |
