Mathematical Institute
Topic
Complexity aspects of automata and formal languages
PhD. program
Informatics (PF UPJŠ, Informatics (2508))
Year of admission
2026
Name of the supervisor
Ing. Michal Hospodár, PhD.
Contact:
Receiving school
Faculty of Science, Pavol Jozef Šafárik University Košice
Annotation
In selected models of automata, we examine descriptional complexity of various language operations with additional requirements, such as membership in a specific language class or an upper bound on alphabet size. We also consider the computational complexity of some decision problems related to formal languages and automata.