Back to Search
Start Over
A new proof for the decidability of D0L ultimate periodicity
- Source :
- Electronic Proceedings in Theoretical Computer Science, Vol 63, Iss Proc. WORDS 2011, Pp 147-151 (2011)
- Publication Year :
- 2011
- Publisher :
- Open Publishing Association, 2011.
-
Abstract
- 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.
- Subjects :
- Mathematics
QA1-939
Electronic computers. Computer science
QA75.5-76.95
Subjects
Details
- Language :
- English
- ISSN :
- 20752180
- Volume :
- 63
- Issue :
- Proc. WORDS 2011
- Database :
- Directory of Open Access Journals
- Journal :
- Electronic Proceedings in Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.46f6024985b34c4ba1911ae6cdca254d
- Document Type :
- article
- Full Text :
- https://doi.org/10.4204/EPTCS.63.20