• DocumentCode
    2203298
  • Title

    The equivalence problem for regular expressions over one letter is elementary

  • Author

    Rangel, Jose Lucas

  • fYear
    1974
  • fDate
    14-16 Oct. 1974
  • Firstpage
    24
  • Lastpage
    27
  • Abstract
    This paper proves a conjecture of Meyer and Stockmeyer, that the equivalence problem of regular expressions over one letter alphabets, with the operations of union, concatenation, Kleene star, negation and squaring, is solvable in elementary time and space. This is done by reduction of this problem to Presburger Arithmetic, making use of an algorithm presented by Oppen.
  • Keywords
    Arithmetic; Brazil Council; Scholarships;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Switching and Automata Theory, 1974., IEEE Conference Record of 15th Annual Symposium on
  • Conference_Location
    USA
  • ISSN
    0272-4847
  • Type

    conf

  • DOI
    10.1109/SWAT.1974.27
  • Filename
    4569754
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2203298