TY  - JOUR
EP  - 466
N1  - Mathematics Subject Classification:

    68Q55;
    68Q68;
    08B05
ID  - eprints344
UR  - http://dx.doi.org/10.1051/ita:1999127
TI  - A finite axiomatization of nondeterministic regular expressions
AV  - none
KW  -     Semantics;
    regular expressions;
    axiomatizations;
    bisimulation.
N2  - An alternative (tree-based) semantics for a class of regular expressions is proposed that assigns a central rô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 +. 
VL  - 33
JF  - RAIRO - Theoretical Informatics and Applications
IS  - 4/5
Y1  - 1999///
SP  - 447
A1  - Corradini, Flavio
A1  - De Nicola, Rocco
A1  - Labella, Anna
PB  - Cambridge University Press
ER  -