eprintid: 344
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/44
datestamp: 2011-06-09 09:45:20
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-09 09:45:20
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Corradini, Flavio
creators_name: De Nicola, Rocco
creators_name: Labella, Anna
creators_id: 
creators_id: r.denicola@imtlucca.it
creators_id: 
title: A finite axiomatization of nondeterministic regular expressions
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords:     Semantics;
    regular expressions;
    axiomatizations;
    bisimulation.
note: Mathematics Subject Classification:

    68Q55;
    68Q68;
    08B05
abstract: 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 +. 
date: 1999
date_type: published
publication: RAIRO - Theoretical Informatics and Applications
volume: 33
number: 4/5
publisher: Cambridge University Press
pagerange: 447-466
id_number: 10.1051/ita:1999127
refereed: TRUE
official_url: http://dx.doi.org/10.1051/ita:1999127
citation:   Corradini, Flavio and De Nicola, Rocco and Labella, Anna  A finite axiomatization of nondeterministic regular expressions.  RAIRO - Theoretical Informatics and Applications, 33 (4/5).  pp. 447-466.       (1999)