Completing a Code in a Regular Submonoid of the Free Monoid

Jean Neraud. Completing a Code in a Regular Submonoid of the Free Monoid. In Maurice Margenstern, editor, Machines, Computations, and Universality, 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers. Volume 3354 of Lecture Notes in Computer Science, pages 281-291, Springer, 2004. [doi]

@inproceedings{Neraud04,
  title = {Completing a Code in a Regular Submonoid of the Free Monoid},
  author = {Jean Neraud},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3354&spage=281},
  tags = {completeness},
  researchr = {https://researchr.org/publication/Neraud04},
  cites = {0},
  citedby = {0},
  pages = {281-291},
  booktitle = {Machines, Computations, and Universality, 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers},
  editor = {Maurice Margenstern},
  volume = {3354},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-25261-4},
}