pith. sign in

arxiv: 1111.3268 · v3 · pith:2QKB2MCMnew · submitted 2011-11-14 · 🧮 math.CO · cs.FL

Decidability of the HD0L ultimate periodicity problem

classification 🧮 math.CO cs.FL
keywords decidabilityhd0lperiodicityproblemultimateprove
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.