Michal Hospodár

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 23

Top Topics

Closure Properties

Finite Automata

Regular Languages

Expressive Power

Top Venues

Theor. Comput. Sci.

Int. J. Found. Comput. Sci.

Publications

Michal Hospodár, Viktor Olejár
Nondeterministic operational complexity in subregular languages. Theor. Comput. Sci. 972 (2023)
Michal Hospodár, Galina Jirásková
Operational Complexity in Subregular Classes. CIAA (2023)
Michal Hospodár, Viktor Olejar
The cut operation in subclasses of convex languages. Theor. Comput. Sci. 969 (2023)
Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej
Operational Complexity: NFA-to-DFA Trade-Off. DCFS (2023)
Michal Hospodár, Viktor Olejar
The Cut Operation in Subclasses of Convex Languages (Extended Abstract). CIAA (2022)
Michal Hospodár, Peter Mlynárcik, Viktor Olejar
Operations on Subregular Languages and Nondeterministic State Complexity. DCFS (2022)
Michal Hospodár
Power, positive closure, and quotients on convex languages. Theor. Comput. Sci. 870 (2021)
Michal Hospodár, Markus Holzer
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations. Int. J. Found. Comput. Sci. 31 (8) (2020)
Michal Hospodár, Galina Jirásková, Giovanni Pighizzini
Preface. J. Autom. Lang. Comb. 25 (2-3) (2020)
Michal Hospodár, Peter Mlynárcik
Operations on Permutation Automata. DLT (2020)
Michal Hospodár
Descriptional Complexity of Power and Positive Closure on Convex Languages. CIAA (2019)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Nondeterministic complexity in subclasses of convex languages. Theor. Comput. Sci. 787 (2019)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Descriptional Complexity of the Forever Operator. Int. J. Found. Comput. Sci. 30 (1) (2019)
Sylvie Davies, Michal Hospodár
Square, Power, Positive Closure, and Complementation on Star-Free Languages. DCFS (2019)
Markus Holzer, Michal Hospodár
The Range of State Complexities of Languages Resulting from the Cut Operation. LATA (2019)
Michal Hospodár, Markus Holzer
The Ranges of Accepting State Complexities of Languages Resulting From Some Operations. CIAA (2018)
Michal Hospodár, Galina Jirásková, Ivana Krajnáková
Operations on Boolean and Alternating Finite Automata. CSR (2018)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. Adventures Between Lower Bounds and Higher Altitudes (2018)
Michal Hospodár, Galina Jirásková
The complexity of concatenation on deterministic and alternating finite automata. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$. DLT (2017)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Nondeterministic Complexity of Operations on Free and Convex Languages. CIAA (2017)
Michal Hospodár, Galina Jirásková
Concatenation on deterministic and alternating automata. NCMA (2016)
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
Nondeterministic Complexity of Operations on Closed and Ideal Languages. CIAA (2016)