- Ordered Sets (2006) / T. Harju Problem Set 1
- Complexity Issues in Switching of Graphs Andrzej Ehrenfeucht 2 , Jurriaan Hage 1 , Tero Harju 3 , and Grzegorz
- Lecture Notes in Combinatorial Enumeration
- A CHARACTERIZATION OF ACYCLIC SWITCHING CLASSES OF GRAPHS USING FORBIDDEN SUBGRAPHS
- Graph Theory: Problem Set 9 April 14, 2011
- Clarified and corrected examples: Example 1.59(Monotone sequences) Consider the set N = {1, 2, . . . , n2 + 1} of
- Ordered Sets (2006) / T. Harju Problem Set 6
- Gene Assembly Through Cyclic Graph Decomposition
- The Equivalence Problem of Multitape Finite Tero Harju and Juhani Karhumaki
- Ordered Sets (2006) / T. Harju Problem Set 11
- Characterizing the micronuclear gene patterns in Andrzej Ehrenfeucht Tero Harju y
- Cauchy 1812 Euler's formula
- 2-STRUCTURES A FRAMEWORK FOR DECOMPOSITION AND
- Graph Theory: Problem Set 1 February 10, 2011 (16:15-17:15)
- Ordered Sets (2006) / T. Harju Problem Set 8
- Graph Theory: Problem Set 4 March 10, 2011
- Ordered Sets (2006) / T. Harju Problem Set 5
- Ordered Sets (2006) / T. Harju Problem Set 4
- Computational Processes in Living Cells: Gene Assembly in Ciliates
- The Size of Switching Classes with Skew Gains Jurriaan Hage
- Graph Theory: Problem Set 4 March 10, 2011
- Graph Theory: Problem Set 5 March 17, 2011
- Ordered Sets (2006) / T. Harju Problem Set 2
- Graph Theory: Problem Set 10 April 28, 2011
- Complexity Problems in Switching Classes of Graphs Andrzej Ehrenfeucht
- Group Based Graph Transformations Hierarchical Representations of Graphs y
- Combinatorics on Words Department of Mathematics
- Graph Theory: Problem Set 7 March 31, 2011
- Ordered Sets (2006) / T. Harju Problem Set 3
- Graph Theory: Problem Set 5 March 17, 2011
- Ordered Sets (2006) / T. Harju Problem Set 1
- English-Finnish dictionary of Graph Theory: English Finnish
- Compactness of Systems of Equations on Completely Regular Semigroups ?
- Ordered Sets (2006) / T. Harju Problem Set 4
- Publications (April 2007) Some of the preprints of the articles are
- On the number of frames in binary words Tero Harjua
- Overlap-freeness in infinite partial words1 Vesa Halava, Tero Harju, Tomi Karki 2
- Positivity of Second Order Linear Recurrent Sequences
- Combinatorics on Words Department of Mathematics
- The Equation aM in a Free Semigroup
- Periodicity and Unbordered Segments of Words Tero Harju Dirk Nowotka
- Computational Processes in Living Cells: Gene Assembly in Ciliates
- Semigroup Forum Preprint 1992 Permutable Transformation Semigroups
- Invariants of Inversive 2-structures on Groups of A. Ehrenfeucht1
- Permutations, Parenthesis Words, and Schroder Numbers
- Lecture Notes in Ordered Sets
- Lecture Notes on GRAPH THEORY
- Lecture Notes on Department of Mathematics
- Ordered Sets (2006) / T. Harju Problem Set 5
- Ordered Sets (2006) / T. Harju Problem Set 8
- Ordered Sets (2006) / T. Harju Problem Set 2
- Ordered Sets (2006) / T. Harju Problem Set 7
- Ordered Sets (2006) / T. Harju Problem Set 9
- Ordered Sets (2006) / T. Harju Problem Set 10
- Ordered Sets (2006) / T. Harju Problem Set 12
- Graph Theory: Problem Set 2 February 17, 2011
- Graph Theory: Problem Set 3 February 24, 2011
- Graph Theory: Problem Set 1 February 10, 2011 (16:15-17:15)
- Graph Theory: Problem Set 2 February 17, 2011
- Graph Theory: Problem Set 3 February 24, 2011
- Graph Theory: Problem Set 6 March 24, 2011
- Graph Theory: Problem Set 9 April 14, 2011
- Graph Theory: Problem Set 10 April 28, 2011
- Graph Theory: Problem Set 8 April 7, 2011
- Lecture Notes on Short Course
- Compositional Representation of Rational H.C.M. Kleijn2
- On Unique Factorizations of Primitive Words Department of Mathematics,
- Patterns of Simple Gene Assembly in Ciliates Department of Mathematics, University of Turku
- Tero Harju | Dirk Nowotka Binary Words with Few Squares
- Walks on Borders of Polygons VESA HALAVA
- On Involutions Arising from Graphs Jurriaan Hage
- Finite Metrics in Switching Classes Andrzej Ehrenfeucht
- On the Periodicity of Morphic Words Vesa Halava1
- Undecidability of Infinite Post Correspondence Problem for Instances of Size 9
- Fundamenta Informaticae XXI (2001) 10011007 1001 Undecidability in -Regular Languages
- Undecidability Bounds for Integer Matrices using Claus Instances
- Unbordered Factors and Lyndon Words J.-P. Duval a
- Fundamenta Informaticae XX (2005) 120 1 THE EMBEDDING PROBLEM FOR SWITCHING CLASSES
- Extension of the decidability of the marked PCP to instances with unique blocks
- Acta Informatica manuscript No. (will be inserted by the editor)
- Paul Bell | Vesa Halava | Tero Harju | Juhani Karhumaki | Igor Potapov
- Cyclically Repetition-free Words on Small Alphabets Department of Mathematics, University of Turku and Turku Centre for Computer Science
- Vesa Halava | Tero Harju | Tomi Karki Square-free partial words
- Vesa Halava | Tero Harju | Tomi Krki Interaction properties of relational
- Periodicity and Unbordered Words: A Proof of the Extended Duval Conjecture
- (h, g) h g
- Overlap-freeness in infinite partial words1 Vesa Halava a
- Weinbaum Factorizations of Primitive Words Volker Diekert
- Complexity Measures for Gene Assembly Tero Harju1
