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 
4 of 19
- A note on square-free shuffles of words (2013)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Composition and orbits of language operations: finiteness and upper bounds (2013)
- International Journal of Computer Mathematics
(A1 Refereed original research article in a scientific journal) - New proof for the undecidability of the circular PCP (2013)
- Acta Informatica
(A1 Refereed original research article in a scientific journal) - On n-permutation Post Correspondence Problem (2013) Vesa Halava, Tero Harju, Mari Huova
(D4 Published development or research report or study ) - Computational gene assembly in ciliates (2012) Brijder Robert, Daley Mark, Harju Tero, Jonoska Natasha, Petre Ion, Rozenberg Grzegorz
(A3 Refereed book chapter or chapter in a compilation book) - Computational Nature of Gene Assembly in Ciliates (2012) Handbook of Natural Computing, volume 2 (Molecular Computation) Brijder Robert, Harju Tero, Jonoska Natasha, Petre Ion, Rozenberg Grzegorz
(B2 Non-refereed book chapter or chapter in a compilation book) - Kuratowski closure operations on languages (2012)
- TUCS Lecture Notes
(B3 Non-refereed article in a conference publication) - New Proof for the Undecidability of the Circular PCP (2012)
- TUCS Publication Series
(D4 Published development or research report or study ) - Pivots, determinants, and perfect matchings of graphs (2012)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Simple gene assembly as a rewriting of directed overlap-inclusion graphs (2012)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal)
Turun yliopiston Tutkimustietojärjestelmän portaali