arXiv:1110.4780 [math.CO]AbstractReferencesReviewsResources A proof for the decidability of HD0L ultimate periodicity Ivan Mitrofanov Published 2011-10-21, updated 2012-07-17Version 3 We give a proof for the decidability of the HD0L ultimate periodicity problem. Comments: 33 pages, in Russian Categories: math.CO, math.LO Keywords: decidability, hd0l ultimate periodicity problem Related articles: Most relevant | Search more arXiv:1111.3268 [math.CO] (Published 2011-11-14, updated 2013-01-02) Decidability of the HD0L ultimate periodicity problem Fabien Durand arXiv:2010.01634 [math.CO] (Published 2020-10-04) On decidability of hyperbolicity Zdeněk Dvořák, Luke Postle arXiv:2308.04201 [math.CO] (Published 2023-08-08) Decidability in geometric grid classes of permutations Samuel Braunfeld Links Abstract on arXiv.org View preprint PDF Download TeX source Export citation in BibTeX Save eprint metadata as JSON Toolbox Post your review for this article Attach supplementary resources Edit our extended metadata Share this article on social media FacebookGoogle+LinkedInRedditTwitterVK Scan the QR code for this page
![QR code for arXiv:1110.4780 [math.CO]](http://oss.arxitics.com/images/favicon.svg)