Automatic Theorem-Proving in Combinatorics on Words. Goc, D., Henshall, D., & Shallit, J. Int. J. Found. Comput. Sci., 24(6):781–798, 2013.
Automatic Theorem-Proving in Combinatorics on Words [link]Paper  doi  bibtex   
@article{DBLP:journals/ijfcs/GocHS13,
  author    = {Daniel Goc and
               Dane Henshall and
               Jeffrey Shallit},
  title     = {Automatic Theorem-Proving in Combinatorics on Words},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {24},
  number    = {6},
  pages     = {781--798},
  year      = {2013},
  url       = {https://doi.org/10.1142/S0129054113400182},
  doi       = {10.1142/S0129054113400182},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijfcs/GocHS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0