Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids

Kosaburo Hashiguchi, Naoto Sakakibara, Shuji Jimbo. Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids. Theoretical Computer Science, 312(2-3):251-266, 2004. [doi]

@article{HashiguchiSJ04,
  title = {Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids},
  author = {Kosaburo Hashiguchi and Naoto Sakakibara and Shuji Jimbo},
  year = {2004},
  doi = {10.1016/j.tcs.2003.09.005},
  url = {http://dx.doi.org/10.1016/j.tcs.2003.09.005},
  researchr = {https://researchr.org/publication/HashiguchiSJ04},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {312},
  number = {2-3},
  pages = {251-266},
}