| Publication | Date of Publication | Type |
|---|
Operational complexity in subregular classes
International Journal of Foundations of Computer Science | 2026-02-17 | Paper |
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 |
Conversions between six models of finite automata
International Journal of Foundations of Computer Science | 2025-04-30 | Paper |
| Decision problems for subregular classes | 2025-01-20 | Paper |
Operational complexity in subregular classes
Implementation and Application of Automata | 2024-02-28 | Paper |
Nondeterministic operational complexity in subregular languages
Theoretical Computer Science | 2023-09-07 | Paper |
The cut operation in subclasses of convex languages
Theoretical Computer Science | 2023-08-01 | Paper |
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
| Operations on subregular languages and nondeterministic state complexity | 2023-01-18 | Paper |
Operations on Permutation Automata
Developments in Language Theory | 2022-10-13 | Paper |
| The cut operation in subclasses of convex languages (extended abstract) | 2022-08-16 | Paper |
Power, positive closure, and quotients on convex languages
Theoretical Computer Science | 2021-06-03 | Paper |
The ranges of accepting state complexities of languages resulting from some operations
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
| Square, power, positive closure, and complementation on star-free languages | 2020-05-12 | Paper |
| Descriptional complexity of power and positive closure on convex languages | 2020-05-06 | Paper |
| The range of state complexities of languages resulting from the cut operation | 2019-12-04 | Paper |
Nondeterministic complexity in subclasses of convex languages
Theoretical Computer Science | 2019-08-20 | Paper |
The complexity of concatenation on deterministic and alternating finite automata
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Descriptional complexity of the forever operator
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
| Operations on Boolean and alternating finite automata | 2018-11-28 | Paper |
| The ranges of accepting state complexities of languages resulting from some operations | 2018-11-07 | Paper |
| On the descriptive complexity of \(\overline{\varSigma ^*\overline{L}}\) | 2017-10-13 | Paper |
| Nondeterministic complexity of operations on free and convex languages | 2017-08-22 | Paper |
Nondeterministic complexity of operations on closed and ideal languages
Implementation and Application of Automata | 2016-11-09 | Paper |
