REFERENCES (under construction)

  • [Bal02] V. B. Balakirsky. Block codes for asynchronous data transmission  designed from binary trees. The Computer Journal 45 (2002), 243--248.
  • [BePe85] J. Berstel, D. Perrin. Theory of Codes, Academic Press, Orlando (1985).
  • [ChRe04] Chen, J., Reif, J. (eds): Pre-proceed. 9th International Workshop on DNA-Based Computers, Madison, Wisconsin, 2003. Lecture Notes in Computer Science, Vol. 2943. Springer-Verlag,  Berlin Heidelberg New York (2004) .
  • [GuOd81] L. J. Guibas, A. Odzylko. Periods in strings. Journal of Combinatorial Theory, Series A  30 (1981), 19--42.
  • [HaOh03] Hagiya, M., Ohuchi, A. (eds): Pre-proceed. 8th International Workshop on DNA-Based Computers, Saporo, Japan, 2002. Lecture Notes in Computer Science, Vol. 2568. Springer-Verlag, Berlin Heidelberg New York (2003) .
  • [HeWe93] T. Head, A. Weber. Deciding code related properties by means of finite transducers. Proc. Sequences II, Methods in Communication, Security, and Computer Science, Springer-Verlag, Berlin (1993),  260--272.
  • [JoMa04] N. Jonoska, K. Mahalingam, Languages of DNA based code words. In [ChRe04], pp. 58-68.
  • [JoSe02] Jonoska, N., Seeman, N.C. (eds): Pre-proceed. 7th International Workshop on DNA-Based Computers, Tampa, Florida, 2001. Lecture Notes in Computer Science, Vol. 2340. Springer-Verlag, Berlin Heidelberg New York (2002).
  • [JuYu90] H. Jurgensen, S.S. Yu. Solid codes. Journal of Information Processing and Cybernetics, EIK 26 (1990), 563--574.
  • [KKT02] L. Kari, R. Kitto, G. Thierrin. Codes, involutions and DNA encoding. In W. Brauer, H. Ehrig, J. Karhum\"aki, A. Salomaa (eds.), Lecture Notes in Computer Science 2300, 376—393, 2002.
  • [KaTh96] L. Kari, G. Thierrin, Maximal and minimal solutions to language equations.  Journal of Computer and System Sciences  53 (1996) 487-496.
  • [Lam01] N. H. Lam. Finite maximal solid codes. Theoretical Computer Science 262 (2001), 333--347.
  • [Le66] V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Dokl. 10 (1966), 707-710.
  • [Le70]V. I. Levenshtein. Maximum number of words in codes without overlaps. Problems of Information Transmission 6  (1973), 355--357. Year 1970 in Russian original.
  • [Paz71] A. Paz. Introduction to probabilistic automata. Academic Press, New York and London, 1971.
  • [ShYu90] H.J. Shyr, S.S. Yu. Solid codes and disjunctive domains. Semigroup Forum 41 (1990), 23--37.
  • [Sta72] P. Starke. Abstract automata. North-Holland, Academic Press, 1972.

 

Up: RESERACH ACTIVITIES of Stavros Previous: SOME DEFINITIONS