Tero Harju

According to our database1, Tero Harju
  • authored at least 161 papers between 1977 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Weighted automata on infinite words in the context of Attacker-Defender games.
Inf. Comput., 2017

A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem.
Fundam. Inform., 2017

2016
Abelian bordered factors and periodicity.
Eur. J. Comb., 2016

2015
Square-free shuffles of words.
Theor. Comput. Sci., 2015

A note on short palindromes in square-free words.
Theor. Comput. Sci., 2015

On the n-permutation Post Correspondence Problem.
Theor. Comput. Sci., 2015

On generating binary words palindromically.
J. Comb. Theory, Ser. A, 2015

Abelian bordered factors and periodicity.
CoRR, 2015

Weighted Automata on Infinite Words in the Context of Attacker-Defender Games.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More.
CoRR, 2014

Minimal Similarity Relations for Square-Free Words.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
Composition and orbits of language operations: finiteness and upper bounds.
Int. J. Comput. Math., 2013

Square-Free Shuffles of Words.
CoRR, 2013

On Generating Binary Words Palindromically.
CoRR, 2013

New proof for the undecidability of the circular PCP.
Acta Inf., 2013

A Note on Square-Free Shuffles of Words.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012
Computational Nature of Gene Assembly in Ciliates.
Proceedings of the Handbook of Natural Computing, 2012

Square-free words obtained from prefixes by permutations.
Theor. Comput. Sci., 2012

Pivots, determinants, and perfect matchings of graphs.
Theor. Comput. Sci., 2012

Simple gene assembly as a rewriting of directed overlap-inclusion graphs.
Theor. Comput. Sci., 2012

2011
On the number of frames in binary words.
Theor. Comput. Sci., 2011

Directed Overlap-inclusion Graphs as Representations of Ciliate Genes.
Fundam. Inform., 2011

A new proof for the decidability of D0L ultimate periodicity
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Square-free Walks on Labelled Graphs
CoRR, 2011

Finite Orbits of Language Operations
CoRR, 2011

The Number of Positions Starting a Square in Binary Words.
Electr. J. Comb., 2011

Finite Orbits of Language Operations.
Proceedings of the Language and Automata Theory and Applications, 2011

2010
On the number of squares in partial words.
RAIRO - Theor. Inf. and Applic., 2010

Cyclically repetition-free words on small alphabets.
Inf. Process. Lett., 2010

On the Periodicity of Morphic Words.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Overlap-freeness in infinite partial words.
Theor. Comput. Sci., 2009

The theorem of Fine and Wilf for relational periods.
ITA, 2009

Post Correspondence Problem and Small Dimensional Matrices.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
Parallel complexity of signed graphs for gene assembly in ciliates.
Soft Comput., 2008

Preface.
ITA, 2008

Square-free partial words.
Inf. Process. Lett., 2008

Post Correspondence Problem for short words.
Inf. Process. Lett., 2008

Preface.
Int. J. Found. Comput. Sci., 2008

Matrix Equations and Hilbert's Tenth Problem.
IJAC, 2008

Interaction Properties of Relational Periods.
Discrete Mathematics & Theoretical Computer Science, 2008

Unbordered factors and Lyndon words.
Discrete Mathematics, 2008

Patterns of simple gene assembly in ciliates.
Discrete Applied Mathematics, 2008

Graph theoretic approach to parallel gene assembly.
Discrete Applied Mathematics, 2008

Bordered Conjugates of Words over Large Alphabets.
Electr. J. Comb., 2008

2007
Extension of the decidability of the marked PCP to instances with unique blocks.
Theor. Comput. Sci., 2007

Relational codes of words.
Theor. Comput. Sci., 2007

The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems.
Theory Comput. Syst., 2007

Periodicity and unbordered words: A proof of the extended duval conjecture.
J. ACM, 2007

Undecidability Bounds for Integer Matrices Using Claus Instances.
Int. J. Found. Comput. Sci., 2007

Towards a characterization of bipartite switching classes by means of forbidden subgraphs.
Discussiones Mathematicae Graph Theory, 2007

Finite metrics in switching classes.
Discrete Applied Mathematics, 2007

2006
On unique factorizations of primitive words.
Theor. Comput. Sci., 2006

Parallelism in Gene Assembly.
Natural Computing, 2006

Undecidability of infinite post correspondence problem for instances of Size 9.
ITA, 2006

Undecidability in omega-Regular Languages.
Fundam. Inform., 2006

The Embedding Problem for Switching Classes of Graphs.
Fundam. Inform., 2006

Binary Words with Few Squares.
Bulletin of the EATCS, 2006

Positivity of second order linear recurrent sequences.
Discrete Applied Mathematics, 2006

Periods in Extensions of Words.
Acta Inf., 2006

Embedding linear orders in grids.
Acta Inf., 2006

Modelling Simple Operations for Gene Assembly.
Proceedings of the Nanotechnology: Science and Computation, 2006

Complexity Measures for Gene Assembly.
Proceedings of the Knowledge Discovery and Emergent Complexity in Bioinformatics, 2006

2005
Counting bordered and primitive words with a fixed weight.
Theor. Comput. Sci., 2005

On the equation in a free semigroup.
Theor. Comput. Sci., 2005

A characterization of periodicity of bi-infinite words.
Theor. Comput. Sci., 2005

Preface.
Theor. Comput. Sci., 2005

Equality sets for recursively enumerable languages.
ITA, 2005

Equality sets of prefix morphisms and regular star languages.
Inf. Process. Lett., 2005

Representation of Regular Languages by Equality Sets.
Bulletin of the EATCS, 2005

Characterizations of Regularity.
Proceedings of the Finite-State Methods and Natural Language Processing, 2005

Simple Operations for Gene Assembly.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

Combinatorial Models of Gene Assembly.
Proceedings of the New Computational Paradigms, 2005

2004
Many aspects of defect theorems.
Theor. Comput. Sci., 2004

A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs.
SIAM J. Discrete Math., 2004

Border correlation of binary words.
J. Comb. Theory, Ser. A, 2004

Minimal Duval Extensions.
Int. J. Found. Comput. Sci., 2004

Gene Assembly in Celiates. Part I. Molecular Operations (Column: Natural Computing).
Bulletin of the EATCS, 2004

Transitivity of local complementation and switching on graphs.
Discrete Mathematics, 2004

Periodicity and Unbordered Words: A Proof of Duval?s Conjecture.
Proceedings of the STACS 2004, 2004

Tutorial on DNA Computing and Graph Transformation.
Proceedings of the Graph Transformations, Second International Conference, 2004

Embedding in Switching Classes with Skew Gains.
Proceedings of the Graph Transformations, Second International Conference, 2004

Splicing Systems for Universal Turing Machines.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Parallelism in Gene Assembly.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Two Models for Gene Assembly in Ciliates.
Proceedings of the Theory Is Forever, 2004

Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs.
Proceedings of the Aspects of Molecular Computing, 2004

2003
On the independence of equations in three variables.
Theor. Comput. Sci., 2003

Formal systems for gene assembly in ciliates.
Theor. Comput. Sci., 2003

Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes.
Fundam. Inform., 2003

Gene Assembly in Ciliates Part I. Molecular Operations.
Bulletin of the EATCS, 2003

Periodicity and Unbordered Segments of Words.
Bulletin of the EATCS, 2003

Decidability of the binary infinite Post Correspondence Problem.
Discrete Applied Mathematics, 2003

Periodicity and Unbordered Words: A Proof of the Extended Duval Conjecture
CoRR, 2003

Languages Defined by Generalized Equality Sets.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

About Duval's Conjecture.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Binary (generalized) Post Correspondence Problem.
Theor. Comput. Sci., 2002

Gene assembly through cyclic graph decomposition.
Theor. Comput. Sci., 2002

Characterizing the Micronuclear Gene Patterns in Ciliates.
Theory Comput. Syst., 2002

Some Decision Problems Concerning Semilinearity and Commutation.
J. Comput. Syst. Sci., 2002

Density of Critical Factorizations.
ITA, 2002

Tutorial on DNA Computing and Graph Transformation - Computational Nature of Gene Assembly in Ciliates.
Proceedings of the Graph Transformation, First International Conference, 2002

Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes.
Proceedings of the Graph Transformation, First International Conference, 2002

Computational Processes in Living Cells: Gene Assembly in Ciliates.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Infinite Solutions of Marked Post Correspondence Problem.
Proceedings of the Formal and Natural Computing, 2002

2001
Mortality in Matrix Semigroups.
The American Mathematical Monthly, 2001

Some New Results on Post Correspondence Problem and Its Modifications.
Bulletin of the EATCS, 2001

Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Patterns of Micronuclear Genes in ciliates.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

Decision Questions on Integer Matrices.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

An Undecidability Result Concerning Periodic Morphisms.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Forbidden subsequences and permutations sortable on two parallel stacks.
Proceedings of the Where Mathematics, 2001

2000
Periods and Binary Words.
J. Comb. Theory, Ser. A, 2000

Pancyclicity in switching classes.
Inf. Process. Lett., 2000

Generalized Post Correspondence Problem for Marked Morphisms.
IJAC, 2000

The size of switching classes with skew gains.
Discrete Mathematics, 2000

1999
Undecidability of the equivalence of finite substitutions on regular language.
ITA, 1999

On the Undecidability of Freeness of Matrix Semigroups.
IJAC, 1999

Undecidability in Integer Weighted Finite Automata.
Fundam. Inform., 1999

Generalized PCP Is Decidable for Marked Morphisms.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Languages Accepted by Integer Weighted Finite Automata.
Proceedings of the Jewels are Forever, 1999

The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs.
World Scientific, ISBN: 978-981-02-4042-4, 1999

1998
On Quasi Orders of Words and the Confluence Property.
Theor. Comput. Sci., 1998

Acyclicity of Switching Classes.
Eur. J. Comb., 1998

Permutations, parenthesis words, and Schröder numbers.
Discrete Mathematics, 1998

Complexity Issues in Switching of Graphs.
Proceedings of the Theory and Application of Graph Transformations, 1998

Shuffle on Trajectories: The Schützenberger Product and Related Operations.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
A Note on Decidability Questions on Presentations of Word Semigroups.
Theor. Comput. Sci., 1997

Invariants of Inversive 2-Structures on Groups of Labels.
Mathematical Structures in Computer Science, 1997

Languages Obtained from Infinite Words.
ITA, 1997

On a Geometric Problem of Zigzags.
Inf. Process. Lett., 1997

Compactness of Systems of Equations in Semigroups.
IJAC, 1997

2-Structures - A Framework For Decomposition And Transformation Of Graphs.
Proceedings of the Handbook of Graph Grammars and Computing by Graph Transformations, 1997

Compactness of Systems of Equations on Completely Regular Semigroups.
Proceedings of the Structures in Logic and Computer Science, 1997

1996
Flatwords and Post Correspondence Problem.
Theor. Comput. Sci., 1996

Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures.
Theor. Comput. Sci., 1996

Remarks on Generalized Post Correspondence Problem.
Proceedings of the STACS 96, 1996

1995
Compactness of Systems of Equations in Semigroups.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Theory of 2-Structures.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
Representation of Rational Functions with Prefix and Suffix Codings.
Theor. Comput. Sci., 1994

The Intersection Problem for Alphabetic Vector Monoids.
ITA, 1994

Reductions for Primitive 2-Structures.
Fundam. Inform., 1994

Incremental construction of 2-structures.
Discrete Mathematics, 1994

Group Based Graph Transformations and Hierarchical Representations of Graphs.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Decompostion of Infinite Labeled 2-Structures.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Identities and Transductions.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
Morphisms and rational tranducers.
Bulletin of the EATCS, 1993

1992
Compositional representation of rational functions.
ITA, 1992

Deterministic Sequential Functions.
Acta Inf., 1992

1991
The Equivalence Problem of Multitape Finite Automata.
Theor. Comput. Sci., 1991

Decidability problems for unary output sequential transducers.
Discrete Applied Mathematics, 1991

Splicing semigroups of dominoes and DNA.
Discrete Applied Mathematics, 1991

1990
Decidability of the Multiplicity Equivalence of Multitape Finite Automata
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989
Cardinality Problems of Composition of Morphisms and Inverse Morphisms.
Mathematical Systems Theory, 1989

Dominoes and the Regularity of DNS Splicing Languages.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1986
On the Periodicity of Morphisms on Free Monoids.
ITA, 1986

On morphic generation of regular languages.
Discrete Applied Mathematics, 1986

1984
The Equations h(w)=w-n in Binary Alphabets.
Theor. Comput. Sci., 1984

The omega-Sequence Problem for DOL Systems Is Decidable.
J. ACM, 1984

1982
Dominoes Over a Free Monoid.
Theor. Comput. Sci., 1982

1981
The omega-Sequence Equivalence Problem for DOL Systems Is Decidable
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1979
A Simulation Result for the Auxiliary Pushdown Automata.
J. Comput. Syst. Sci., 1979

1977
A Polynomial Recognition Algorithm for the EDTOL Languages.
Elektronische Informationsverarbeitung und Kybernetik, 1977


  Loading...