VOLUME 9 2004 NUMBER 1

A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*
Jean Néraud, Carla Selmi
Pages 103–110





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2004-103,
  author  = {Jean N{\'{e}}raud and Carla Selmi},
  title   = {A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of $A^*$},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {9},
  number  = {1},
  pages   = {103--110},
  year    = {2004},
  url     = {https://doi.org/10.25596/jalc-2004-103},
  doi     = {10.25596/jalc-2004-103}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: free monoid, submonoid, unitary, codes, prefix, suffix, bifix, complete, dense, maximal
DOI: 10.25596/jalc-2004-103