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 2011 · math.COShow all

1 paper · 2 filters

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…