Skip to main content

Mgr. Peter Mlynarčik, PhD.

Mgr. Peter MlynárčikPhD.

O mne


Personal information:
Born: 1972 in Košice,
Academic degrees:
1998 – Mgr. at Faculty of Science, University of P. J. Safarik in Kosice
2017 – PhD. at Faculty of Mathematics, Physics and Informatics, Comenius University in Bratislava and Mathematical institute of Slovak academy of sciences[Supervisor: RNDr. Galina Jirásková, CSc. ]
Studies:
1986 – 1990: Grammar school, Kováčska 28 in Košice
1990 – 1998: Computer science at Faculty of Science, University of P. J. Šafárik in Košice
2011 – 2013: Didactics of mathematics at University of Žilina
2013 – 2017: PhD study in Applied mathematics at Faculty of Mathematics, Physics and Informatics, Comenius University in Bratislava and Mathematical institute of Slovak academy of sciences
Career:
1997 – 2000: System administrator in Centrum of Applied Informatics, at Faculty of Science, University of P. J. Šafárik in Košice
2001 – 2002: Software engineer, at Institute of computer technology at University of P. J. Šafárik in Košice
2003 – 2010: University teacher, Institute of informatics at Faculty of Science, University of P. J. Šafárik in Košice
2010 – 2012: Teacher of mathematics, The Lutheran grammar school of John Amos Commenius, Škultétyho 10, 04001 Košice
2013 – 2017: Internal PhD student, Mathematical institute of Slovak academy of science and Faculty of Mathematics, Physics and Informatics, Comenius University in Bratislava
2017 – currently: University teacher, Department of mathematics and theoretical informatics, Faculty of electrical engineering and informatics, Technical university in Košice
Fields of research interests:
formal languages, automata, complexity
Other interests:
logic, philosophy, history, climbing , cycling, religion, traveling, hiking, running, movies, music, basketball, languages

Kontakt

miestnosť: 603A e-mail: Peter.Mlynarcik@tuke.sk
telefón: +421 55 602 2445 www:

Konzultačné hodiny

deň: Wednesday čas: 13:30 - 15:30 (alebo dohodou)

Čo učím

prednášam:
cvičím:

Prílohy


Oznamy


Výskum


formal languages, automata, complexity, nondeterminism, synchronizing automata, Cerny's conjecture ,

(Mainly attending) Conferences:

Publikácie


1. Conference papers
(a) Mlynárčik,P.: On average complexity of InsertSort. ITAT 2005, Information Technologies - Applications and Theory, Proceedings, Slovakia, 117-122
(b) Č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
(c) 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)
Cited in: Yuan Gao and Nelma Moreira and Rogério Reis and Sheng Yu: A Survey on Operational State Complexity. CoRR, abs/1509.03254, (2015), http://arxiv.org/abs/1509.03254
(d) 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)
Cited in: i.) Yuan Gao and Nelma Moreira and Rogério Reis and Sheng Yu: A Survey on Operational State Complexity. CoRR, abs/1509.03254, (2015), http://arxiv.org/abs/1509.03254
ii.) 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. Computersprachen TU Wien, pp. 15-23 (2016) ISBN 978-3-200-04725-9
(e) Mlynárčik,P.: Complement on Free and Ideal Languages. In: Shallit, Okhotin (Eds.): DCFS 2015, LNCS 9118, pp. 185-196. Springer International Publishing Switzerland (2015)
(f) Hospodár, M., Jirásková, G., and Mlynárčik, P.: Nondeterministic Complexity of Operations on Closed and Ideal Languages. In: Han YS., Salomaa K. (Eds.):
Implementation and Application of Automata. CIAA 2016. LNCS 9705, pp.125-137. Springer (2016)
(g) Hospodár, M., Jirásková, G., and Mlynárčik, P.: Nondeterministic Complexity of Operations on Free and Convex Languages. In: Carayol A., Nicaud C. (Eds.): Implementation and Application of Automata. CIAA 2017. LNCS 10329, pp. 138-150. Springer (2017)
(h) Hospodár, M., Jirásková, G., and Mlynárčik, P.: On the Descriptive Complexity of Σ ∗ L. In: Charlier, É., Leroy, J., Rigo, M. (Eds.): Developments in Language Theory. DLT 2017. LNCS 10396, pp. 222-234. Springer (2017)
2.) Journal papers
(a) Jirásek, J., Jirásková, G., Krausová, M., Mlynárčik, P., Šebej, J.: Prefix-free languages: Left and right quotient and reversal. (2014) Theoretical Computer Science
3.) The number of citations: 3

Drupal theme by Adaptivethemes - Design by Kodamera