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

Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages. - Galina Jirásková; Peter Mlynárcik (DCFS, 2014)

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

Complement on Free and Ideal Languages. - Peter Mlynárcik (DCFS, 2015)

Nondeterministic Complexity of Operations on Closed and Ideal Languages. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (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)

On the Descriptive Complexity of $$ overline{ varSigma ^* overline{L}}$$. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (DLT, 2017)

Nondeterministic Complexity of Operations on Free and Convex Languages. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (CIAA, 2017)

A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Descriptional Complexity of the Forever Operator. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (Int. J. Found. Comput. Sci., 2019)

Nondeterministic complexity in subclasses of convex languages. - Michal Hospodár; Galina Jirásková; Peter Mlynárcik (Theor. Comput. Sci., 2019)

Operations on Permutation Automata. - Michal Hospodár; Peter Mlynárcik (DLT, 2020)

Operations on Subregular Languages and Nondeterministic State Complexity. - Michal Hospodár; Peter Mlynárcik; Viktor Olejár (DCFS, 2022)