VOLUME 25 2020 NUMBER 1

Every Regular Bifix Code is a Finite Union of Regular Infix Codes
Stavros Konstantinidis
Pages 55–59





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2020-055,
  author  = {Stavros Konstantinidis},
  title   = {Every Regular Bifix Code is a Finite Union of Regular Infix Codes},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {25},
  number  = {1},
  pages   = {55--59},
  year    = {2020},
  url     = {https://doi.org/10.25596/jalc-2020-055},
  doi     = {10.25596/jalc-2020-055}
}
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: regular language, bifix code, infix code
DOI: 10.25596/jalc-2020-055