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
9 of 10
- Flatwords and post correspondence problem (1996)
- Theoretical Computer Science
- Compactness of systems of equations in semigroups (1995)
- Lecture Notes in Computer Science
- Theory of 2-structures (1995)
- Lecture Notes in Computer Science
- INCREMENTAL CONSTRUCTION OF 2-STRUCTURES (1994)
- Discrete Mathematics
- REPRESENTATION OF RATIONAL FUNCTIONS WITH PREFIX AND SUFFIX CODINGS (1994)
- Theoretical Computer Science
- THE INTERSECTION PROBLEM FOR ALPHABETIC VECTOR MONOIDS (1994)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- PERMUTABLE TRANSFORMATION SEMIGROUPS (1993)
- Semigroup Forum
- COMPOSITIONAL REPRESENTATION OF RATIONAL FUNCTIONS (1992)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- DETERMINISTIC SEQUENTIAL FUNCTIONS (1992)
- Acta Informatica
- DECIDABILITY PROBLEMS FOR UNARY OUTPUT SEQUENTIAL TRANSDUCERS (1991)
- Discrete Applied Mathematics
- SPLICING SEMIGROUPS OF DOMINOES AND DNA (1991)
- Discrete Applied Mathematics
- THE EQUIVALENCE PROBLEM OF MULTITAPE FINITE AUTOMATA (1991)
- Theoretical Computer Science
- DECIDABILITY OF THE MULTIPLICITY EQUIVALENCE OF MULTITAPE FINITE AUTOMATA (1990) Proc. 22nd ACM Symp. on Theory of Comput. HARJU T, KARHUMAKI J
- CARDINALITY PROBLEMS OF COMPOSITIONS OF MORPHISMS AND INVERSE MORPHISMS (1989)
- Mathematical systems theory
- DOMINOES AND THE REGULARITY OF DNA SPLICING LANGUAGES (1989)
- Lecture Notes in Computer Science
- ON MORPHIC GENERATION OF REGULAR LANGUAGES (1986)
- Discrete Applied Mathematics
- ON THE DEFECT THEOREM AND SIMPLIFIABILITY (1986)
- Semigroup Forum
- ON THE PERIODICITY OF MORPHISMS ON FREE MONOIDS (1986)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- THE EQUATIONS H(W)=WN IN BINARY ALPHABETS (1984)
- Theoretical Computer Science
- THE OMEGA-SEQUENCE EQUIVALENCE PROBLEM FOR DOL SYSTEMS IS DECIDABLE (1984)
- Journal- ACM
UTU Research Portal