@article{eprints344,
          volume = {33},
          number = {4/5},
           pages = {447--466},
           title = {A finite axiomatization of nondeterministic regular expressions},
            year = {1999},
       publisher = {Cambridge University Press},
            note = {Mathematics Subject Classification:

    68Q55;
    68Q68;
    08B05},
         journal = {RAIRO - Theoretical Informatics and Applications},
          author = {Flavio Corradini and Rocco De Nicola and Anna Labella},
             url = {http://eprints.imtlucca.it/344/},
        abstract = {An alternative (tree-based) semantics for a class of regular expressions is proposed that assigns a central r{\^o}le to the + operator and thus to nondeterminism and nondeterministic choice. For the new semantics a consistent and complete axiomatization is obtained from the original axiomatization of regular expressions by Salomaa and by Kozen by dropping the idempotence law for + and the distribution law of ? over +. },
        keywords = {    Semantics;
    regular expressions;
    axiomatizations;
    bisimulation.}
}