Currently displaying 1 – 6 of 6

Showing per page

Order by Relevance | Title | Year of publication

Preface

Anna Labella — 2002

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A Finite Axiomatization of Nondeterministic Regular Expressions

Flavio CorradiniRocco De NicolaAnna Labella — 2010

RAIRO - Theoretical Informatics and Applications

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 +.

Page 1

Download Results (CSV)