EDBT 2026 Demo / reviewers in the wild / expert
Michal Hospodár
dblp:182/6122
· DBLP profile ↗
18ranked-venue papers
16as first author
10since 2021 · last 2026
0000-0002-1752-544XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 18 · 16 first-author · 10 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | The ranges of state and accepting state complexities for the cut operation
Markus Holzer 0001, Michal Hospodár |
Theor. Comput. Sci. | 2 |
| 2026 | Language membership problems for subregular classes
Michal Hospodár, Viktor Olejár, Juraj Sebej |
Theor. Comput. Sci. | 1 |
| 2026 | Square, power, positive closure, and complementation on ordered and star-free languages
Michal Hospodár, Juraj Sebej |
Theor. Comput. Sci. | 1 |
| 2025 | Operational complexity: NFA-to-DFA trade-off
Michal Hospodár, Jozef Jirásek 0001, Galina Jirásková, Juraj Sebej |
Inf. Comput. | 1 |
| 2024 | Decision Problems for Subregular Classes
Michal Hospodár, Viktor Olejár, Juraj Sebej |
CIAA | 1 |
| 2023 | Operational Complexity in Subregular Classes
Michal Hospodár, Galina Jirásková |
CIAA | 1 |
| 2023 | The cut operation in subclasses of convex languages
Michal Hospodár, Viktor Olejár |
Theor. Comput. Sci. | 1 |
| 2023 | Nondeterministic operational complexity in subregular languages
Michal Hospodár, Viktor Olejár |
Theor. Comput. Sci. | 1 |
| 2022 | The Cut Operation in Subclasses of Convex Languages (Extended Abstract)
Michal Hospodár, Viktor Olejár |
CIAA | 1 |
| 2021 | Power, positive closure, and quotients on convex languages
Michal Hospodár |
Theor. Comput. Sci. | 1 |
| 2020 | Operations on Permutation Automata
Michal Hospodár, Peter Mlynárcik |
DLT | 1 |
| 2019 | The Range of State Complexities of Languages Resulting from the Cut Operation
Markus Holzer 0001, Michal Hospodár |
LATA | 2 |
| 2019 | Descriptional Complexity of Power and Positive Closure on Convex Languages
Michal Hospodár |
CIAA | 1 |
| 2019 | Nondeterministic complexity in subclasses of convex languages
Michal Hospodár, Galina Jirásková, Peter Mlynárcik |
Theor. Comput. Sci. | 1 |
| 2018 | The Ranges of Accepting State Complexities of Languages Resulting From Some Operations
Michal Hospodár, Markus Holzer 0001 |
CIAA | 1 |
| 2017 | On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$
Michal Hospodár, Galina Jirásková, Peter Mlynárcik |
DLT | 1 |
| 2017 | Nondeterministic Complexity of Operations on Free and Convex Languages
Michal Hospodár, Galina Jirásková, Peter Mlynárcik |
CIAA | 1 |
| 2016 | Nondeterministic Complexity of Operations on Closed and Ideal Languages
Michal Hospodár, Galina Jirásková, Peter Mlynárcik |
CIAA | 1 |