| Autor: |
Vesa Halava, Tero Harju, Tomi Kärki |
| Jazyk: |
angličtina |
| Rok vydání: |
2011 |
| Předmět: |
|
| Zdroj: |
Electronic Proceedings in Theoretical Computer Science, Vol 63, Iss Proc. WORDS 2011, Pp 147-151 (2011) |
| Druh dokumentu: |
article |
| ISSN: |
2075-2180 |
| DOI: |
10.4204/EPTCS.63.20 |
| Popis: |
We give a new proof for the decidability of the D0L ultimate periodicity problem based on the decidability of p-periodicity of morphic words adapted to the approach of Harju and Linna. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
