Reversal of regular languages and state complexity. - Juraj Sebej (ITAT, 2010)

Note on Reversal of Binary Regular Languages. - Galina Jirásková; Juraj Sebej (DCFS, 2011)

Reversal of binary regular languages. - Galina Jirásková; Juraj Sebej (Theor. Comput. Sci., 2012)

Reversal on Regular Languages and Descriptional Complexity. - Juraj Sebej (DCFS, 2013)

Prefix-Free Languages: Right Quotient and Reversal. - Jozef Jirásek 001; Galina Jirásková; Monika Krausová; Peter Mlynárcik; Juraj Sebej (DCFS, 2014)

Kleene Closure on Regular and Prefix-Free Languages. - Galina Jirásková; Matús Palmovský; Juraj Sebej (CIAA, 2014)

Operations on Automata with All States Final. - Kristína Cevorová; Galina Jirásková; Peter Mlynárcik; Matús Palmovský; Juraj Sebej (AFL, 2014)

Prefix-Free Subsets of Regular Languages and Descriptional Complexity. - Jozef Stefan Jirásek; Juraj Sebej (DCFS, 2015)

Star-Complement-Star on Prefix-Free Languages. - Matús Palmovský; Juraj Sebej (DCFS, 2015)

Kuratowski Algebras Generated by Prefix-Free Languages. - Jozef Jirásek Jr.; Juraj Sebej (CIAA, 2016)

Prefix-free languages: Left and right quotient and reversal. - Jozef Jirásek 001; Galina Jirásková; Monika Krausová; Peter Mlynárcik; Juraj Sebej (Theor. Comput. Sci., 2016)

Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. - Jozef Jirásek Jr.; Matús Palmovský; Juraj Sebej (DCFS, 2017)

The Complexity of Languages Resulting from the Concatenation Operation. - Galina Jirásková; Alexander Szabari; Juraj Sebej (J. Autom. Lang. Comb., 2017)

Operations on Unambiguous Finite Automata. - Jozef Jirásek Jr.; Galina Jirásková; Juraj Sebej (Int. J. Found. Comput. Sci., 2018)

Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. - Stavros Konstantinidis; Mitja Mastnak; Juraj Sebej (CIAA, 2019)

Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation. - Jozef Jirásek Jr.; Matús Palmovský; Juraj Sebej (Int. J. Found. Comput. Sci., 2019)

Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem. - Stavros Konstantinidis; Mitja Mastnak; Juraj Sebej (Int. J. Found. Comput. Sci., 2021)

Operational Complexity: NFA-to-DFA Trade-Off. - Michal Hospodár; Jozef Jirásek 001; Galina Jirásková; Juraj Sebej (DCFS, 2023)

Decision Problems for Subregular Classes. - Michal Hospodár; Viktor Olejár; Juraj Sebej (CIAA, 2024)

On the difference set of two transductions. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis; Juraj Sebej (Theor. Comput. Sci., 2024)

Binary Coded Unary Regular Languages. - Viliam Geffert; Dominika Palisínová; Juraj Sebej (Int. J. Found. Comput. Sci., 2025)