2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2011★ 1 cited
Square-free Walks on Labelled Graphs
Tero Harju
A finite or infinite word is called a -word for a labelled graph on the vertex set if , where each factor i…
cs.FL2011★ 2 cited
Finite Orbits of Language Operations
E. Charlier, M. Domaratzki, T. Harju +1
We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. T…
cs.DM2003
Periodicity and Unbordered Words: A Proof of the Extended Duval Conjecture
Tero Harju, Dirk Nowotka
The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word b…