| Publication | Date of Publication | Type |
|---|
Square, power, positive closure, and complementation on ordered and star-free languages
Theoretical Computer Science | 2026-01-14 | Paper |
Operational complexity: NFA-to-DFA trade-off
Information and Computation | 2025-12-15 | Paper |
| Decision problems for subregular classes | 2025-01-20 | Paper |
On the difference set of two transductions
Theoretical Computer Science | 2024-10-07 | Paper |
Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
| Operations on automata with all states final | 2021-06-22 | Paper |
Operations on automata with all states final
(available as arXiv preprint) | 2021-06-22 | Paper |
Partitioning a symmetric rational relation into two asymmetric rational relations
(available as arXiv preprint) | 2020-05-06 | Paper |
Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Operations on Unambiguous Finite Automata
International Journal of Foundations of Computer Science | 2018-09-20 | Paper |
| The complexity of languages resulting from the concatenation operation | 2018-03-29 | Paper |
| Kuratowski algebras generated by factor-, subword-, and suffix-free languages | 2017-08-31 | Paper |
The Complexity of Languages Resulting from the Concatenation Operation
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Kuratowski algebras generated by prefix-free languages
Implementation and Application of Automata | 2016-11-09 | Paper |
Operations on Unambiguous Finite Automata
Developments in Language Theory | 2016-08-30 | Paper |
Star-complement-star on prefix-free languages
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
Prefix-free subsets of regular languages and descriptional complexity
Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
Kleene Closure on Regular and Prefix-Free Languages
Implementation and Application of Automata | 2014-09-26 | Paper |
Reversal on regular languages and descriptional complexity
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
Reversal of binary regular languages
Theoretical Computer Science | 2012-08-13 | Paper |
Note on reversal of binary regular languages
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
