Michal Hospodár

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

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 Engineering) 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
Summer 1993
moved to Košice (Slovak Republic)
March 1991
born in Poprad (Czechoslovakia)

Publications

partial list available at DBLP computer science bibliography

Journal papers

Conference and workshop papers

Other publications


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
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

Fields of scientific interest:
finite automata, descriptional complexity, logic, methods of formalization

Personal interest:
symbols, languages, history, singing, dance