Paper Info
Title
If a D0L Language is k-Power Free then it is Circular
Abstract
We prove that if a DOL 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 k1, a DOL 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 DOL language is k-power free for some integer k1.
Year
DOI
Venue
1993
10.1007/3-540-56939-1_98
ICALP
Keywords
Field
DocType
d0l language
Integer,Discrete mathematics,Combinatorics,Computer science,Decidability,Fractional power,Pigeonhole principle
Conference
ISBN
Citations 
PageRank 
3-540-56939-1
22
2.24
References 
Authors
20
2
Name
Order
Citations
PageRank
Filippo Mignosi156999.71
Patrice Séébold214027.23