Page 1 Next

Displaying 1 – 20 of 229

Showing per page

A Finite Axiomatization of Nondeterministic Regular Expressions

Flavio Corradini, Rocco De Nicola, Anna 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 +.

Accessible set functors are universal

Libor Barto (2019)

Commentationes Mathematicae Universitatis Carolinae

It is shown that every concretizable category can be fully embedded into the category of accessible set functors and natural transformations.

Currently displaying 1 – 20 of 229

Page 1 Next