Abstract
We prove that if a D0L language is k-power free then it is circular. By using this result we are able to give an algorithm which decides whether, fixed an integer k ≥ 1, a D0L language is k-power free; we are also able to give a new simpler proof of a result, previously obtained by Ehrenfeucht and Rozenberg, that states that it is decidable whether a D0L language is k-power free for some integer k ≥ 1.
Cite
CITATION STYLE
Mignosi, F., & Séébold, P. (1993). If a D0L language is k-power free then it is circular. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 700 LNCS, pp. 507–518). Springer Verlag. https://doi.org/10.1007/3-540-56939-1_98
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
