| Publication | Date of Publication | Type |
|---|
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
The State Complexity of Lexicographically Smallest Words and Computing Successors
Developments in Language Theory | 2022-10-13 | Paper |
The Cayley semigroup membership problem
Theory of Computing | 2022-05-18 | Paper |
| Automata, palindromes, and reversed subwords | 2022-03-11 | Paper |
Testing Simon's congruence
(available as arXiv preprint) | 2021-08-04 | Paper |
The intersection problem for finite semigroups
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
New bounds on antipowers in words
Information Processing Letters | 2020-10-07 | Paper |
scientific article; zbMATH DE number 7250165 (Why is no real title available?)
(available as arXiv preprint) | 2020-09-22 | Paper |
The intersection problem for finite monoids
(available as arXiv preprint) | 2020-08-05 | Paper |
The complexity of properties of transformation semigroups
International Journal of Algebra and Computation | 2020-04-16 | Paper |
| Words With Few Palindromes, Revisited | 2019-11-27 | Paper |
| Words Avoiding Reversed Factors, Revisited | 2019-11-26 | Paper |
The complexity of weakly recognizing morphisms
RAIRO - Theoretical Informatics and Applications | 2019-07-18 | Paper |
Green's relations in deterministic finite automata
Theory of Computing Systems | 2019-07-04 | Paper |
The intersection problem for finite semigroups
(available as arXiv preprint) | 2018-11-22 | Paper |
Church-Rosser systems, codes with bounded synchronization delay and local Rees extensions
(available as arXiv preprint) | 2017-11-15 | Paper |
The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
Theory of Computing Systems | 2017-10-20 | Paper |
Green's relations in finite transformation semigroups
(available as arXiv preprint) | 2017-08-22 | Paper |
| Green's relations in finite transformation semigroups | 2017-08-22 | Paper |
Efficient algorithms for morphisms over omega-regular languages
(available as arXiv preprint) | 2017-07-13 | Paper |
Operations on weakly recognizing morphisms
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Operations on weakly recognizing morphisms
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Block products and nesting negations in \(\mathrm{FO}^{2}\)
Computer Science - Theory and Applications | 2014-06-24 | Paper |
