Peter Mlynárčik

Born 1972 in Košice.

Academic degrees:
1998 – Mgr. at Faculty of Science, University of P. J. Safarik in Kosice

Studies:
Computer Science at University of P. J. Safarik in Kosice, Faculty of Natural Sciences, finished 1998

Current position:
PhD student; supervisor: Galina Jirásková

Fields of interest:

formal languages, automata, complexity

Publications:

• Mlynárčik P., On average complexity of InsertSort. ITAT 2005, Information Technologies – Applications and Theory, Proceedings, Slovakia, 117–122.
• Čevorová K., Jirásková G., Mlynárčik P., Palmovský M., Šebej J., Operations on Automata with All States Final. Z. Ésik and Z. Fülöp (Eds.): Automata and Formal Languages 2014 (AFL 2014) EPTCS 151, 2014, pp. 201–215, doi:10.4204/EPTCS.151.14
• Jirásek J., Jirásková G., Krausová M., Mlynárčik P., Šebej J., Prefix-Free Languages: Right Quotient and Reversal. In: H. Jürgensen et al. (Eds.): DCFS 2014, LNCS 8614, pp. 210–221. Springer International Publishing Switzerland (2014)
• Jirásková G., Mlynárčik P., Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages. In: H. Jürgensen et al. (Eds.): DCFS 2014, LNCS 8614, pp. 222–233. Springer International Publishing Switzerland (2014)
• Mlynárčik P., Complement on Free and Ideal Languages. Accepted at DCFS 2015.

Personal interests:
logic, philosophy, history, climbing, cycling, religion, traveling, hiking, running, movies, music, basketball, languages