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