加载中…
2011-08-18
A new proof for the decidability of D0L ultimate periodicity
Vesa HalavaTero HarjuTomi Kärki
文献摘要
We give a new proof for the decidability of the D0L ultimate periodicity problem based on the decidability of p-periodicity of morphic words adapted to the approach of Harju and Linna.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本