39
Views
1
CrossRef citations to date
0
Altmetric
Section A

On implementing recognizable transductions

, &
Pages 260-277 | Received 27 Feb 2007, Accepted 07 Jan 2008, Published online: 22 Aug 2008

References

  • Berstel , J. 1979 . “ Transductions and Context-Free Languages, B. G. Teubner ” . Stuttgart : Teubner Studienbucher: Informatik .
  • Eilenberg , S. 1974 . “ Automata, Languages and Machines, vol. A ” . New York and London : Academic Press .
  • Elgot , C. C. and Mezei , J. E. 1965 . On relations defined by generalized finite automata . IBM J. Res. Dev , 9 : 47 – 68 .
  • Hopcroft , J. E. and Ullman , J. D. 1979 . “ Introduction to Automata Theory, Languages and Computation ” . In , 1s , Boston, MA : Addison-Wesley Publishing Company, Inc .
  • Howie , J. M. 1976 . “ An Introduction to Semigroup Theory ” . New York and London : Academic Press .
  • Kari , L. and Konstantinidis , S. Descriptional complexity of error/edit systems . Pre-Proceedings of Descriptional Complexity of Formal Systems 2002 . London, Canada. Edited by: Dassow , J. , Hoeberechts , M. , Jürgensen , H. and Wotschke , D. pp. 133 – 147 . J. Autom. Lang. Combin. 9 (2/3) (2004), 293–309
  • Kari , L. , Konstantinidis , S. , Perron , S. , Wozniak , G. and Xu , J. 2003 . “ Finite-state error/edit-systems and difference-measures for languages and words ” . In Tech. Rep. TR 2003-01 , 10 Canada : Department of Mathematics and Computing Science, Saint Mary's University .
  • Konstantinidis , S. Computing the Levenshtein distance of a regular language . Proceedings of IEEE Information Theory Workshop on Coding and Complexity . August to September 29 to 1 , Rotorua, New Zealand. pp. 113 – 116 . Computing the edit distance of a regular language, Inf. Comput. 205 (2007), 1307–1316
  • Levenshtein , V. I. 1966 . Binary codes capable of correcting deletions, insertions, and reversals . Soviet Phys. Dokl , 10 ( 8 ) : 707 – 710 .
  • McKnight , J. D. Jr . 1964 . Kleene quotient theorems . Pac. J. Math , 14 : 1343 – 1352 .
  • Mohri , M. 2003 . Edit-distance of weighted automata: general definitions and algorithms . Int. J. Found. Comput. Sci , 14 ( 6 ) : 957 – 982 .
  • Sankoff , D. and Kruskal , J. 1999 . “ Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison ” . Edited by: Sankoff , D. and Kruskal , J. Stanford, California : CSLI Publications .
  • Yu , S. 1997 . “ Regular languages, in Handbook of Formal Languages ” . Edited by: Salomaa , A. and Rozenberg , G. Vol. 1, chapter 2 , 41 – 110 . Springer Verlag .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.