Michal Hospodár

31 papers C 11Misc 1Journal 12Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Operational Complexity in Subregular Classes.
Int. J. Found. Comput. Sci.
Michaela Bobenicová, Michal Hospodár, Galina Jirásková
2026 J jnl
Square, power, positive closure, and complementation on ordered and star-free languages.
Theor. Comput. Sci.
Michal Hospodár, Juraj Sebej
2025 J jnl
Conversions Between Six Models of Finite Automata.
Int. J. Found. Comput. Sci.
Michal Hospodár, Galina Jirásková
2025 J jnl
Operational complexity: NFA-to-DFA trade-off.
Inf. Comput.
Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej
2024 C conf
Decision Problems for Subregular Classes.
CIAA
Michal Hospodár, Viktor Olejár, Juraj Sebej
2023 J jnl
Nondeterministic operational complexity in subregular languages.
Theor. Comput. Sci.
Michal Hospodár, Viktor Olejár
2023 C conf
Operational Complexity in Subregular Classes.
CIAA
Michal Hospodár, Galina Jirásková
2023 — conf
Operational Complexity: NFA-to-DFA Trade-Off.
DCFS
Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej
2023 J jnl
The cut operation in subclasses of convex languages.
Theor. Comput. Sci.
Michal Hospodár, Viktor Olejár
2022 — conf
Operations on Subregular Languages and Nondeterministic State Complexity.
DCFS
Michal Hospodár, Peter Mlynárcik, Viktor Olejár
2022 C conf
The Cut Operation in Subclasses of Convex Languages (Extended Abstract).
CIAA
Michal Hospodár, Viktor Olejár
2021 J jnl
Power, positive closure, and quotients on convex languages.
Theor. Comput. Sci.
Michal Hospodár
2020 C conf
Operations on Permutation Automata.
DLT
Michal Hospodár, Peter Mlynárcik
2020 J jnl
Preface.
J. Autom. Lang. Comb.
Michal Hospodár, Galina Jirásková, Giovanni Pighizzini
2020 J jnl
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations.
Int. J. Found. Comput. Sci.
Michal Hospodár, Markus Holzer
2019 — ed.
Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings
DCFS
Michal Hospodár, Galina Jirásková, Stavros Konstantinidis
2019 C conf
Descriptional Complexity of Power and Positive Closure on Convex Languages.
CIAA
Michal Hospodár
2019 J jnl
Descriptional Complexity of the Forever Operator.
Int. J. Found. Comput. Sci.
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2019 C ed.
Implementation and Application of Automata - 24th International Conference, CIAA 2019, Košice, Slovakia, July 22-25, 2019, Proceedings
CIAA
Michal Hospodár, Galina Jirásková
2019 J jnl
Nondeterministic complexity in subclasses of convex languages.
Theor. Comput. Sci.
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2019 — conf
Square, Power, Positive Closure, and Complementation on Star-Free Languages.
DCFS
Sylvie Davies, Michal Hospodár
2019 C conf
The Range of State Complexities of Languages Resulting from the Cut Operation.
LATA
Markus Holzer, Michal Hospodár
2018 — conf
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity.
Adventures Between Lower Bounds and Higher Altitudes
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2018 Misc conf
Operations on Boolean and Alternating Finite Automata.
CSR
Michal Hospodár, Galina Jirásková, Ivana Krajnáková
2018 — ed.
Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018.
NCMA
Rudolf Freund, Michal Hospodár, Galina Jirásková, Giovanni Pighizzini
2018 C conf
The Ranges of Accepting State Complexities of Languages Resulting From Some Operations.
CIAA
Michal Hospodár, Markus Holzer
2018 J jnl
The complexity of concatenation on deterministic and alternating finite automata.
RAIRO Theor. Informatics Appl.
Michal Hospodár, Galina Jirásková
2017 C conf
Nondeterministic Complexity of Operations on Free and Convex Languages.
CIAA
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2017 C conf
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$.
DLT
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2016 — conf
Concatenation on deterministic and alternating automata.
NCMA
Michal Hospodár, Galina Jirásková
2016 C conf
Nondeterministic Complexity of Operations on Closed and Ideal Languages.
CIAA
Michal Hospodár, Galina Jirásková, Peter Mlynárcik