| Автор | Ilie, Lucian |
| Автор | Rozenberg, Grzegorz |
| Автор | Salomaa, Arto |
| Дата выпуска | 2000 |
| dc.description | For a non-negative integer k, we say that a language L is k-poly-slender if the number of words of length n in L is of order ${\cal O}(n^k)$. We give a precise characterization of the k-poly-slender context-free languages. The well-known characterization of the k-poly-slender regular languages is an immediate consequence of ours. |
| Формат | application.pdf |
| Издатель | EDP Sciences |
| Копирайт | © EDP Sciences, 2000 |
| Тема | Context-free language |
| Тема | poly-slender language |
| Тема | Dyck loop. |
| Название | A characterization of poly-slender context-free languages |
| Тип | research-article |
| DOI | 10.1051/ita:2000100 |
| Electronic ISSN | 1290-385X |
| Print ISSN | 0988-3754 |
| Журнал | RAIRO - Theoretical Informatics and Applications |
| Том | 34 |
| Первая страница | 77 |
| Последняя страница | 86 |
| Аффилиация | Ilie Lucian; Turku Centre for Computer Science TUCS, 20520 Turku, Finland.; Research supported by the Academy of Finland, Project 137358. On leave of absence from Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109 Bucharest, Romania. |
| Аффилиация | Rozenberg Grzegorz; Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands and Department of Computer Science, University of Colorado at Boulder, Boulder, CO 80309, U.S.A. |
| Аффилиация | Salomaa Arto; Turku Centre for Computer Science TUCS, 20520 Turku, Finland.Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands and Department of Computer Science, University of Colorado at Boulder, Boulder, CO 80309, U.S.A. |
| Выпуск | 1 |
