Searching all approximate covers and their distance using finite automata

Ondrej Guth, Borivoj Melichar, Miroslav Balík. Searching all approximate covers and their distance using finite automata. In Peter Vojtás, editor, Proceedings of the Conference on Theory and Practice of Information Technologies, ITAT 2008, Hrebienok, Slovakia, September 22-26, 2008. Volume 414 of CEUR Workshop Proceedings, CEUR-WS.org, 2008. [doi]

@inproceedings{GuthMB08,
  title = {Searching all approximate covers and their distance using finite automata},
  author = {Ondrej Guth and Borivoj Melichar and Miroslav Balík},
  year = {2008},
  url = {http://ceur-ws.org/Vol-414/paper4.pdf},
  researchr = {https://researchr.org/publication/GuthMB08},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of the Conference on Theory and Practice of Information Technologies, ITAT 2008, Hrebienok, Slovakia, September 22-26, 2008},
  editor = {Peter Vojtás},
  volume = {414},
  series = {CEUR Workshop Proceedings},
  publisher = {CEUR-WS.org},
}