Tero Harju

ORCID

Publication Activity (10 Years)

Years Active: 1977-2024
Publications (10 Years): 25

Top Venues

Theor. Comput. Sci.

CoRR

Fundam. Informaticae

Int. J. Found. Comput. Sci.

Publications

Tero Harju
A simple undecidable problem for free groups. Theor. Comput. Sci. 1003 (2024)
Vesa Halava, Tero Harju, Dirk Nowotka, Esa Sahla
Decision Problems on Copying and Shuffling. Fundam. Informaticae 191 (3-4) (2024)
Tero Harju
A Note on Squares in Binary Words. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov
Integer Weighted Automata on Infinite Words. Int. J. Found. Comput. Sci. 34 (2&3) (2023)
Olivier Finkel, Vesa Halava, Tero Harju, Esa Sahla
On bi-infinite and conjugate post correspondence problems. RAIRO Theor. Informatics Appl. 57 (2023)
Vesa Halava, Tero Harju, Dirk Nowotka, Esa Sahla
Decision Problems on Copying and Shuffling. CoRR (2023)
Tero Harju
Critical factorisation in square-free words. RAIRO Theor. Informatics Appl. 56 (2022)
Pamela Fleischmann, Tero Harju, Lukas Haschke, Jonas Höfer, Dirk Nowotka
On the Self Shuffle Language. CoRR (2022)
Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld
Avoiding square-free words on free groups. Theor. Comput. Sci. 922 (2022)
Vesa Halava, Tero Harju, Teemu Pirttimäki
A recursive function coding number theoretic functions. CoRR (2022)
Tero Harju
Disposability in square-free words. Theor. Comput. Sci. 862 (2021)
Tero Harju
A Note on Squares in Binary Words. CoRR (2021)
Vesa Halava, Tero Harju, Esa Sahla
The Conjugate Post Correspondence Problem. CoRR (2021)
Tero Harju
Critical factorisation in square-free words. CoRR (2021)
Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov
Integer Weighted Automata on Infinite Words. DLT (2021)
Vesa Halava, Tero Harju
On the Steps of Emil Post: from Normal Systems to the Correspondence Decision Problem. Acta Cybern. 24 (4) (2020)
Vesa Halava, Tero Harju, Esa Sahla
On Shuffling a Word with its Letter-to-Letter Substitution. Fundam. Informaticae 175 (1-4) (2020)
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
Some further results on squarefree arithmetic progressions in infinite words. CoRR (2019)
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. 799 (2019)
Tero Harju
On square-free arithmetic progressions in infinite words. Theor. Comput. Sci. 770 (2019)
Vesa Halava, Tero Harju, Esa Sahla
On fixed points of rational transductions. Theor. Comput. Sci. 732 (2018)
Vesa Halava, Tero Harju
Walks on tilings of polygons. Theor. Comput. Sci. 701 (2017)
Vesa Halava, Tero Harju, Esa Sahla
A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem. Fundam. Informaticae 154 (1-4) (2017)
Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov
Weighted automata on infinite words in the context of Attacker-Defender games. Inf. Comput. 255 (2017)
Émilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni
Abelian bordered factors and periodicity. Eur. J. Comb. 51 (2016)
Tero Harju, Mari Huova, Luca Q. Zamboni
On generating binary words palindromically. J. Comb. Theory, Ser. A 129 (2015)
Emilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni
Abelian bordered factors and periodicity. CoRR (2015)
Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games. CiE (2015)
Tero Harju, Mike Müller
Square-free shuffles of words. Theor. Comput. Sci. 601 (2015)
Mari Ernvall, Vesa Halava, Tero Harju
On the n-permutation Post Correspondence Problem. Theor. Comput. Sci. 601 (2015)
Tero Harju, Mike Müller
A note on short palindromes in square-free words. Theor. Comput. Sci. 562 (2015)
Julien Cassaigne, Vesa Halava, Tero Harju, François Nicolas
Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More. CoRR (2014)
Tero Harju, Tomi Kärki
Minimal Similarity Relations for Square-Free Words. Discrete Mathematics and Computer Science (2014)
Vesa Halava, Tero Harju
New proof for the undecidability of the circular PCP. Acta Informatica 50 (5-6) (2013)
Tero Harju, Mike Müller
Square-Free Shuffles of Words. CoRR (2013)
Tero Harju
A Note on Square-Free Shuffles of Words. WORDS (2013)
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
Composition and orbits of language operations: finiteness and upper bounds. Int. J. Comput. Math. 90 (6) (2013)
Tero Harju, Mari Huova, Luca Q. Zamboni
On Generating Binary Words Palindromically. CoRR (2013)
Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre
Simple gene assembly as a rewriting of directed overlap-inclusion graphs. Theor. Comput. Sci. 454 (2012)
Robert Brijder, Tero Harju, Hendrik Jan Hoogeboom
Pivots, determinants, and perfect matchings of graphs. Theor. Comput. Sci. 454 (2012)
Tero Harju
Square-free words obtained from prefixes by permutations. Theor. Comput. Sci. 429 (2012)
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
Finite Orbits of Language Operations CoRR (2011)
Tero Harju, Tomi Kärki, Dirk Nowotka
The Number of Positions Starting a Square in Binary Words. Electron. 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. Informaticae 110 (1-4) (2011)
Tero Harju, Tomi Kärki
On the number of frames in binary words. Theor. Comput. Sci. 412 (39) (2011)
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
Finite Orbits of Language Operations. LATA (2011)
Tero Harju
Square-free Walks on Labelled Graphs CoRR (2011)
Vesa Halava, Tero Harju, Tomi Kärki
A new proof for the decidability of D0L ultimate periodicity WORDS (2011)
Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo
On the Periodicity of Morphic Words. Developments in Language Theory (2010)
Tero Harju, Dirk Nowotka
Cyclically repetition-free words on small alphabets. Inf. Process. Lett. 110 (14-15) (2010)
Vesa Halava, Tero Harju, Tomi Kärki
On the number of squares in partial words. RAIRO Theor. Informatics Appl. 44 (1) (2010)
Jurriaan Hage, Tero Harju
On Involutions Arising from Graphs. Algorithmic Bioprocesses (2009)
Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold
Overlap-freeness in infinite partial words. Theor. Comput. Sci. 410 (8-10) (2009)
Vesa Halava, Tero Harju, Tomi Kärki
The theorem of Fine and Wilf for relational periods. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Tero Harju
Post Correspondence Problem and Small Dimensional Matrices. Developments in Language Theory (2009)
Tero Harju, Juhani Karhumäki
Preface. Int. J. Found. Comput. Sci. 19 (3) (2008)
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg
Patterns of simple gene assembly in ciliates. Discret. Appl. Math. 156 (14) (2008)
Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki
Post Correspondence Problem for short words. Inf. Process. Lett. 108 (3) (2008)
Vesa Halava, Tero Harju, Tomi Kärki
Square-free partial words. Inf. Process. Lett. 108 (5) (2008)
Tero Harju, Chang Li, Ion Petre
Graph theoretic approach to parallel gene assembly. Discret. Appl. Math. 156 (18) (2008)
Jean-Pierre Duval, Tero Harju, Dirk Nowotka
Unbordered factors and Lyndon words. Discret. Math. 308 (11) (2008)
Tero Harju, Dirk Nowotka
Bordered Conjugates of Words over Large Alphabets. Electron. J. Comb. 15 (1) (2008)
Tomi Kärki, Tero Harju, Vesa Halava
Interaction Properties of Relational Periods. Discret. Math. Theor. Comput. Sci. 10 (1) (2008)
Jean Berstel, Tero Harju, Juhani Karhumäki
Preface. RAIRO Theor. Informatics Appl. 42 (4) (2008)
Tero Harju, Chang Li, Ion Petre
Parallel complexity of signed graphs for gene assembly in ciliates. Soft Comput. 12 (8) (2008)
Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov
Matrix Equations and Hilbert's Tenth Problem. Int. J. Algebra Comput. 18 (8) (2008)
Jurriaan Hage, Tero Harju
Towards a characterization of bipartite switching classes by means of forbidden subgraphs. Discuss. Math. Graph Theory 27 (3) (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, Mika Hirvensalo
Undecidability Bounds for Integer Matrices Using Claus Instances. Int. J. Found. Comput. Sci. 18 (5) (2007)
Vesa Halava, Tero Harju, Tomi Kärki
Relational codes of words. Theor. Comput. Sci. 389 (1-2) (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) (2007)
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
Finite metrics in switching classes. Discret. Appl. Math. 155 (1) (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) (2007)
Tero Harju, Ion Petre, Grzegorz Rozenberg
Modelling Simple Operations for Gene Assembly. Nanotechnology: Science and Computation (2006)
Tero Harju, Dirk Nowotka
Binary Words with Few Squares. Bull. EATCS 89 (2006)
Vesa Halava, Tero Harju
Undecidability of infinite post correspondence problem for instances of Size 9. RAIRO Theor. Informatics Appl. 40 (4) (2006)
Vesa Halava, Tero Harju, Mika Hirvensalo
Positivity of second order linear recurrent sequences. Discret. Appl. Math. 154 (3) (2006)
Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
Complexity Measures for Gene Assembly. KDECB (2006)
Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
Parallelism in Gene Assembly. Nat. Comput. 5 (2) (2006)
Vesa Halava, Tero Harju, Juhani Karhumäki
Undecidability in omega-Regular Languages. Fundam. Informaticae 73 (1-2) (2006)
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
The Embedding Problem for Switching Classes of Graphs. Fundam. Informaticae 74 (1) (2006)
Tero Harju, Dirk Nowotka
Periods in Extensions of Words. Acta Informatica 43 (3) (2006)
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
Embedding linear orders in grids. Acta Informatica 42 (6-7) (2006)
Tero Harju, Dirk Nowotka
On unique factorizations of primitive words. Theor. Comput. Sci. 356 (1-2) (2006)
Tero Harju, Arto Lepistö, Dirk Nowotka
A characterization of periodicity of bi-infinite words. Theor. Comput. Sci. 347 (1-2) (2005)
Vesa Halava, Tero Harju, Michel Latteux
Representation of Regular Languages by Equality Sets. Bull. EATCS 86 (2005)
Vesa Halava, Tero Harju, Michel Latteux
Equality sets of prefix morphisms and regular star languages. Inf. Process. Lett. 94 (4) (2005)
Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
Equality sets for recursively enumerable languages. RAIRO Theor. Informatics Appl. 39 (4) (2005)
Tero Harju, Dirk Nowotka
Counting bordered and primitive words with a fixed weight. Theor. Comput. Sci. 340 (1) (2005)
Tero Harju
Combinatorial Models of Gene Assembly. CiE (2005)
Tero Harju, Dirk Nowotka
On the equation in a free semigroup. Theor. Comput. Sci. 330 (1) (2005)
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg
Simple Operations for Gene Assembly. DNA (2005)
Tero Harju, Juhani Karhumäki, Antonio Restivo
Preface. Theor. Comput. Sci. 339 (1) (2005)
Tero Harju
Characterizations of Regularity. FSMNLP (2005)
Tero Harju, Dirk Nowotka
Periodicity and Unbordered Words: A Proof of Duval?s Conjecture. STACS (2004)
Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
Parallelism in Gene Assembly. DNA (2004)
Tero Harju, Dirk Nowotka
Minimal Duval Extensions. Int. J. Found. Comput. Sci. 15 (2) (2004)
Tero Harju, Ion Petre, Grzegorz Rozenberg
Gene Assembly in Celiates. Part I. Molecular Operations (Column: Natural Computing). Bull. EATCS 82 (2004)
Tero Harju, Juhani Karhumäki
Many aspects of defect theorems. Theor. Comput. Sci. 324 (1) (2004)
Tero Harju, Dirk Nowotka
Border correlation of binary words. J. Comb. Theory, Ser. A 108 (2) (2004)

Tero Harju.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tero Harju