Michal Hospodár

PhD student at the Mathematical Institute of the Slovak Academy of Sciences, branch in Košice; supervisor: Galina Jirásková

Contact:: Matematický ústav
Slovenská akadémia vied
Grešákova 6
040 01 Košice
Slovak Republic
Work tel.: +421 55 6228291
E-mail: hosmich@gmail.com

Curriculum vitae

September 2017 - January 2018: research stay at the University of Giessen (Germany), funded by DAAD; supervisor: Markus Holzer
May 2017: dissertation exam
September 2015: start of PhD study (in cooperation with the Comenius University in Bratislava)
June 2014: achieving Ing. (Master of Science) degree at the Faculty of electrical engineering and informatics, Techical University in Košice
May 2009: leaving secondary education at St. Thomas Aquinas Grammar School, Košice
September 1997: started primary education at Sts. Cyril and Methodius Primary School, Košice
Summer 1993: moved to Košice (Slovak Republic)
March 1991: born in Poprad (Czechoslovakia)

Publications

lists available also at DBLP computer science bibliography and at SAS personal page

Journal papers

Michal Hospodár, Galina Jirásková, Peter Mlynárčik: Nondeterministic complexity in subclasses of convex languages. Theoretical Computer Science, Elsevier (submitted 1 January 2018, accepted 27 December 2018)
- Nondeterministic Complexity of Operations on Closed and Ideal Languages. In: Yo-Sub Han, Kai Salomaa (eds.): Implementation and Application of Automata – 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings. LNCS 9705, Springer, pp. 125–137 (2016) ISBN 978-3-319-40945-0
- Nondeterministic Complexity of Operations on Free and Convex Languages. In: Arnaud Carayol, Cyril Nicaud (eds.): Implementation and Application of Automata – 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings. LNCS 10329, Springer, pp. 138–150 (2017) ISBN 978-3-319-60133-5
Michal Hospodár, Galina Jirásková, Peter Mlynárčik: Descriptional complexity of the forever operator. International Journal of Foundations of Computer Science 30:01, (2019), pp. 115–134, World Scientific
- On the Descriptive Complexity of $$\overline{\varSigma^*\overline{L}}$$. In: Émilie Charlier, Julien Leroy, Michel Rigo (eds.): Developments in Language Theory – 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. LNCS 10396, Springer, pp. 222–234 (2017) ISBN 978-3-319-62808-0
Michal Hospodár, Galina Jirásková: The complexity of concatenation on deterministic and alternating finite automata. RAIRO - Theoretical Informatics and Applications 52 (2018), pp. 153-168, EDP Sciences
- Concatenation on deterministic and alternating automata. In: Henning Bordihn, Rudolf Freund, Benedek Nagy, and György Vaszil (eds.): Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings. books@ocg.at, vol. 321, Wien: Österreichische Computer Gesellschaft, pp. 179–194 (2016) ISBN 978-3-903035-10-2

Conference and workshop papers

Markus Holzer, Michal Hospodár: The Range of State Complexities of Languages Resulting from the Cut Operation. In: Carlos Martín-Vide, Alexander Okhotin, Dana Shapira (eds.): Language and Automata Theory and Applications. 13th International Conference, LATA 2019, Saint Petersburg, Russia, March 26–29, 2019, Proceedings. LNCS 11417, Springer, pp. 190–202 (2019) ISBN 978-3-030-13434-1
- Complexity of languages resulting from the cut operation in the unary case. In: Rudolf Freund, Michal Hospodár, Galina Jirásková, and Giovanni Pighizzini (eds.): Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018. Short Papers. Wien: Institut für Computersprachen TU Wien, pp. 25–34 (2018)
- On the Magic Number Problem of the Cut Operation. Technical Report 1703. Gießen: Justus-Liebeig-Universität (2017) http://www.informatik.uni-giessen.de/reports/Report1703.pdf
Michal Hospodár, Matúš Palmovský: Nondeterministic complexity of power and positive closure on subclasses of convex languages. In: Rudolf Freund, Michal Hospodár, Galina Jirásková, and Giovanni Pighizzini (eds.): Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018. Short Papers. Wien: Institut für Computersprachen TU Wien, pp. 35-44 (2018)
Michal Hospodár, Markus Holzer: The Ranges of Accepting State Complexities of Languages Resulting From Some Operations. In: Cezar Câmpeanu (ed.): Implementation and Application of Automata – 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings. LNCS 10977, Springer, pp. 198–210 (2018) ISBN 978-3-319-94811-9
Michal Hospodár, Galina Jirásková, Ivana Krajňáková: Operations on Boolean and Alternating Automata. In: Fedor V. Fomin, Vladimir V. Podolskii (eds.): Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings. LNCS 10846, Springer, pp. 181–193 (2018) ISBN 978-3-319-90529-7
Michal Hospodár: The Story of Concatenation. In: Černý's Conjecture and Optimization Problems on Finite Automata (proceedings), Opava: Slezská univerzita (submitted September 2017)
- The Story of Concatenation. In: Ján Buša, Jozef Doboš (eds.): 18. Konferencia košických matematikov, Herľany, 20.–22. apríla 2017. Proceedings. Košice: JSMF, PF UPJŠ, FEI TUKE, pp. 20–21 (2017) ISBN 978-80-553-3146-1
Michal Hospodár: Complexity of unary union-free and unary star-free languages. In: Henning Bordihn, Rudolf Freund, Benedek Nagy, and György Vaszil (eds.): Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Short Papers. Wien: Institut für Computersprachen TU Wien, pp. 15–23 (2016) ISBN 978-3-200-04725-9

Other publications

Michal Hospodár, Galina Jirásková, Peter Mlynárčik: A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. In: Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger: Adventures Between Lower Bounds and Higher Altitudes – Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday. LNCS 11011, Springer, pp. 17–32 (2018) ISBN 978-3-319-98354-7

Conferences

CIAA 2016: 21st International Conference on Implementation and Application of Automata, July 19–22, 2016, Seoul, South Korea
accepted paper: Nondeterministic Complexity of Operations on Closed and Ideal Languages
NCMA 2016: 8th Workshop on Non-Classical Models of Automata and Applications, August 29–30, 2016, Debrecen, Hungary (proceedings)
presented papers: Concatenation on deterministic and alternating automata, Complexity of unary union-free and unary star-free languages
Opava 2017: Second Workshop on Černý's Conjecture and Optimization Problems on Finite Automata, May 16–17, 2017, Opava, Czech Republic
presented paper: The Story of Concatenation (not yet published)
CIAA 2017: 22nd International Conference Implementation and Application of Automata, June 27–30, 2017, Marne-la-Vallée, France
accepted paper: Nondeterministic Complexity of Operations on Free and Convex Languages
DCFS 2017: 19th International Conference on Descriptional Complexity of Formal Systems, July 3–5, 2017, Milano, Italy
DLT 2017: 21st International Conference on Developments in Language Theory, August 7–11, 2017, Liège, Belgium
presented paper: On the Descriptive Complexity of $$\overline{\varSigma^*\overline{L}}$$
NCMA 2017: 9th Workshop on Non-Classical Models of Automata and Applications, August 17–18, 2017, Prague, Czech Republic
CSR 2018: 13th International Computer Science Symposium in Russia, June 6–10, 2018, Moscow, Russia
presented paper: Operations on Boolean and Alternating Finite Automata
NCMA 2018: 10th International Workshop on Non-Classical Models of Automata and Applications, August 21–22, 2018, Košice, Slovakia (proceedings)
presented papers: Complexity of languages resulting from the cut operation in the unary case, Nondeterministic complexity of power and positive closure on subclasses of convex languages
DLT 2018's Satellite Workshop: September 5–7, Kyoto, Japan (proceedings of abstracts)
presented papers: the same two as at NCMA 2018
DLT 2018: 22nd International Conference on Developments in Language Theory, September 10–14, 2018, Tokyo, Japan
LATA 2019: 13th International Conference on Language and Automata Theory and Applications, March 26–29, 2019, Saint Petersburg, Russia
presented paper: The Range of State Complexities of Languages Resulting from the Cut Operation
DCFS 2019: 21th International Conference on Descriptional Complexity of Formal Systems, July 17–19, 2019, Košice, Slovakia
CIAA 2019: 24th International Conference Implementation and Application of Automata, July 22–25, 2019, Košice, Slovakia