1. Lecture Notes in Computer Science;A Ambainis,1996
2. Bach, E., Shallit, J.: Algorithmic Number Theory. MIT Press, Cambridge, MA, USA (1996)
3. Lecture Notes in Computer Science;K Balodis,2013
4. Balodis, K., Beriņa, A., Cīpola, K., Dimitrijevs, M., Iraids, J., Jēriņš, K., Kacs, V., Kalējs, J., Krišlauks, R., Lukstiņš, K., Raumanis, R., Scegulnaja, I., Somova, N., Vanaga, A., Freivalds, R.: On the state complexity of ultrametric finite automata. In: SOFSEM 2013: Theory and Practice of Computer Science, vol. 2, pp. 1–9 (2013)
5. Birget, J.C.: Two-way automata and length-preserving homomorphisms. Mathematical Systems Theory 29(3), 191–226 (1996).
http://dx.doi.org/10.1007/BF01201276