References
- Davey , M. C. and MacKay , D. J.C. 2001 . Reliable communication over channels with insertions, deletions, and substitutions . IEEE Trans. Info. Theory , 47 : 687 – 698 .
- Konstantinidis , S. 2002 . Transducers and the properties of error-detection, error-correction and finite-delay decodability . J. Univers. Comput. Sci. , 8 : 278 – 291 .
- Mohri , M. 2003 . Edit-distance of weighted automata: general definitions and algorithms . Int. J. Found. Comput. Sci. , 14 ( 6 ) : 957 – 982 .
- Paz , A. 1971 . Introduction to Probabilistic Automata , New York and London : Academic Press .
- Rozenberg , G. and Salomaa , A. 1997 . Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. I , Berlin : Springer-Verlag .
- Shannon , C. and Weaver , W. 1971 . The Mathematical Theory of Communication , 12 , Urbana, Chicago, London : University of Illinois Press .
- Starke , P. 1972 . Abstract Automata , North-Holland, Academic Press .
- Wood , D. 1987 . Theory of Computation , New York : John Wiley & Sons, Inc .
- Xu , J. 2004 . “ Formalizations of error models with applications to spelling error correction ” . Canada : Department of Mathematics and Computing Science, Saint Mary's University . MSc thesis
- Yu , S. 1997 . “ Regular languages ” . In Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. I , 41 – 110 . Berlin : Springer-Verlag .
- Zigangirov , K. S. 1969 . Sequential decoding for a binary channel with drop-outs and insertions . Probl. Pered. Inform. , 5 : 23 – 30 .