English

Decidability of the HD0L ultimate periodicity problem

Combinatorics 2013-01-03 v3 Formal Languages and Automata Theory

Abstract

In this paper we prove the decidability of the HD0L ultimate periodicity problem.

Cite

@article{arxiv.1111.3268,
  title  = {Decidability of the HD0L ultimate periodicity problem},
  author = {Fabien Durand},
  journal= {arXiv preprint arXiv:1111.3268},
  year   = {2013}
}
R2 v1 2026-06-21T19:35:50.450Z