Tero Harju

188 papers A* 6A 2B 11C 11Journal 136Unranked 17
YearRankTypeTitle / Venue / Authors
2024 J jnl
A Note on Squares in Binary Words.
Int. J. Found. Comput. Sci.
Tero Harju
2024 J jnl
A simple undecidable problem for free groups.
Theor. Comput. Sci.
Tero Harju
2024 J jnl
Decision Problems on Copying and Shuffling.
Fundam. Informaticae
Vesa Halava, Tero Harju, Dirk Nowotka, Esa Sahla
2023 J jnl
Decision Problems on Copying and Shuffling.
CoRR
Vesa Halava, Tero Harju, Dirk Nowotka, Esa Sahla
2023 J jnl
Integer Weighted Automata on Infinite Words.
Int. J. Found. Comput. Sci.
Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov
2023 J jnl
On bi-infinite and conjugate post correspondence problems.
RAIRO Theor. Informatics Appl.
Olivier Finkel, Vesa Halava, Tero Harju, Esa Sahla
2022 J jnl
A recursive function coding number theoretic functions.
CoRR
Vesa Halava, Tero Harju, Teemu Pirttimäki
2022 J jnl
Avoiding square-free words on free groups.
Theor. Comput. Sci.
Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld
2022 J jnl
Critical factorisation in square-free words.
RAIRO Theor. Informatics Appl.
Tero Harju
2021 J jnl
A Note on Squares in Binary Words.
CoRR
Tero Harju
2021 J jnl
Critical factorisation in square-free words.
CoRR
Tero Harju
2021 J jnl
Disposability in square-free words.
Theor. Comput. Sci.
Tero Harju
2021 — ch.
Finite transducers and rational transductions.
Handbook of Automata Theory (I.)
Tero Harju, Juhani Karhumäki
2021 C conf
Integer Weighted Automata on Infinite Words.
DLT
Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov
2021 J jnl
The Conjugate Post Correspondence Problem.
CoRR
Vesa Halava, Tero Harju, Esa Sahla
2020 J jnl
On Shuffling a Word with its Letter-to-Letter Substitution.
Fundam. Informaticae
Vesa Halava, Tero Harju, Esa Sahla
2020 J jnl
On the Steps of Emil Post: from Normal Systems to the Correspondence Decision Problem.
Acta Cybern.
Vesa Halava, Tero Harju
2019 J jnl
On square-free arithmetic progressions in infinite words.
Theor. Comput. Sci.
Tero Harju
2019 J jnl
Some further results on squarefree arithmetic progressions in infinite words.
CoRR
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
2019 J jnl
Some further results on squarefree arithmetic progressions in infinite words.
Theor. Comput. Sci.
James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
2018 J jnl
On fixed points of rational transductions.
Theor. Comput. Sci.
Vesa Halava, Tero Harju, Esa Sahla
2017 J jnl
A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem.
Fundam. Informaticae
Vesa Halava, Tero Harju, Esa Sahla
2017 J jnl
Walks on tilings of polygons.
Theor. Comput. Sci.
Vesa Halava, Tero Harju
2017 J jnl
Weighted automata on infinite words in the context of Attacker-Defender games.
Inf. Comput.
Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov
2016 J jnl
Abelian bordered factors and periodicity.
Eur. J. Comb.
Émilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni
2015 J jnl
A note on short palindromes in square-free words.
Theor. Comput. Sci.
Tero Harju, Mike Müller
2015 J jnl
Abelian bordered factors and periodicity.
CoRR
Emilie Charlier, Tero Harju, Svetlana Puzynina, Luca Q. Zamboni
2015 J jnl
On generating binary words palindromically.
J. Comb. Theory A
Tero Harju, Mari Huova, Luca Q. Zamboni
2015 J jnl
On the n-permutation Post Correspondence Problem.
Theor. Comput. Sci.
Mari Ernvall, Vesa Halava, Tero Harju
2015 J jnl
Square-free shuffles of words.
Theor. Comput. Sci.
Tero Harju, Mike Müller
2015 C conf
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games.
CiE
Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov
2014 — conf
Minimal Similarity Relations for Square-Free Words.
Discrete Mathematics and Computer Science
Tero Harju, Tomi Kärki
2014 J jnl
Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More.
CoRR
Julien Cassaigne, Vesa Halava, Tero Harju, François Nicolas
2013 — conf
A Note on Square-Free Shuffles of Words.
WORDS
Tero Harju
2013 J jnl
Composition and orbits of language operations: finiteness and upper bounds.
Int. J. Comput. Math.
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
2013 J jnl
New proof for the undecidability of the circular PCP.
Acta Informatica
Vesa Halava, Tero Harju
2013 J jnl
On Generating Binary Words Palindromically.
CoRR
Tero Harju, Mari Huova, Luca Q. Zamboni
2013 J jnl
Square-Free Shuffles of Words.
CoRR
Tero Harju, Mike Müller
2012 — ch.
Computational Nature of Gene Assembly in Ciliates.
Handbook of Natural Computing
Robert Brijder, Mark Daley, Tero Harju, Natasa Jonoska, Ion Petre, Grzegorz Rozenberg
2012 J jnl
Pivots, determinants, and perfect matchings of graphs.
Theor. Comput. Sci.
Robert Brijder, Tero Harju, Hendrik Jan Hoogeboom
2012 J jnl
Simple gene assembly as a rewriting of directed overlap-inclusion graphs.
Theor. Comput. Sci.
Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre
2012 J jnl
Square-free words obtained from prefixes by permutations.
Theor. Comput. Sci.
Tero Harju
2011 — conf
A new proof for the decidability of D0L ultimate periodicity
WORDS
Vesa Halava, Tero Harju, Tomi Kärki
2011 J jnl
Directed Overlap-inclusion Graphs as Representations of Ciliate Genes.
Fundam. Informaticae
Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre, Vladimir Rogojin
2011 J jnl
Finite Orbits of Language Operations
CoRR
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
2011 C conf
Finite Orbits of Language Operations.
LATA
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
2011 J jnl
On the number of frames in binary words.
Theor. Comput. Sci.
Tero Harju, Tomi Kärki
2011 J jnl
Square-free Walks on Labelled Graphs
CoRR
Tero Harju
2011 J jnl
The Number of Positions Starting a Square in Binary Words.
Electron. J. Comb.
Tero Harju, Tomi Kärki, Dirk Nowotka
2010 J jnl
Cyclically repetition-free words on small alphabets.
Inf. Process. Lett.
Tero Harju, Dirk Nowotka
2010 C conf
On the Periodicity of Morphic Words.
Developments in Language Theory
Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo
2010 J jnl
On the number of squares in partial words.
RAIRO Theor. Informatics Appl.
Vesa Halava, Tero Harju, Tomi Kärki
2009 — conf
On Involutions Arising from Graphs.
Algorithmic Bioprocesses
Jurriaan Hage, Tero Harju
2009 J jnl
Overlap-freeness in infinite partial words.
Theor. Comput. Sci.
Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold
2009 C conf
Post Correspondence Problem and Small Dimensional Matrices.
Developments in Language Theory
Tero Harju
2009 J jnl
The theorem of Fine and Wilf for relational periods.
RAIRO Theor. Informatics Appl.
Vesa Halava, Tero Harju, Tomi Kärki
2008 J jnl
Bordered Conjugates of Words over Large Alphabets.
Electron. J. Comb.
Tero Harju, Dirk Nowotka
2008 J jnl
Graph theoretic approach to parallel gene assembly.
Discret. Appl. Math.
Tero Harju, Chang Li, Ion Petre
2008 J jnl
Interaction Properties of Relational Periods.
Discret. Math. Theor. Comput. Sci.
Tomi Kärki, Tero Harju, Vesa Halava
2008 J jnl
Matrix Equations and Hilbert's Tenth Problem.
Int. J. Algebra Comput.
Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov
2008 J jnl
Parallel complexity of signed graphs for gene assembly in ciliates.
Soft Comput.
Tero Harju, Chang Li, Ion Petre
2008 J jnl
Patterns of simple gene assembly in ciliates.
Discret. Appl. Math.
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg
2008 J jnl
Post Correspondence Problem for short words.
Inf. Process. Lett.
Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki
2008 J jnl
Preface.
Int. J. Found. Comput. Sci.
Tero Harju, Juhani Karhumäki
2008 J jnl
Preface.
RAIRO Theor. Informatics Appl.
Jean Berstel, Tero Harju, Juhani Karhumäki
2008 J jnl
Square-free partial words.
Inf. Process. Lett.
Vesa Halava, Tero Harju, Tomi Kärki
2008 J jnl
Unbordered factors and Lyndon words.
Discret. Math.
Jean-Pierre Duval, Tero Harju, Dirk Nowotka
2007 C ed.
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings
Developments in Language Theory
Tero Harju, Juhani Karhumäki, Arto Lepistö
2007 J jnl
Extension of the decidability of the marked PCP to instances with unique blocks.
Theor. Comput. Sci.
Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux
2007 J jnl
Finite metrics in switching classes.
Discret. Appl. Math.
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
2007 J jnl
Periodicity and unbordered words: A proof of the extended duval conjecture.
J. ACM
Tero Harju, Dirk Nowotka
2007 J jnl
Relational codes of words.
Theor. Comput. Sci.
Vesa Halava, Tero Harju, Tomi Kärki
2007 J jnl
The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems.
Theory Comput. Syst.
Vesa Halava, Tero Harju, Juhani Karhumäki
2007 J jnl
Towards a characterization of bipartite switching classes by means of forbidden subgraphs.
Discuss. Math. Graph Theory
Jurriaan Hage, Tero Harju
2007 J jnl
Undecidability Bounds for Integer Matrices Using Claus Instances.
Int. J. Found. Comput. Sci.
Vesa Halava, Tero Harju, Mika Hirvensalo
2006 J jnl
Binary Words with Few Squares.
Bull. EATCS
Tero Harju, Dirk Nowotka
2006 — conf
Complexity Measures for Gene Assembly.
KDECB
Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
2006 J jnl
Embedding linear orders in grids.
Acta Informatica
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
2006 — conf
Modelling Simple Operations for Gene Assembly.
Nanotechnology: Science and Computation
Tero Harju, Ion Petre, Grzegorz Rozenberg
2006 J jnl
On unique factorizations of primitive words.
Theor. Comput. Sci.
Tero Harju, Dirk Nowotka
2006 J jnl
Parallelism in Gene Assembly.
Nat. Comput.
Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
2006 J jnl
Periods in Extensions of Words.
Acta Informatica
Tero Harju, Dirk Nowotka
2006 J jnl
Positivity of second order linear recurrent sequences.
Discret. Appl. Math.
Vesa Halava, Tero Harju, Mika Hirvensalo
2006 J jnl
The Embedding Problem for Switching Classes of Graphs.
Fundam. Informaticae
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
2006 J jnl
Undecidability in omega-Regular Languages.
Fundam. Informaticae
Vesa Halava, Tero Harju, Juhani Karhumäki
2006 J jnl
Undecidability of infinite post correspondence problem for instances of Size 9.
RAIRO Theor. Informatics Appl.
Vesa Halava, Tero Harju
2005 J jnl
A characterization of periodicity of bi-infinite words.
Theor. Comput. Sci.
Tero Harju, Arto Lepistö, Dirk Nowotka
2005 — conf
Characterizations of Regularity.
FSMNLP
Tero Harju
2005 C conf
Combinatorial Models of Gene Assembly.
CiE
Tero Harju
2005 J jnl
Counting bordered and primitive words with a fixed weight.
Theor. Comput. Sci.
Tero Harju, Dirk Nowotka
2005 J jnl
Equality sets for recursively enumerable languages.
RAIRO Theor. Informatics Appl.
Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
2005 J jnl
Equality sets of prefix morphisms and regular star languages.
Inf. Process. Lett.
Vesa Halava, Tero Harju, Michel Latteux
2005 J jnl
On the equation in a free semigroup.
Theor. Comput. Sci.
Tero Harju, Dirk Nowotka
2005 J jnl
Preface.
Theor. Comput. Sci.
Tero Harju, Juhani Karhumäki, Antonio Restivo
2005 J jnl
Representation of Regular Languages by Equality Sets.
Bull. EATCS
Vesa Halava, Tero Harju, Michel Latteux
2005 B conf
Simple Operations for Gene Assembly.
DNA
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg
2004 J jnl
A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs.
SIAM J. Discret. Math.
Jurriaan Hage, Tero Harju
2004 J jnl
Border correlation of binary words.
J. Comb. Theory A
Tero Harju, Dirk Nowotka
2004 B conf
Embedding in Switching Classes with Skew Gains.
ICGT
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
2004 — conf
Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs.
Aspects of Molecular Computing
Tero Harju, Ion Petre, Grzegorz Rozenberg
2004 J jnl
Gene Assembly in Celiates. Part I. Molecular Operations (Column: Natural Computing).
Bull. EATCS
Tero Harju, Ion Petre, Grzegorz Rozenberg
2004 J jnl
Many aspects of defect theorems.
Theor. Comput. Sci.
Tero Harju, Juhani Karhumäki
2004 J jnl
Minimal Duval Extensions.
Int. J. Found. Comput. Sci.
Tero Harju, Dirk Nowotka
2004 B conf
Parallelism in Gene Assembly.
DNA
Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenberg
2004 A conf
Periodicity and Unbordered Words: A Proof of Duval?s Conjecture.
STACS
Tero Harju, Dirk Nowotka
2004 B conf
Splicing Systems for Universal Turing Machines.
DNA
Tero Harju, Maurice Margenstern
2004 J jnl
Transitivity of local complementation and switching on graphs.
Discret. Math.
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
2004 B conf
Tutorial on DNA Computing and Graph Transformation.
ICGT
Tero Harju, Ion Petre, Grzegorz Rozenberg
2004 — conf
Two Models for Gene Assembly in Ciliates.
Theory Is Forever
Tero Harju, Ion Petre, Grzegorz Rozenberg
2004 J jnl
Undecidability in matrices over Laurent polynomials.
Adv. Appl. Math.
Vesa Halava, Tero Harju
2004 J jnl
Valence Languages Generated by Equality Sets.
J. Autom. Lang. Comb.
Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
2003 C conf
About Duval's Conjecture.
Developments in Language Theory
Tero Harju, Dirk Nowotka
2003 J jnl
Decidability of the binary infinite Post Correspondence Problem.
Discret. Appl. Math.
Vesa Halava, Tero Harju, Juhani Karhumäki
2003 J jnl
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes.
Fundam. Informaticae
Jurriaan Hage, Tero Harju, Emo Welzl
2003 J jnl
Formal systems for gene assembly in ciliates.
Theor. Comput. Sci.
Andrzej Ehrenfeucht, Tero Harju, Ion Petre, David M. Prescott, Grzegorz Rozenberg
2003 J jnl
Gene Assembly in Ciliates Part I. Molecular Operations.
Bull. EATCS
Tero Harju, Ion Petre, Grzegorz Rozenberg
2003 B conf
Languages Defined by Generalized Equality Sets.
FCT
Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux
2003 J jnl
On the independence of equations in three variables.
Theor. Comput. Sci.
Tero Harju, Dirk Nowotka
2003 J jnl
Periodicity and Unbordered Segments of Words.
Bull. EATCS
Tero Harju, Dirk Nowotka
2003 J jnl
Periodicity and Unbordered Words: A Proof of the Extended Duval Conjecture
CoRR
Tero Harju, Dirk Nowotka
2002 J jnl
Binary (generalized) Post Correspondence Problem.
Theor. Comput. Sci.
Vesa Halava, Tero Harju, Mika Hirvensalo
2002 J jnl
Characterizing the Micronuclear Gene Patterns in Ciliates.
Theory Comput. Syst.
Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg
2002 C conf
Computational Processes in Living Cells: Gene Assembly in Ciliates.
Developments in Language Theory
Tero Harju, Grzegorz Rozenberg
2002 J jnl
Density of Critical Factorizations.
RAIRO Theor. Informatics Appl.
Tero Harju, Dirk Nowotka
2002 B conf
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes.
ICGT
Jurriaan Hage, Tero Harju, Emo Welzl
2002 J jnl
Gene assembly through cyclic graph decomposition.
Theor. Comput. Sci.
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
2002 — conf
Infinite Solutions of Marked Post Correspondence Problem.
Formal and Natural Computing
Vesa Halava, Tero Harju
2002 J jnl
Some Decision Problems Concerning Semilinearity and Commutation.
J. Comput. Syst. Sci.
Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa
2002 B conf
Tutorial on DNA Computing and Graph Transformation - Computational Nature of Gene Assembly in Ciliates.
ICGT
Tero Harju, Ion Petre, Grzegorz Rozenberg
2001 C conf
An Undecidability Result Concerning Periodic Morphisms.
Developments in Language Theory
Vesa Halava, Tero Harju
2001 A* conf
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.
ICALP
Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa
2001 C conf
Decision Questions on Integer Matrices.
Developments in Language Theory
Tero Harju
2001 — conf
Forbidden subsequences and permutations sortable on two parallel stacks.
Where Mathematics, Computer Science, Linguistics and Biology Meet
Tero Harju, Lucian Ilie
2001 J jnl
Mortality in Matrix Semigroups.
Am. Math. Mon.
Vesa Halava, Tero Harju
2001 B conf
Patterns of Micronuclear Genes in ciliates.
DNA
Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg
2001 J jnl
Some New Results on Post Correspondence Problem and Its Modifications.
Bull. EATCS
Vesa Halava, Tero Harju
2000 J jnl
Generalized Post Correspondence Problem for Marked Morphisms.
Int. J. Algebra Comput.
Vesa Halava, Tero Harju, Mika Hirvensalo
2000 J jnl
Pancyclicity in switching classes.
Inf. Process. Lett.
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
2000 J jnl
Periods and Binary Words.
J. Comb. Theory A
Vesa Halava, Tero Harju, Lucian Ilie
2000 J jnl
The size of switching classes with skew gains.
Discret. Math.
Jurriaan Hage, Tero Harju
1999 B conf
Generalized PCP Is Decidable for Marked Morphisms.
FCT
Vesa Halava, Tero Harju, Mika Hirvensalo
1999 — conf
Languages Accepted by Integer Weighted Finite Automata.
Jewels are Forever
Vesa Halava, Tero Harju
1999 J jnl
On the Undecidability of Freeness of Matrix Semigroups.
Int. J. Algebra Comput.
Julien Cassaigne, Tero Harju, Juhani Karhumäki
1999 — book
The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs.
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1999 J jnl
Undecidability in Integer Weighted Finite Automata.
Fundam. Informaticae
Vesa Halava, Tero Harju
1999 J jnl
Undecidability of the equivalence of finite substitutions on regular language.
RAIRO Theor. Informatics Appl.
Vesa Halava, Tero Harju
1998 J jnl
Acyclicity of Switching Classes.
Eur. J. Comb.
Jurriaan Hage, Tero Harju
1998 — conf
Complexity Issues in Switching of Graphs.
TAGT
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
1998 J jnl
On Quasi Orders of Words and the Confluence Property.
Theor. Comput. Sci.
Tero Harju, Lucian Ilie
1998 J jnl
Permutations, parenthesis words, and Schröder numbers.
Discret. Math.
Andrzej Ehrenfeucht, Tero Harju, Paulien ten Pas, Grzegorz Rozenberg
1998 B conf
Shuffle on Trajectories: The Schützenberger Product and Related Operations.
MFCS
Tero Harju, Alexandru Mateescu, Arto Salomaa
1997 — ch.
2-Structures - A Framework For Decomposition And Transformation Of Graphs.
Handbook of Graph Grammars
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1997 J jnl
A Note on Decidability Questions on Presentations of Word Semigroups.
Theor. Comput. Sci.
Christian Choffrut, Tero Harju, Juhani Karhumäki
1997 J jnl
Compactness of Systems of Equations in Semigroups.
Int. J. Algebra Comput.
Tero Harju, Juhani Karhumäki, Wojciech Plandowski
1997 — conf
Compactness of Systems of Equations on Completely Regular Semigroups.
Structures in Logic and Computer Science
Tero Harju, Juhani Karhumäki, Mario Petrich
1997 J jnl
Invariants of Inversive 2-Structures on Groups of Labels.
Math. Struct. Comput. Sci.
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1997 J jnl
Languages Obtained from Infinite Words.
RAIRO Theor. Informatics Appl.
Tero Harju, Lucian Ilie
1997 — ch.
Morphisms.
Handbook of Formal Languages (1)
Tero Harju, Juhani Karhumäki
1997 J jnl
On a Geometric Problem of Zigzags.
Inf. Process. Lett.
Vesa Halava, Tero Harju, Lucian Ilie
1996 J jnl
Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures.
Theor. Comput. Sci.
Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg
1996 J jnl
Flatwords and Post Correspondence Problem.
Theor. Comput. Sci.
Tero Harju, Marjo Lipponen, Alexandru Mateescu
1996 A conf
Remarks on Generalized Post Correspondence Problem.
STACS
Tero Harju, Juhani Karhumäki, Daniel Krob
1995 A* conf
Compactness of Systems of Equations in Semigroups.
ICALP
Tero Harju, Juhani Karhumäki, Wojciech Plandowski
1995 A* conf
Theory of 2-Structures.
ICALP
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1994 — conf
Decompostion of Infinite Labeled 2-Structures.
Results and Trends in Theoretical Computer Science
Tero Harju, Grzegorz Rozenberg
1994 — conf
Group Based Graph Transformations and Hierarchical Representations of Graphs.
TAGT
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1994 — conf
Identities and Transductions.
Results and Trends in Theoretical Computer Science
Tero Harju, Hendrik Jan Hoogeboom, H. C. M. Kleijn
1994 J jnl
Incremental construction of 2-structures.
Discret. Math.
Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
1994 J jnl
Reductions for Primitive 2-Structures.
Fundam. Informaticae
Tero Harju, Grzegorz Rozenberg
1994 J jnl
Representation of Rational Functions with Prefix and Suffix Codings.
Theor. Comput. Sci.
Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte
1994 J jnl
The Intersection Problem for Alphabetic Vector Monoids.
RAIRO Theor. Informatics Appl.
Tero Harju, N. W. Keesmaat, H. C. M. Kleijn
1993 J jnl
Morphisms and rational tranducers.
Bull. EATCS
Tero Harju, H. C. M. Kleijn
1992 J jnl
Compositional representation of rational functions.
RAIRO Theor. Informatics Appl.
Tero Harju, H. C. M. Kleijn, Michel Latteux
1992 J jnl
Deterministic Sequential Functions.
Acta Informatica
Tero Harju, H. C. M. Kleijn, Michel Latteux
1991 J jnl
Decidability problems for unary output sequential transducers.
Discret. Appl. Math.
Tero Harju, H. C. M. Kleijn
1991 J jnl
Splicing semigroups of dominoes and DNA.
Discret. Appl. Math.
Karel Culík II, Tero Harju
1991 J jnl
The Equivalence Problem of Multitape Finite Automata.
Theor. Comput. Sci.
Tero Harju, Juhani Karhumäki
1990 A* conf
Decidability of the Multiplicity Equivalence of Multitape Finite Automata
STOC
Tero Harju, Juhani Karhumäki
1989 J jnl
Cardinality Problems of Composition of Morphisms and Inverse Morphisms.
Math. Syst. Theory
Tero Harju, H. C. M. Kleijn
1989 A* conf
Dominoes and the Regularity of DNS Splicing Languages.
ICALP
Karel Culík II, Tero Harju
1986 J jnl
On morphic generation of regular languages.
Discret. Appl. Math.
Tero Harju, Juhani Karhumäki, H. C. M. Kleijn
1986 J jnl
On the Periodicity of Morphisms on Free Monoids.
RAIRO Theor. Informatics Appl.
Tero Harju, Matti Linna
1984 J jnl
The Equations h(w)=w-n in Binary Alphabets.
Theor. Comput. Sci.
Tero Harju, Matti Linna
1984 J jnl
The omega-Sequence Problem for DOL Systems Is Decidable.
J. ACM
Karel Culík II, Tero Harju
1982 J jnl
Dominoes Over a Free Monoid.
Theor. Comput. Sci.
Karel Culík II, Tero Harju
1981 A* conf
The omega-Sequence Equivalence Problem for DOL Systems Is Decidable
STOC
Karel Culík II, Tero Harju
1979 J jnl
A Simulation Result for the Auxiliary Pushdown Automata.
J. Comput. Syst. Sci.
Tero Harju
1977 J jnl
A Polynomial Recognition Algorithm for the EDTOL Languages.
J. Inf. Process. Cybern.
Tero Harju