Peter Mlynárčik
Narodený v r. 1972 v Košiciach.
Akademické tituly:
1998 – Mgr. na Prírodovedeckej fakulte Univerzity P. J. Šafárika v Košiciach
Štúdium:
Informatika na Prírodovedeckej fakulte Univerzity P. J. Šafárika v Košiciach (ukončené 1998)
Doplňujúce pedagogické štúdium na Žilinskej univerzite (didaktika matematiky, ukončené 2013)
Súčasná pozícia:
doktorand
školiteľ: RNDr. Galina Jirásková, CSc.
Odborná oblasť záujmov:
formálne jazyky, automaty, zložitosť
Publikácie:
- Hospodár, M., Mlynárčik, P.:
Operations on permutation automata.
In: DLT 2020, Tampa, FL, USA. Proceedings.
Lecture Notes in Computer Science, vol. 12086, Springer, pp. 122–136 (2020)
- Hospodár, M., Jirásková, G., Mlynárčik, P.:
Nondeterministic complexity in subclasses of convex languages.
Theoretical Computer Science. Vol. 787, 2019, pp. 89–110.
Preliminárne verzie:
-
Hospodár, M., Jirásková, G., Mlynárčik, P.:
Nondeterministic complexity of operations on free and convex languages.
In: CIAA 2017, Marne-la-Vallée, France. Proceedings.
Lecture Notes in Computer Science, vol. 10329, Springer, pp. 138–150 (2017)
-
Hospodár, M., Jirásková, G., Mlynárčik, P.:
Nondeterministic complexity of operations on closed and ideal languages.
In: CIAA 2016, Seoul, South Korea. Proceedings.
Lecture Notes in Computer Science, vol. 9705, Springer, pp. 125–137 (2016)
-
Mlynárčik, P.:
Complement on free and ideal languages.
In: DCFS 2015, Waterloo, Canada. Proceedings.
Lecture Notes in Computer Science, vol. 9118, Springer, pp. 185–196 (2015)
-
Jirásková, G., Mlynárčik, P.:
Complement on prefix-free, suffix-free, and non-returning NFA languages.
In: DCFS 2014, Turku, Finland. Proceedings.
Lecture Notes in Computer Science, vol. 8614, Springer, pp. 222–233 (2014)
- Hospodár, M., Jirásková, G., Mlynárčik, P.:
Descriptional complexity of the forever operator.
International Journal of Foundation of Computer Sciences. Vol. 30, Issue 1, 2019, pp. 115–134.
Preliminárna verzia:
-
Hospodár, M., Jirásková, G., Mlynárčik, P.:
On the descriptive complexity of $\overline{\varSigma^*\overline{L}}$.
In: DLT 2017, Liège, Belgium. Proceedings.
Lecture Notes in Computer Science, vol. 10396, Springer, pp. 222–234 (2017)
- Hospodár, M., Jirásková, G., Mlynárčik, P.:
A survey on fooling sets as effective tools for lower bounds on nondeterministic complexity.
In: Adventures Between Lower Bounds and Higher Altitudes.
Lecture Notes in Computer Science, vol. 11011, Springer, pp. 17–32 (2018)
- Jirásek, J., Jirásková, G., Krausová, M., Mlynárčik, P., Šebej, J.:
Prefix-free languages: Left and right quotient and reversal.
Theoretical Computer Science. Vol. 610, 2016, pp. 78–90.
Preliminárna verzia:
-
Jirásek J., Jirásková G., Krausová M., Mlynárčik P., Šebej J.:
Prefix-free languages: Right quotient and reversal.
In: DCFS 2014, Turku, Finland. Proceedings.
Lecture Notes in Computer Science, vol. 8614, Springer, pp. 210–221 (2014)
- Čevorová K., Jirásková G., Mlynárčik P., Palmovský M., Šebej J.:
Operations on automata with all states final.
In: Automata and Formal Languages 2014 (AFL 2014).
EPTCS 151, pp. 201–215, doi:10.4204/EPTCS.151.14 (2014)
- Mlynárčik P.:
On average complexity of InsertSort.
ITAT 2005, Information Technologies – Applications and Theory, Proceedings, Slovakia, 117–122 (2005)
Ďalšie zoznamy publikácií:
Záujmy:
logika, filozofia, história, horolezectvo, cyklistika, náboženstvo, cestovanie, turistika, beh,
film, hudba, basketbal, cudzie jazyky