Michal Hospodár

According to our database, Michal Hospodár authored at least 22 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Nondeterministic operational complexity in subregular languages.

Michal Hospodár, Viktor Olejár

Theor. Comput. Sci., September, 2023

The cut operation in subclasses of convex languages.

Michal Hospodár, Viktor Olejár

Theor. Comput. Sci., August, 2023

Operational Complexity in Subregular Classes.

Michal Hospodár, Galina Jirásková

Proceedings of the Implementation and Application of Automata, 2023

Operational Complexity: NFA-to-DFA Trade-Off.

Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej

Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022

The Cut Operation in Subclasses of Convex Languages (Extended Abstract).

Michal Hospodár, Viktor Olejár

Proceedings of the Implementation and Application of Automata, 2022

Operations on Subregular Languages and Nondeterministic State Complexity.

Michal Hospodár, Peter Mlynárcik, Viktor Olejár

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021

Power, positive closure, and quotients on convex languages.

Michal Hospodár

Theor. Comput. Sci., 2021

2020

Preface.

Michal Hospodár, Galina Jirásková, Giovanni Pighizzini

J. Autom. Lang. Comb., 2020

The Ranges of Accepting State Complexities of Languages Resulting from Some Operations.

Michal Hospodár, Markus Holzer

Int. J. Found. Comput. Sci., 2020

Operations on Permutation Automata.

Michal Hospodár, Peter Mlynárcik

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019

Nondeterministic complexity in subclasses of convex languages.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Theor. Comput. Sci., 2019

Descriptional Complexity of the Forever Operator.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Int. J. Found. Comput. Sci., 2019

Descriptional Complexity of Power and Positive Closure on Convex Languages.

Michal Hospodár

Proceedings of the Implementation and Application of Automata, 2019

The Range of State Complexities of Languages Resulting from the Cut Operation.

Markus Holzer, Michal Hospodár

Proceedings of the Language and Automata Theory and Applications, 2019

Square, Power, Positive Closure, and Complementation on Star-Free Languages.

Sylvie Davies, Michal Hospodár

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

The complexity of concatenation on deterministic and alternating finite automata.

Michal Hospodár, Galina Jirásková

RAIRO Theor. Informatics Appl., 2018

Operations on Boolean and Alternating Finite Automata.

Michal Hospodár, Galina Jirásková, Ivana Krajnáková

Proceedings of the Computer Science - Theory and Applications, 2018

A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Nondeterministic Complexity of Operations on Free and Convex Languages.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Proceedings of the Implementation and Application of Automata, 2017

On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Nondeterministic Complexity of Operations on Closed and Ideal Languages.

Michal Hospodár, Galina Jirásková, Peter Mlynárcik

Proceedings of the Implementation and Application of Automata, 2016

Concatenation on deterministic and alternating automata.

Michal Hospodár, Galina Jirásková

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016