On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based. Aceto, L., Fokkink, W., & Ingólfsdóttir, A. Theor. Comput. Sci., 209(1-2):163–178, 1998.
On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based [link]Paper  doi  bibtex   
@article{DBLP:journals/tcs/AcetoFI98,
  author    = {Luca Aceto and
               Wan Fokkink and
               Anna Ing{\'{o}}lfsd{\'{o}}ttir},
  title     = {On a Question of A. Salomaa: The Equational Theory of Regular Expressions
               Over a Singleton Alphabet is not Finitely Based},
  journal   = {Theor. Comput. Sci.},
  volume    = {209},
  number    = {1-2},
  pages     = {163--178},
  year      = {1998},
  url       = {https://doi.org/10.1016/S0304-3975(97)00104-7},
  doi       = {10.1016/S0304-3975(97)00104-7},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/AcetoFI98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0