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 
8 of 10
- Tutorial on DNA computing and graph transformation - Computational nature of gene assembly in ciliates (2002)
- Lecture Notes in Computer Science
(A2 Refereed review article in a scientific journal ) - Decision questions concerning semilinearity, morphisms, and commutation of languages (2001)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - Mortality in matrix semigroups (2001)
- American Mathematical Monthly
(A1 Refereed original research article in a scientific journal) - Complexity issues in switching of graphs (2000)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - Generalized post correspondence problem for marked morphisms (2000)
- International Journal of Algebra and Computation
(A1 Refereed original research article in a scientific journal) - Pancyclicity in switching classes (2000)
- Information Processing Letters
(A1 Refereed original research article in a scientific journal) - Periods and binary words (2000)
- Journal of Combinatorial Theory, Series A
(A1 Refereed original research article in a scientific journal) - The size of switching classes with skew gains (2000)
- Discrete Mathematics
(A1 Refereed original research article in a scientific journal) - Generalized PCP is decidable for marked morphisms (1999)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - On the undecidability of freeness of matrix semigroups (1999)
- International Journal of Algebra and Computation
(A1 Refereed original research article in a scientific journal) - Undecidability of the equivalence of finite substitutions on regular language (1999)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - Acyclicity of switching classes (1998)
- European Journal of Combinatorics
(A1 Refereed original research article in a scientific journal) - On quasi orders of words and the confluence property (1998)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Permutations, parenthesis words, and Schroder numbers (1998)
- Discrete Mathematics
(A1 Refereed original research article in a scientific journal) - Shuffle on trajectories: The Schutzenberger product and related operations (1998)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - A note on decidability questions on presentations of word semigroups (1997)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Compactness of systems of equations on completely regular semigroups (1997)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - Languages obtained from infinite words (1997)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - On a geometric problem of zigzags (1997)
- Information Processing Letters
(A1 Refereed original research article in a scientific journal) - Characterization and complexity of uniformly nonprimitive labeled 2-structures (1996)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal)
UTU Research Portal