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(external) |
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
- Square-free words generated by applying permutations to a prefix (2012)
- TUCS Lecture Notes
(A4 Refereed article in a conference publication ) - Square-free words obtained from prefixes by permutations (2012)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Word Problem for deterministic and reversible semi-Thue systems (2012)
- TUCS Publication Series
(D4 Published development or research report or study ) - A new proof for the decidability of D0L ultimate periodicity (2011)
- Electronic Proceedings in Theoretical Computer Science
(A4 Refereed article in a conference publication ) - Directed Overlap-inclusion Graphs as Representations of Ciliate Genes (2011)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - Finite Orbits of Language Operations (2011)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - On the number of frames in binary words (2011)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - The Number of Positions Starting a Square in Binary Words (2011)
- The Electronic Journal of Combinatorics
(A1 Refereed original research article in a scientific journal) - Cyclically repetition-free words on small alphabets (2010)
- Information Processing Letters
(A1 Refereed original research article in a scientific journal) - ON THE NUMBER OF SQUARES IN PARTIAL WORDS (2010)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - On the Periodicity of Morphic Words (2010)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Weinbaum factorizations of primitive words (2010) Diekert V, Harju Tero, Nowotka D
(A1 Refereed original research article in a scientific journal) - On Involutions Arising from Graphs (2009)
- Algorithmic bioprocesses
(A3 Refereed book chapter or chapter in a compilation book) - Overlap-freeness in infinite partial words (2009)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - The theorem of Fine and Wilf for relational periods (2009)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - Defect theorems with compatibility relations (2008)
- Semigroup Forum
(A1 Refereed original research article in a scientific journal) - Interaction properties of relational periods (2008)
- Discrete Mathematics and Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Parallel Complexity of Signed Graphs for Gene Assembly in Ciliates (2008)
- Soft Computing - A Fusion of Foundations, Methodologies and Applications
(A1 Refereed original research article in a scientific journal) - Patterns of Simple Gene Assembly (2008)
- Discrete Applied Mathematics
(A1 Refereed original research article in a scientific journal) - Square-free partial words (2008)
- Information Processing Letters
(A1 Refereed original research article in a scientific journal)