Decidability of the HD0L ultimate periodicity problem

Abstract

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

References in corpus (2)

• A proof for the decidability of HD0L ultimate periodicity
• HD0L-$\omega$-equivalence and periodicity problems in the primitive case (to the memory of G. Rauzy)

Cited by in corpus (1)

• Breadth-first serialisation of trees and rational languages