| Автор | Corradini, Flavio |
| Автор | De Nicola, Rocco |
| Автор | Labella, Anna |
| Дата выпуска | 1999 |
| dc.description | 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 +. |
| Формат | application.pdf |
| Издатель | EDP Sciences |
| Копирайт | © EDP Sciences, 1999 |
| Тема | Semantics |
| Тема | regular expressions |
| Тема | axiomatizations |
| Тема | bisimulation. |
| Название | A Finite Axiomatization of Nondeterministic Regular Expressions |
| Тип | research-article |
| DOI | 10.1051/ita:1999127 |
| Electronic ISSN | 1290-385X |
| Print ISSN | 0988-3754 |
| Журнал | RAIRO - Theoretical Informatics and Applications |
| Том | 33 |
| Первая страница | 447 |
| Последняя страница | 465 |
| Аффилиация | Corradini Flavio; Università dell'Aquila, Dipartimento di Matematica Pura ed Applicata, Via Vetoio, Loc. Coppito, I-67100 L'Aquila, Italy; flavio@univaq.it. |
| Аффилиация | De Nicola Rocco; Università di Firenze, Dipartimento di Sistemi e Informatica, Via C. Lombroso 6/17, 50134 Firenze, Italy; denicola@dsi.unifi.it. |
| Аффилиация | Labella Anna; Università di Roma “La Sapienza”, Dipartimento di Scienze dell'Informazione, Via Salaria 113, 00198 Roma, Italy; labella@dsi.uniroma1.it. |
| Выпуск | 4-5 |
