Tero Harju

Tero Harju: Square-free words obtained from prefixes by permutations. Theor. Comput. Sci. 429: 128-133 (2012)

Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre: Simple gene assembly as a rewriting of directed overlap-inclusion graphs. Theor. Comput. Sci. 454: 30-37 (2012)

Robert Brijder, Tero Harju, Hendrik Jan Hoogeboom: Pivots, determinants, and perfect matchings of graphs. Theor. Comput. Sci. 454: 64-71 (2012)

Tero Harju, Tomi Kärki, Dirk Nowotka: The Number of Positions Starting a Square in Binary Words. Electr. J. Comb. 18(1) (2011)

Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre, Vladimir Rogojin: Directed Overlap-inclusion Graphs as Representations of Ciliate Genes. Fundam. Inform. 110(1-4): 29-44 (2011)

Tero Harju, Tomi Kärki: On the number of frames in binary words. Theor. Comput. Sci. 412(39): 5276-5284 (2011)

Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey Shallit: Finite Orbits of Language Operations. LATA 2011: 204-215

Vesa Halava, Tero Harju, Tomi Kärki: A new proof for the decidability of D0L ultimate periodicity. WORDS 2011: 147-151

Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey Shallit: Finite Orbits of Language Operations. CoRR abs/1101.1667 (2011)

Tero Harju: Square-free Walks on Labelled Graphs. CoRR abs/1106.4106 (2011)

Tero Harju, Dirk Nowotka: Cyclically repetition-free words on small alphabets. Inf. Process. Lett. 110(14-15): 591-595 (2010)

Vesa Halava, Tero Harju, Tomi Kärki: On the number of squares in partial words. RAIRO - Theor. Inf. and Applic. 44(1): 125-138 (2010)

Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo: On the Periodicity of Morphic Words. Developments in Language Theory 2010: 209-217

Vesa Halava, Tero Harju, Tomi Kärki: The theorem of Fine and Wilf for relational periods. ITA 43(2): 209-220 (2009)

Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold: Overlap-freeness in infinite partial words. Theor. Comput. Sci. 410(8-10): 943-948 (2009)

Tero Harju: Post Correspondence Problem and Small Dimensional Matrices. Developments in Language Theory 2009: 39-46

Tero Harju, Dirk Nowotka: Bordered Conjugates of Words over Large Alphabets. Electr. J. Comb. 15(1) (2008)

Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg: Patterns of simple gene assembly in ciliates. Discrete Applied Mathematics 156(14): 2581-2597 (2008)

Tero Harju, Chang Li, Ion Petre: Graph theoretic approach to parallel gene assembly. Discrete Applied Mathematics 156(18): 3416-3429 (2008)

Jean-Pierre Duval, Tero Harju, Dirk Nowotka: Unbordered factors and Lyndon words. Discrete Mathematics 308(11): 2261-2264 (2008)

Tomi Kärki, Tero Harju, Vesa Halava: Interaction Properties of Relational Periods. Discrete Mathematics & Theoretical Computer Science 10(1) (2008)

Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov: Matrix Equations and Hilbert's Tenth Problem. IJAC 18(8): 1231-1241 (2008)

Tero Harju, Juhani Karhumäki: Preface. Int. J. Found. Comput. Sci. 19(3): 495-496 (2008)

Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki: Post Correspondence Problem for short words. Inf. Process. Lett. 108(3): 115-118 (2008)

Vesa Halava, Tero Harju, Tomi Kärki: Square-free partial words. Inf. Process. Lett. 108(5): 290-292 (2008)

Jean Berstel, Tero Harju, Juhani Karhumäki: Preface. ITA 42(4): 657 (2008)

Tero Harju, Chang Li, Ion Petre: Parallel complexity of signed graphs for gene assembly in ciliates. Soft Comput. 12(8): 731-737 (2008)

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: Finite metrics in switching classes. Discrete Applied Mathematics 155(1): 68-73 (2007)

Jurriaan Hage, Tero Harju: Towards a characterization of bipartite switching classes by means of forbidden subgraphs. Discussiones Mathematicae Graph Theory 27(3): 471-483 (2007)

Vesa Halava, Tero Harju, Mika Hirvensalo: Undecidability Bounds for Integer Matrices Using Claus Instances. Int. J. Found. Comput. Sci. 18(5): 931-948 (2007)

Tero Harju, Dirk Nowotka: Periodicity and unbordered words: A proof of the extended duval conjecture. J. ACM 54(4) (2007)

Vesa Halava, Tero Harju, Juhani Karhumäki: The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. Theory Comput. Syst. 40(1): 43-54 (2007)

Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux: Extension of the decidability of the marked PCP to instances with unique blocks. Theor. Comput. Sci. 380(3): 355-362 (2007)

Vesa Halava, Tero Harju, Tomi Kärki: Relational codes of words. Theor. Comput. Sci. 389(1-2): 237-249 (2007)

Tero Harju, Juhani Karhumäki, Arto Lepistö (Eds.): Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings. Lecture Notes in Computer Science 4588, Springer 2007, isbn 978-3-540-73207-5

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: Embedding linear orders in grids. Acta Inf. 42(6-7): 419-428 (2006)

Tero Harju, Dirk Nowotka: Periods in Extensions of Words. Acta Inf. 43(3): 165-171 (2006)

Vesa Halava, Tero Harju, Mika Hirvensalo: Positivity of second order linear recurrent sequences. Discrete Applied Mathematics 154(3): 447-451 (2006)

Tero Harju, Dirk Nowotka: Binary Words with Few Squares. Bulletin of the EATCS 89: 164-166 (2006)

Vesa Halava, Tero Harju, Juhani Karhumäki: Undecidability in omega-Regular Languages. Fundam. Inform. 73(1-2): 119-125 (2006)

Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg: The Embedding Problem for Switching Classes of Graphs. Fundam. Inform. 74(1): 115-134 (2006)

Vesa Halava, Tero Harju: Undecidability of infinite post correspondence problem for instances of Size 9. ITA 40(4): 551-557 (2006)

Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg: Parallelism in Gene Assembly. Natural Computing 5(2): 203-223 (2006)

Tero Harju, Dirk Nowotka: On unique factorizations of primitive words. Theor. Comput. Sci. 356(1-2): 186-189 (2006)

Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg: Complexity Measures for Gene Assembly. KDECB 2006: 42-60

Tero Harju, Ion Petre, Grzegorz Rozenberg: Modelling Simple Operations for Gene Assembly. Nanotechnology: Science and Computation 2006: 361-373

Vesa Halava, Tero Harju, Michel Latteux: Representation of Regular Languages by Equality Sets. Bulletin of the EATCS 86: 224-228 (2005)

Vesa Halava, Tero Harju, Michel Latteux: Equality sets of prefix morphisms and regular star languages. Inf. Process. Lett. 94(4): 151-154 (2005)

Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux: Equality sets for recursively enumerable languages. ITA 39(4): 661-675 (2005)

Tero Harju, Dirk Nowotka: On the equation in a free semigroup. Theor. Comput. Sci. 330(1): 117-121 (2005)

Tero Harju, Juhani Karhumäki, Antonio Restivo: Preface. Theor. Comput. Sci. 339(1): 1-2 (2005)

Tero Harju, Dirk Nowotka: Counting bordered and primitive words with a fixed weight. Theor. Comput. Sci. 340(1): 273-279 (2005)

Tero Harju, Arto Lepistö, Dirk Nowotka: A characterization of periodicity of bi-infinite words. Theor. Comput. Sci. 347(1-2): 419-422 (2005)

Tero Harju: Combinatorial Models of Gene Assembly. CiE 2005: 188-195

Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg: Simple Operations for Gene Assembly. DNA 2005: 96-111

Tero Harju: Characterizations of Regularity. FSMNLP 2005: 1-8

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: Transitivity of local complementation and switching on graphs. Discrete Mathematics 278(1-3): 45-60 (2004)

Tero Harju, Ion Petre, Grzegorz Rozenberg: Gene Assembly in Celiates. Part I. Molecular Operations (Column: Natural Computing). Bulletin of the EATCS 82: 227-241 (2004)

Tero Harju, Dirk Nowotka: Minimal Duval Extensions. Int. J. Found. Comput. Sci. 15(2): 349-354 (2004)

Tero Harju, Dirk Nowotka: Border correlation of binary words. J. Comb. Theory, Ser. A 108(2): 331-341 (2004)

Jurriaan Hage, Tero Harju: A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs. SIAM J. Discrete Math. 18(1): 159-176 (2004)

Tero Harju, Juhani Karhumäki: Many aspects of defect theorems. Theor. Comput. Sci. 324(1): 35-54 (2004)

Tero Harju, Ion Petre, Grzegorz Rozenberg: Two Models for Gene Assembly in Ciliates. Theory Is Forever 2004: 89-101

Tero Harju, Ion Petre, Grzegorz Rozenberg: Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs. Aspects of Molecular Computing 2004: 202-212

Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg: Parallelism in Gene Assembly. DNA 2004: 138-148

Tero Harju, Maurice Margenstern: Splicing Systems for Universal Turing Machines. DNA 2004: 149-158

Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg: Embedding in Switching Classes with Skew Gains. ICGT 2004: 257-270

Tero Harju, Ion Petre, Grzegorz Rozenberg: Tutorial on DNA Computing and Graph Transformation. ICGT 2004: 434-436

Tero Harju, Dirk Nowotka: Periodicity and Unbordered Words: A Proof of Duval?s Conjecture. STACS 2004: 294-304

Vesa Halava, Tero Harju, Juhani Karhumäki: Decidability of the binary infinite Post Correspondence Problem. Discrete Applied Mathematics 130(3): 521-526 (2003)

Tero Harju, Dirk Nowotka: Periodicity and Unbordered Segments of Words. Bulletin of the EATCS 80: 162-167 (2003)

Tero Harju, Ion Petre, Grzegorz Rozenberg: Gene Assembly in Ciliates Part I. Molecular Operations. Bulletin of the EATCS 81: 236-249 (2003)

Jurriaan Hage, Tero Harju, Emo Welzl: Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. Fundam. Inform. 58(1): 23-37 (2003)

Andrzej Ehrenfeucht, Tero Harju, Ion Petre, David M. Prescott, Grzegorz Rozenberg: Formal systems for gene assembly in ciliates. Theor. Comput. Sci. 292(1): 199-219 (2003)

Tero Harju, Dirk Nowotka: On the independence of equations in three variables. Theor. Comput. Sci. 307(1): 139-172 (2003)

Tero Harju, Dirk Nowotka: About Duval's Conjecture. Developments in Language Theory 2003: 316-324

Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux: Languages Defined by Generalized Equality Sets. FCT 2003: 355-363

Tero Harju, Dirk Nowotka: Periodicity and Unbordered Words: A Proof of the Extended Duval Conjecture. CoRR cs.DM/0305039 (2003)

Tero Harju, Dirk Nowotka: Density of Critical Factorizations. ITA 36(3): 315-327 (2002)

Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa: Some Decision Problems Concerning Semilinearity and Commutation. J. Comput. Syst. Sci. 65(2): 278-294 (2002)

Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg: Characterizing the Micronuclear Gene Patterns in Ciliates. Theory Comput. Syst. 35(5): 501-519 (2002)

Vesa Halava, Tero Harju, Mika Hirvensalo: Binary (generalized) Post Correspondence Problem. Theor. Comput. Sci. 276(1-2): 183-204 (2002)

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: Gene assembly through cyclic graph decomposition. Theor. Comput. Sci. 281(1-2): 325-349 (2002)

Vesa Halava, Tero Harju: Infinite Solutions of Marked Post Correspondence Problem. Formal and Natural Computing 2002: 57-68

Tero Harju, Grzegorz Rozenberg: Computational Processes in Living Cells: Gene Assembly in Ciliates. Developments in Language Theory 2002: 1-20

Jurriaan Hage, Tero Harju, Emo Welzl: Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. ICGT 2002: 148-160

Tero Harju, Ion Petre, Grzegorz Rozenberg: Tutorial on DNA Computing and Graph Transformation - Computational Nature of Gene Assembly in Ciliates. ICGT 2002: 430-434

Vesa Halava, Tero Harju: Some New Results on Post Correspondence Problem and Its Modifications. Bulletin of the EATCS 73: 131-141 (2001)

Vesa Halava, Tero Harju: Mortality in Matrix Semigroups. The American Mathematical Monthly 108(7): 649-653 (2001)

Tero Harju, Lucian Ilie: Forbidden subsequences and permutations sortable on two parallel stacks. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 267-275

Tero Harju: Decision Questions on Integer Matrices. Developments in Language Theory 2001: 57-68

Vesa Halava, Tero Harju: An Undecidability Result Concerning Periodic Morphisms. Developments in Language Theory 2001: 304-310

Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg: Patterns of Micronuclear Genes in ciliates. DNA 2001: 279-289

Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa: Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. ICALP 2001: 579-590

Jurriaan Hage, Tero Harju: The size of switching classes with skew gains. Discrete Mathematics 215: 81-92 (2000)

Vesa Halava, Tero Harju, Mika Hirvensalo: Generalized Post Correspondence Problem for Marked Morphisms. IJAC 10(6): 757-772 (2000)

Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg: Pancyclicity in switching classes. Inf. Process. Lett. 73(5-6): 153-156 (2000)

Vesa Halava, Tero Harju, Lucian Ilie: Periods and Binary Words. J. Comb. Theory, Ser. A 89(2): 298-303 (2000)

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs. World Scientific 1999, isbn 978-981-02-4042-4, pp. I-XVI, 1-290

Vesa Halava, Tero Harju: Undecidability in Integer Weighted Finite Automata. Fundam. Inform. 38(1-2): 189-200 (1999)

Julien Cassaigne, Tero Harju, Juhani Karhumäki: On the Undecidability of Freeness of Matrix Semigroups. IJAC 9(3-4): 295-306 (1999)

Vesa Halava, Tero Harju: Undecidability of the equivalence of finite substitutions on regular language. ITA 33(2): 117-124 (1999)

Vesa Halava, Tero Harju: Languages Accepted by Integer Weighted Finite Automata. Jewels are Forever 1999: 123-134

Vesa Halava, Tero Harju, Mika Hirvensalo: Generalized PCP Is Decidable for Marked Morphisms. FCT 1999: 304-315

Andrzej Ehrenfeucht, Tero Harju, Paulien ten Pas, Grzegorz Rozenberg: Permutations, parenthesis words, and Schröder numbers. Discrete Mathematics 190(1-3): 259-264 (1998)

Jurriaan Hage, Tero Harju: Acyclicity of Switching Classes. Eur. J. Comb. 19(3): 321-327 (1998)

Tero Harju, Lucian Ilie: On Quasi Orders of Words and the Confluence Property. Theor. Comput. Sci. 200(1-2): 205-224 (1998)

Tero Harju, Alexandru Mateescu, Arto Salomaa: Shuffle on Trajectories: The Schützenberger Product and Related Operations. MFCS 1998: 503-511

Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg: Complexity Issues in Switching of Graphs. TAGT 1998: 59-70

Vesa Halava, Tero Harju, Lucian Ilie: On a Geometric Problem of Zigzags. Inf. Process. Lett. 62(1): 1-4 (1997)

Tero Harju, Lucian Ilie: Languages Obtained from Infinite Words. ITA 31(5): 445-455 (1997)

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: Invariants of Inversive 2-Structures on Groups of Labels. Mathematical Structures in Computer Science 7(4): 303-327 (1997)

Christian Choffrut, Tero Harju, Juhani Karhumäki: A Note on Decidability Questions on Presentations of Word Semigroups. Theor. Comput. Sci. 183(1): 83-92 (1997)

Tero Harju, Juhani Karhumäki, Mario Petrich: Compactness of Systems of Equations on Completely Regular Semigroups. Structures in Logic and Computer Science 1997: 268-280

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: 2-Structures - A Framework For Decomposition And Transformation Of Graphs. Handbook of Graph Grammars 1997: 401-478

Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg: Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures. Theor. Comput. Sci. 154(2): 247-282 (1996)

Tero Harju, Marjo Lipponen, Alexandru Mateescu: Flatwords and Post Correspondence Problem. Theor. Comput. Sci. 161(1&2): 93-108 (1996)

Tero Harju, Juhani Karhumäki, Daniel Krob: Remarks on Generalized Post Correspondence Problem. STACS 1996: 39-48

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: Theory of 2-Structures. ICALP 1995: 1-14

Tero Harju, Juhani Karhumäki, Wojciech Plandowski: Compactness of Systems of Equations in Semigroups. ICALP 1995: 444-454

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: Incremental construction of 2-structures. Discrete Mathematics 128(1-3): 113-141 (1994)

Tero Harju, Grzegorz Rozenberg: Reductions for Primitive 2-Structures. Fundam. Inform. 20(1/2/3): 133-144 (1994)

Tero Harju, N. W. Keesmaat, H. C. M. Kleijn: The Intersection Problem for Alphabetic Vector Monoids. ITA 28(3-4): 295-301 (1994)

Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte: Representation of Rational Functions with Prefix and Suffix Codings. Theor. Comput. Sci. 134(2): 403-413 (1994)

Tero Harju, Hendrik Jan Hoogeboom, H. C. M. Kleijn: Identities and Transductions. Results and Trends in Theoretical Computer Science 1994: 140-144

Tero Harju, Grzegorz Rozenberg: Decompostion of Infinite Labeled 2-Structures. Results and Trends in Theoretical Computer Science 1994: 145-158

Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg: Group Based Graph Transformations and Hierarchical Representations of Graphs. TAGT 1994: 502-520

Tero Harju, H. C. M. Kleijn: Morphisms and rational tranducers. Bulletin of the EATCS 51: 168-180 (1993)

Tero Harju, H. C. M. Kleijn, Michel Latteux: Deterministic Sequential Functions. Acta Inf. 29(6/7): 545-554 (1992)

Tero Harju, H. C. M. Kleijn, Michel Latteux: Compositional representation of rational functions. ITA 26: 243-256 (1992)

Karel Culik II, Tero Harju: Splicing semigroups of dominoes and DNA. Discrete Applied Mathematics 31(3): 261-277 (1991)

Tero Harju, H. C. M. Kleijn: Decidability problems for unary output sequential transducers. Discrete Applied Mathematics 32(2): 131-140 (1991)

Tero Harju, Juhani Karhumäki: The Equivalence Problem of Multitape Finite Automata. Theor. Comput. Sci. 78(2): 347-355 (1991)

Tero Harju, Juhani Karhumäki: Decidability of the Multiplicity Equivalence of Multitape Finite Automata. STOC 1990: 477-481

Tero Harju, H. C. M. Kleijn: Cardinality Problems of Composition of Morphisms and Inverse Morphisms. Mathematical Systems Theory 22(3): 151-159 (1989)

Karel Culik II, Tero Harju: Dominoes and the Regularity of DNS Splicing Languages. ICALP 1989: 222-233

Tero Harju, Matti Linna: On the Periodicity of Morphisms on Free Monoids. ITA 20(1): 47-54 (1986)

Karel Culik II, Tero Harju: The omega-Sequence Problem for DOL Systems Is Decidable. J. ACM 31(2): 282-298 (1984)

Tero Harju, Matti Linna: The Equations h(w)=w-n in Binary Alphabets. Theor. Comput. Sci. 33: 327-329 (1984)

Karel Culik II, Tero Harju: Dominoes Over a Free Monoid. Theor. Comput. Sci. 18: 279-300 (1982)

Karel Culik II, Tero Harju: The omega-Sequence Equivalence Problem for DOL Systems Is Decidable. STOC 1981: 1-6

Tero Harju: A Simulation Result for the Auxiliary Pushdown Automata. J. Comput. Syst. Sci. 19(2): 119-132 (1979)

Tero Harju: A Polynomial Recognition Algorithm for the EDTOL Languages. Elektronische Informationsverarbeitung und Kybernetik 13(4/5): 169-177 (1977)