Approximate Recognition of Non-regular Languages by Finite Automata

Gerry Eisman, Bala Ravikumar. Approximate Recognition of Non-regular Languages by Finite Automata. In Vladimir Estivill-Castro, editor, Computer Science 2005, Twenty-Eighth Australasian Computer Science Conference (ACSC2005), Newcastle, NSW, Australia, January/February 2005. Volume 38 of CRPIT, pages 219-228, Australian Computer Society, 2005. [doi]

@inproceedings{EismanR05,
  title = {Approximate Recognition of Non-regular Languages by Finite Automata},
  author = {Gerry Eisman and Bala Ravikumar},
  year = {2005},
  url = {http://crpit.com/confpapers/CRPITV38Eisman.pdf},
  researchr = {https://researchr.org/publication/EismanR05},
  cites = {0},
  citedby = {0},
  pages = {219-228},
  booktitle = {Computer Science 2005, Twenty-Eighth Australasian Computer Science Conference (ACSC2005), Newcastle, NSW, Australia, January/February 2005},
  editor = {Vladimir Estivill-Castro},
  volume = {38},
  series = {CRPIT},
  publisher = {Australian Computer Society},
  isbn = {1-920682-20-1},
}