Tero Harju
Professor emeritus
Department of Mathematics and Statistics harju@utu.fi +358 29 450 4305 +358 50 320 7954 Vesilinnantie 5 Turku |
Professor in mathematics
Discrete Mathematics: automata theory, combinatorics on words, graph theory
discrete mathematics, combinatorics on words, graph theory, automata theory,
decidability
- A simple undecidable problem for free groups (2024)
- Theoretical Computer Science
- Decision Problems on Copying and Shuffling (2024)
- Fundamenta Informaticae
- A Note on Squares in Binary Words (2023)
- International Journal of Foundations of Computer Science
- Integer Weighted Automata on Infinite Words (2023)
- International Journal of Foundations of Computer Science
- On bi-infinite and conjugate post correspondence problems (2023)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- Avoiding square-free words on free groups (2022)
- Theoretical Computer Science
- Critical factorisation in square-free words (2022)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- Disposability in square-free words (2021)
- Theoretical Computer Science
- Finite transducers and rational transductions (2021) Handbook of Automata Theory: Volume I. Theoretical Foundations Harju Tero, Karhumäki Juhani
- Integer Weighted Automata on Infinite Words (2021)
- Lecture Notes in Computer Science
- On Shuffling a Word with its Letter-to-Letter Substitution (2020)
- Fundamenta Informaticae
- On the Steps of Emil Post: from Normal Systems to the Correspondence Decision Problem (2020)
- Acta Cybernetica
- On square-free arithmetic progressions in infinite words (2019)
- Theoretical Computer Science
- Some further results on squarefree arithmetic progressions in infinite words (2019)
- Theoretical Computer Science
- On fixed points of rational transductions (2018)
- Theoretical Computer Science
- A new proof for undecidability of the bi-infinite post correspondence problem (2017)
- Fundamenta Informaticae
- Walks on tilings of polygons (2017)
- Theoretical Computer Science
- Weighted automata on infinite words in the context of Attacker-Defender games (2017)
- Information and Computation
- Abelian bordered factors and periodicity (2016)
- European Journal of Combinatorics
- On a question of Hof, Knill and Simon on palindromic substitutive systems (2016)
- Monatshefte für Mathematik