Research/art/teacher profile of a person
- The name of the university:
- Pavol Jozef Šafárik University in Košice
- The seat of the university:
- Šrobárova 2, 041 80 Košice
- The name of the faculty:
- Faculty of Science
- The seat of the faculty:
- Šrobárova 2, 040 01 Košice
I. - Basic information
I.1 - Surname
I.2 - Name
I.3 - Degrees
I.4 - Year of birth
I.5 - Name of the workplace
I.6 - Address of the workplace
I.7 - Position
I.8 - E-mail address
I.9 - Hyperlink to the entry of a person in the Register of university staff
I.10 - Name of the study field in which a person works at the university
I.11 - ORCID iD
II. - Higher education and further qualification growth
II.1 - First degree of higher education
II.a - Name of the university or institution
II.b - Year
II.c - Study field and programme
II.2 - Second degree of higher education
II.a - Name of the university or institution
II.b - Year
II.c - Study field and programme
II.3 - Third degree of higher education
II.a - Name of the university or institution
II.b - Year
II.c - Study field and programme
II.4 - Associate professor
II.5 - Professor
II.6 - Doctor of Science (DrSc.)
III. - Current and previous employment
| III.a - Occupation-position | III.b - Institution | III.c - Duration |
|---|---|---|
| Assistant Professor | Pavol Jozef Šafárik University in Košice, Faculty of Science, Institute of Computer Science | 2016-2021 |
| Assistant Professor | Pavol Jozef Šafárik University in Košice, Faculty of Science, Institute of Computer Science | 2021- |
IV. - Development of pedagogical, professional, language, digital and other skills
V. - Overview of activities within the teaching career at the university
V.1 - Overview of the profile courses taught in the current academic year according to study programmes
| V.1.a - Name of the profile course | V.1.b - Study programme | V.1.c - Degree | V.1.d - Field of study |
|---|---|---|---|
| ÚINF/PAZ1a/15 - Programming, algorithms, and complexity | Computer Science, Applied Informatics, Joint degree study of Informatics and other subject, Data Analysis and Artificial Intelligence, Mathematics, Economic and Financial Mathematics | Bachelor | Computer Science |
| ÚINF/PAZ1b/15 - Programming, algorithms, and complexity | Computer Science, Applied Informatics, Joint degree study of Informatics and other subject, Data Analysis and Artificial Intelligence, Mathematics, Economic and Financial Mathematics | Bachelor | Computer Science |
V.2 - Overview of the responsibility for the delivery, development and quality assurance of the study programme or its part at the university in the current academic year
V.3 - Overview of the responsibility for the development and quality of the field of habilitation procedure and inaugural procedure in the current academic year
V.4 - Overview of supervised final theses
V.4.1 - Number of currently supervised theses
V.4.a - Bachelor's (first degree)
V.4.b - Diploma (second degree)
V.4.c - Dissertation (third degree)
V.4.2 - Number of defended theses
V.4.a - Bachelor's (first degree)
V.4.b - Diploma (second degree)
V.4.c - Dissertation (third degree)
V.5 - Overview of other courses taught in the current academic year according to study programmes
| V.5.a - Name of the course | V.5.b - Study programme | V.5.c - Degree | V.5.d - Field of study |
|---|---|---|---|
| ÚINF/PAZ1a/15 - Programming, algorithms, and complexity | Computer Science, Applied Informatics, Joint degree study of Informatics and other subject, Data Analysis and Artificial Intelligence, Mathematics, Economic and Financial Mathematics | Bachelor | Computer Science |
| ÚINF/PAZ1b/15 - Programming, algorithms, and complexity | Computer Science, Applied Informatics, Joint degree study of Informatics and other subject, Data Analysis and Artificial Intelligence, Mathematics, Economic and Financial Mathematics | Bachelor | Computer Science |
VI. - Overview of the research/artistic/other outputs
VI.1 - Overview of the research/artistic/other outputs and the corresponding citations
VI.1.1 - Number of the research/artistic/other outputs
VI.1.a - Overall
VI.1.b - Over the last six years
VI.1.2 - Number of the research/artistic/other outputs registered in the Web of Science or Scopus databases
VI.1.a - Overall
VI.1.b - Over the last six years
VI.1.3 - Number of citations corresponding to the research/artistic/other outputs
VI.1.a - Overall
VI.1.b - Over the last six years
VI.1.4 - Number of citations registered in the Web of Science or Scopus databases
VI.1.a - Overall
VI.1.b - Over the last six years
VI.1.5 - Number of invited lectures at the international, national level
VI.1.a - Overall
VI.1.b - Over the last six years
VI.2 - The most significant research/artistic/other outputs
Galina Jirásková, Juraj Sebej: Reversal of binary regular languages. Theor. Comput. Sci. 449: 85-92 (2012)
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej: Prefix-free languages: Left and right quotient and reversal. Theor. Comput. Sci. 610: 78-90 (2016)
Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej: Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. DCFS 2017: 189-201 (2017)
Galina Jirásková, Alexander Szabari, Juraj Sebej: The Complexity of Languages Resulting from the Concatenation Operation. J. Autom. Lang. Comb. 22(1-3): 123-143 (2017)
Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej: Operations on Unambiguous Finite Automata. Int. J. Found. Comput. Sci. 29(5): 861-876 (2018)
VI.3 - The most significant research/artistic/other outputs over the last six years
Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej: Prefix-free languages: Left and right quotient and reversal. Theor. Comput. Sci. 610: 78-90 (2016)
Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej: Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. DCFS 2017: 189-201 (2017)
Galina Jirásková, Alexander Szabari, Juraj Sebej: The Complexity of Languages Resulting from the Concatenation Operation. J. Autom. Lang. Comb. 22(1-3): 123-143 (2017)
Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej: Operations on Unambiguous Finite Automata. Int. J. Found. Comput. Sci. 29(5): 861-876 (2018)
Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej: Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation. Int. J. Found. Comput. Sci. 30(6-7): 1091-1115 (2019)
VI.4 - The most significant citations corresponding to the research/artistic/other outputs
Hae-Sung Eom, Yo-Sub Han, Kai Salomaa: State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. Int. J. Found. Comput. Sci. 26(2): 211-228 (2015)
Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa: State complexity of inversion operations. Theor. Comput. Sci. 610: 2-12 (2016)
Alexander Okhotin, Kai Salomaa: State complexity of operations on input-driven pushdown automata. J. Comput. Syst. Sci. 86: 207-228 (2017)
Yo-Sub Han, Arto Salomaa, Kai Salomaa: Ambiguity, Nondeterminism and State Complexity of Finite Automata. Acta Cybern. 23(1): 141-157 (2017)
Janusz A. Brzozowski, Sylvie Davies: Most Complex Non-Returning Regular Languages. Int. J. Found. Comput. Sci. 30(6-7): 921-957 (2019)