Michal Hospodár

Orcid: 0000-0002-1752-544X

Affiliations:
  • Slovak Academy of Sciences, Mathematical Institute, Košice, Slovakia


According to our database1, Michal Hospodár authored at least 23 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Decision Problems for Subregular Classes.
Proceedings of the Implementation and Application of Automata, 2024

2023
Nondeterministic operational complexity in subregular languages.
Theor. Comput. Sci., September, 2023

The cut operation in subclasses of convex languages.
Theor. Comput. Sci., August, 2023

Operational Complexity in Subregular Classes.
Proceedings of the Implementation and Application of Automata, 2023

Operational Complexity: NFA-to-DFA Trade-Off.
Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022
The Cut Operation in Subclasses of Convex Languages (Extended Abstract).
Proceedings of the Implementation and Application of Automata, 2022

Operations on Subregular Languages and Nondeterministic State Complexity.
Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021
Power, positive closure, and quotients on convex languages.
Theor. Comput. Sci., 2021

2020
Preface.
J. Autom. Lang. Comb., 2020

The Ranges of Accepting State Complexities of Languages Resulting from Some Operations.
Int. J. Found. Comput. Sci., 2020

Operations on Permutation Automata.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019
Nondeterministic complexity in subclasses of convex languages.
Theor. Comput. Sci., 2019

Descriptional Complexity of the Forever Operator.
Int. J. Found. Comput. Sci., 2019

Descriptional Complexity of Power and Positive Closure on Convex Languages.
Proceedings of the Implementation and Application of Automata, 2019

The Range of State Complexities of Languages Resulting from the Cut Operation.
Proceedings of the Language and Automata Theory and Applications, 2019

Square, Power, Positive Closure, and Complementation on Star-Free Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018
The complexity of concatenation on deterministic and alternating finite automata.
RAIRO Theor. Informatics Appl., 2018

Operations on Boolean and Alternating Finite Automata.
Proceedings of the Computer Science - Theory and Applications, 2018

A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017
Nondeterministic Complexity of Operations on Free and Convex Languages.
Proceedings of the Implementation and Application of Automata, 2017

On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016
Nondeterministic Complexity of Operations on Closed and Ideal Languages.
Proceedings of the Implementation and Application of Automata, 2016

Concatenation on deterministic and alternating automata.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016


  Loading...