pith. sign in

arxiv: 1110.4780 · v3 · pith:RUNWGD44new · submitted 2011-10-21 · 🧮 math.CO · math.LO

A proof for the decidability of HD0L ultimate periodicity

classification 🧮 math.CO math.LO
keywords decidabilityhd0lperiodicityproofultimategiveproblem
0
0 comments X
read the original abstract

We give a proof for 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.