T. Harju

activity

20032023

most citedTighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More

16 citations · 31 across the 15 of their papers we have counts for

collaborators

Showing 2011Show all

3 papers · 1 filter

cs.FL2011★ 2 cited

A new proof for the decidability of D0L ultimate periodicity

Vesa Halava, Tero Harju, Tomi 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 Li…

math.CO2011★ 1 cited

Square-free Walks on Labelled Graphs

Tero Harju

A finite or infinite word is called a $G$ -word for a labelled graph $G$ on the vertex set $A_{n} = {0, 1, ..., n - 1}$ if $w = i_{1} i_{2} ... i_{k} \in A_{n}^{*}$ , where each factor $i_{j} i_{j + 1}$ 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…