<h3>MA6420 Algebraic Theory of Codes and Automata (modified)</h3>
<br/>
<h4>Course Details</h4>
Automata and words: Descriptional complexity of finite state automaton, local languages, syntactic semigroups, tree automata, words, Fine-Wilf theorem.<br><br>  Codes: Basics of coding, types of codes, test for codes, flower automaton, finite transducers for codes.<br><br>  Shift spaces: Finite and infinite, sofic shifts, entropy, Perron-Frobenius theory, finite state codes, cellular automata, dynamical systems.
<br/>
<h4>Course References:</h4>
Text Books:<br> 
1. J. Berstel, D. Perrin, C. Reutenauer, Codes and Automata, Cambridge University Press, 2010.<br> 
2. D. Lind, B. Marcus, An introduction to Symbolic Dynamics and Coding, Cambridge University Press, 1995.<br><br> 
Reference Books:<br> 
1. M. Ito, Algebraic theory of Automata and Formal Languages, Cambridge University Press, 2004.<br> 
2. M. Lothaire, Combinatorics on Words, Cambridge University Press, 1997.<br> 
3. A. Salomaa, G.Rozenberg, Handbook of Formal Languages (Vol I), Springer, 1997.<br> 
4. J-P. Allouche, J.Shallit, Automatic Sequences, Cambridge University Press, 2003.<br> 
5. S. Ginsberg, Algebraic and Automata-Theoretic Properties of Formal Languages, North Holland Publishing Co., 1975.<br> 
6. R. Tao, Finite Automata and Applications to Cryptography, Springer, 2009.