An Explicit Formula for the Intersection of Two Polynomials of Regular Languages

Jean-Éric Pin. An Explicit Formula for the Intersection of Two Polynomials of Regular Languages. In Marie-Pierre Béal, Olivier Carton, editors, Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings. Volume 7907 of Lecture Notes in Computer Science, pages 31-45, Springer, 2013. [doi]

@inproceedings{Pin13,
  title = {An Explicit Formula for the Intersection of Two Polynomials of Regular Languages},
  author = {Jean-Éric Pin},
  year = {2013},
  doi = {10.1007/978-3-642-38771-5_5},
  url = {http://dx.doi.org/10.1007/978-3-642-38771-5_5},
  researchr = {https://researchr.org/publication/Pin13},
  cites = {0},
  citedby = {0},
  pages = {31-45},
  booktitle = {Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings},
  editor = {Marie-Pierre Béal and Olivier Carton},
  volume = {7907},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-38770-8},
}