| Автор | Aceto, Luca |
| Автор | Ésik, Zoltán |
| Автор | Ingólfsdóttir, Anna |
| Дата выпуска | 2002 |
| dc.description | We show that the validity of Parikh's theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of μ-term equations of continuous commutative idempotent semirings. |
| Формат | application.pdf |
| Издатель | EDP Sciences |
| Копирайт | © EDP Sciences, 2002 |
| Тема | Parikh's theorem |
| Тема | commutative context-free languages |
| Тема | commutative rational languages |
| Тема | equational logic |
| Тема | varieties |
| Тема | complete axiomatizations |
| Тема | commutative idempotent semirings |
| Тема | algebraically complete commutative idempotent semi rings. |
| Название | A Fully Equational Proof of Parikh's Theorem |
| Тип | research-article |
| DOI | 10.1051/ita:2002007 |
| Electronic ISSN | 1290-385X |
| Print ISSN | 0988-3754 |
| Журнал | RAIRO - Theoretical Informatics and Applications |
| Том | 36 |
| Первая страница | 129 |
| Последняя страница | 153 |
| Аффилиация | Aceto Luca; (asic esearch in omputer cience, Centre of the Danish National Research Foundation), Department of Computer Science, Aalborg University, Fr. Bajersvej 7E, 9220 Aalborg Ø, Denmark; luca@cs.auc.dk. |
| Аффилиация | Ésik Zoltán; Department of Computer Science, University of Szeged, P.O. Box 652, 6701 Szeged, Hungary. |
| Аффилиация | Ingólfsdóttir Anna; (asic esearch in omputer cience, Centre of the Danish National Research Foundation), Department of Computer Science, Aalborg University, Fr. Bajersvej 7E, 9220 Aalborg Ø, Denmark; luca@cs.auc.dk. |
| Выпуск | 2 |
