Thesis supervisor: Benedek Nagy
Location of studies (in Hungarian): Debreceni Egyetem Informatikai Kar Abbreviation of location of studies: DE IK
Description of the research topic:
Formal languages and automata theory are the basics of theoretical computer science. Some parts of the theory are fairly old, but there are several new developments as well (e.g., normal form for regular expressions, 2-head automata for language classes related to linear languages). This topic includes new perspectives of the Chomsky hierarchy, related grammar, language and automata classes. Also there are several new formal models, e.g., automata with translucent letters, that describe new language families.
Bibliography
Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, 3 kötet, Springer, Heidelberg (1997)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Reading MA, 1979.
Dömösi Pál, Falucskai János, Horváth Géza, Mecsei Zoltán, Nagy Benedek: Formális Nyelvek és Automaták, egyetemi jegyzet (Kelet-magyarországi Informatika Tananyag Tárház), 2011.
Herendi Tamás, Nagy Benedek: Parallel approach of algorithms, Typotex, 2014.
Recommended language skills (in Hungarian): angol Number of students who can be accepted: 1
Deadline for application: 2019-01-15
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
Login
