Harju, Tero

name

• Harju, Tero

Authored works

• A characterization of the periodicity of bi-infinite words
• A combinatorial view on gene assembly
• About Duval's conjecture
• Binary words with few squares
• Border correlation of binary words
• Counting bordered and primitive words with a fixed weight
• Decision questions on integer matrices
• Duval's conjecture and Lyndon words
• Examples on parallel complexity of signed graphs
• Formal properties of gene assembly : equivalence problem for overlap graphs
• Gene assembly in ciliates : formal frameworks
• Languages obtained from infinite words
• Minimal Duval extensions
• Modelling simple operations for gene assembly
• On commutation and primitive roots of codes
• On quasi orders of words and the confluence property
• On the density of critical factorizations
• On the equation x[sup k]=z[sub 1][sup k[sub 1]]z[sub 2][sup k[sub 2]]...z[sub n][sup k[sub n]] in a free semigroup
• On the independence of equations in three variables
• On unique factorizations of primitive words
• Periodicity and unbordered words
• Periods in extensions of words
• Shuffle on trajectories : a simplified approach to the Schützenberger product and related operations
• Simulation and representation of automata using auxiliary tape notation
• Sorting permutations on two parallel stacks
• The equation a[sup M]=b[sup N]c[sup P] in a free semigroup
• Two models for gene assembly in ciliates

Works contributed to

• Characterization of infinite solutions of marked and binary post correspondence problems
• Complexity measures for gene assembly
• Decidability of binary infinite post correspondence problem
• Decision questions concerning semilinearity, morphisms and commutation of languages
• Defect theorems with compatibility relation
• Embedding linear orders in grids
• Equality sets of prefix morphisms and regular star languages
• Finite metrics in switching classes
• Generalized PCP is decidable for marked morphisms
• Infinite solutions of marked post correspondence problem
• Interaction properties of relational periods
• Languages accepted by integer weighted finite automata
• On a geometric problem of Zig-Zags
• On Markov's undecidability theorem for integer matrices
• On the decidability of the freeness of matrix semigroups
• Parallelism in gene assembly
• Periods and binary words
• Positivity of second order linear recurrent sequences
• Proceedings of the seventh Nordic Combinatorial Conference : Turku, August 16-18, 1999
• Proceedings of WORDS'03
• Relational codes of words
• Simple operations for gene assembly
• Some new results on post correspondence problem and its modifications
• The theorem of Fine and Wilf for relational periods
• Transitivity of local complementation and switching on graphs
• Undecidability bounds for integer matrices using Claus instances
• Undecidability in [omega]-regular languages
• Undecidability in integer weighted finite automata
• Undecidability in matrices over Laurent polynomials
• Undecidability of infinite Post Correspondence Problem for instances of size 9
• Undecidability of the equivalence of finite substitutions on regular language
• Weinbaum factorizations of primitive words
• Zebra factorizations in free semigroups

Works about Harju, Tero