Thesis supervisor: Pál Béla Dömösi
Location of studies (in Hungarian): Debreceni Egyetem Informatikai Kar Abbreviation of location of studies: DE IK
Description of the research topic:
Combinatorial properties of words and languages. Iteration lemmas. Bounded and palindromic languages. The language of primitive words. Kászonyi-Katsura Theory. Decidability and complexity. Connection of automata and languages. Automata and automata mappings. Compositions and complete systems of automata. Automata networks as products of automata. Compositions and complete systems of automata . Automata networks as products of automata. Krohn-Rhodes theory. Letichevskiis criterion. Primitive product and temporal product. State-homogenous automata networks. Asynchronous automata networks
Bibliography
1. Dömösi Pál, Falucskai János, Horváth Géza, Mecsei Zoltán, Nagy Benedek: Formális nyelvek és automaták. TAMOP 4.2.5 Pályázat könyvei, Debrecen, 2011. http://www.tankonyvtar.hu/en/tartalom/tamop425/0046_formalis_nyelvek_es_automatak/adatok.html
2. Pál Dömösi and Masami Ito: Context-free languages and primitive words. World Scientific, NJ, London, Singapore, etc. 2015, ISBN 978-9814271660.
3. Dömösi, Pál; Nehaniv, Chrystopher, L.: Algebraic theory of automata networks. An introduction., SIAM, Philadelphia, 2005, ISBN 0-89871-569-5
4. J. E. Hopcroft, R. Motwani, J. D. Ullman: Introduction to Automata Theory, Languages, and Computation. 3rd ed., Pearson Education Ltd. London, 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
