Anna Labella
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Anna Labella has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Paolo Bottoni
University of Rome “La Sapienza
2 shared publications - Carlos Martín-Vide
Rovira i Virgili University
1 shared publication - Flavio Corradini
Science and Tecnology, Computer Science Division, University of Camerino
1 shared publication - Gheorghe Păun
Rovira i Virgili University
1 shared publication - Rocco De Nicola
Dipartimento di Sistemi e Informatica, Università di Firenze, Italy
1 shared publication - Victor Mitrana
Polytechnic University of Madrid
1 shared publication
Latest Publications
- 20 December 2004
- Published by Springer Nature in Theory of Computing Systems
- Vol. 39 (4) , 503-524
Superposition Based on Watson–Crick-Like Complementarity
- 20 December 2004
- Published by Springer Nature in Theory of Computing Systems
- Vol. 39 (4) , 503-524
Superposition Based on Watson–Crick-Like Complementarity
- 14 February 2002
- Published by Springer Nature
- p. 325-353
Rewriting P Systems with Conditional Communication
- 14 February 2002
- Published by Springer Nature
- p. 325-353
Rewriting P Systems with Conditional Communication
- Open Access
- 1 July 1999
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 33 (4-5) , 447-465
A Finite Axiomatization of Nondeterministic Regular Expressions
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 +.
- 1 July 1999
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 33 (4-5) , 447-465
Open AccessA Finite Axiomatization of Nondeterministic Regular Expressions
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 +.