Efficient Separability of Regular Languages by Subsequences and Suffixes

Wojciech Czerwinski, Wim Martens, Tomás Masopust. Efficient Separability of Regular Languages by Subsequences and Suffixes. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Volume 7966 of Lecture Notes in Computer Science, pages 150-161, Springer, 2013. [doi]

@inproceedings{CzerwinskiMM13,
  title = {Efficient Separability of Regular Languages by Subsequences and Suffixes},
  author = {Wojciech Czerwinski and Wim Martens and Tomás Masopust},
  year = {2013},
  doi = {10.1007/978-3-642-39212-2_16},
  url = {http://dx.doi.org/10.1007/978-3-642-39212-2_16},
  researchr = {https://researchr.org/publication/CzerwinskiMM13},
  cites = {0},
  citedby = {0},
  pages = {150-161},
  booktitle = {Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II},
  editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg},
  volume = {7966},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-39211-5},
}