|
|
|
||
Last update: doc. Mgr. Štěpán Holub, Ph.D. (24.08.2023)
|
|
||
Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (10.06.2019)
Předmět je zakončen ústní zkouškou. |
|
||
Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (22.09.2021)
C. Choffrut and J. Karhumäki, Combinatorics on words, in: Handbook of Formal Languages (G. Rozenberg and A. Salomaa, eds.), vol. I, Springer-Verlag, Berlin Heidelberg 1997, pp. 329-438.
T. Harju and J. Karhumäki, Morphisms, in: Handbook of Formal Languages (G. Rozenberg and A. Salomaa, eds.), vol. I, Springer-Verlag, Berlin Heidelberg 1997, pp. 439-510.
M. Lothaire, Combinatorics on words, Addison-Wesley, Reading Masachusetts, 1983.
M. Lothaire, Algebraic Combinatorics on words, Cambridge University Press, 2002.
J. Berstel and D. Perrin, Theory of Codes, Academic Press, London 1985. |
|
||
Last update: doc. Mgr. Štěpán Holub, Ph.D. (14.02.2018)
The student will draw the exam question from a list of covered topics. The content of the question can be further specified if needed. The answer is oral after a written preparation. |
|
||
Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (22.09.2021)
1. Properties of submonoids of free monoids. Code. Rank of subsemigroup. F-semigroups. 2. Morphisms. Equation and its solution. Systems of equations and equivalent subsystems. Compactness Theorem. ( "Ehrenfeucht's conjecture"). 3. Test sets. Existence of a finite test set. Equivalence with the Compactness Theorem. 4. Post Correspondence Problem (PCP) and its modofications. Binary equality sets and their structure. Regular equality sets. |
|
||
Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (17.05.2019)
Basics of general algebra. |