Concatenation on deterministic and alternating automata. - Michal Hospodár; Galina Jirásková (NCMA, 2016)

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

Operations on Boolean and Alternating Finite Automata. - Michal Hospodár; Galina Jirásková; Ivana Krajnáková (CSR, 2018)

The complexity of concatenation on deterministic and alternating finite automata. - Michal Hospodár; Galina Jirásková (RAIRO Theor. Informatics Appl., 2018)

Square, Power, Positive Closure, and Complementation on Star-Free Languages. - Sylvie Davies; Michal Hospodár (DCFS, 2019)

The Range of State Complexities of Languages Resulting from the Cut Operation. - Markus Holzer 001; Michal Hospodár (LATA, 2019)

Descriptional Complexity of Power and Positive Closure on Convex Languages. - Michal Hospodár (CIAA, 2019)

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)

The Ranges of Accepting State Complexities of Languages Resulting from Some Operations. - Michal Hospodár; Markus Holzer 001 (Int. J. Found. Comput. Sci., 2020)

Preface. - Michal Hospodár; Galina Jirásková; Giovanni Pighizzini (J. Autom. Lang. Comb., 2020)

Power, positive closure, and quotients on convex languages. - Michal Hospodár (Theor. Comput. Sci., 2021)

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

The Cut Operation in Subclasses of Convex Languages (Extended Abstract). - Michal Hospodár; Viktor Olejár (CIAA, 2022)

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

Operational Complexity in Subregular Classes. - Michal Hospodár; Galina Jirásková (CIAA, 2023)

The cut operation in subclasses of convex languages. - Michal Hospodár; Viktor Olejár (Theor. Comput. Sci., 2023)

Nondeterministic operational complexity in subregular languages. - Michal Hospodár; Viktor Olejár (Theor. Comput. Sci., 2023)

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

Conversions Between Six Models of Finite Automata. - Michal Hospodár; Galina Jirásková (Int. J. Found. Comput. Sci., 2025)