2009 |
31 | EE | 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) |
2008 |
30 | EE | Vesa Halava,
Igor Potapov:
Preface.
Electr. Notes Theor. Comput. Sci. 223: 1-2 (2008) |
29 | EE | Paul Bell,
Vesa Halava,
Tero Harju,
Juhani Karhumäki,
Igor Potapov:
Matrix Equations and Hilbert's Tenth Problem.
IJAC 18(8): 1231-1241 (2008) |
28 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo,
Juhani Karhumäki:
Post Correspondence Problem for short words.
Inf. Process. Lett. 108(3): 115-118 (2008) |
27 | EE | Vesa Halava,
Tero Harju,
Tomi Kärki:
Square-free partial words.
Inf. Process. Lett. 108(5): 290-292 (2008) |
26 | EE | Vesa Halava,
Igor Potapov:
Preface.
Int. J. Found. Comput. Sci. 19(4): 915-917 (2008) |
2007 |
25 | EE | Vesa Halava,
Mika Hirvensalo:
Improved matrix pair undecidability results.
Acta Inf. 44(3-4): 191-205 (2007) |
24 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Undecidability Bounds for Integer Matrices Using Claus Instances.
Int. J. Found. Comput. Sci. 18(5): 931-948 (2007) |
23 | EE | 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) |
22 | EE | Vesa Halava,
Tero Harju,
Tomi Kärki:
Relational codes of words.
Theor. Comput. Sci. 389(1-2): 237-249 (2007) |
21 | EE | 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) |
2006 |
20 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Positivity of second order linear recurrent sequences.
Discrete Applied Mathematics 154(3): 447-451 (2006) |
19 | EE | Vesa Halava,
Tero Harju,
Juhani Karhumäki:
Undecidability in omega-Regular Languages.
Fundam. Inform. 73(1-2): 119-125 (2006) |
2005 |
18 | | Vesa Halava,
Tero Harju,
Michel Latteux:
Representation of Regular Languages by Equality Sets.
Bulletin of the EATCS 86: 224-228 (2005) |
17 | EE | Vesa Halava,
Tero Harju,
Michel Latteux:
Equality sets of prefix morphisms and regular star languages.
Inf. Process. Lett. 94(4): 151-154 (2005) |
2004 |
16 | EE | Vesa Halava:
Integer Weighted Finite Automata, Matrices, and Formal Power Series over Laurent Polynomials.
Theory Is Forever 2004: 81-88 |
2003 |
15 | EE | Vesa Halava,
Tero Harju,
Hendrik Jan Hoogeboom,
Michel Latteux:
Languages Defined by Generalized Equality Sets.
FCT 2003: 355-363 |
14 | EE | Vesa Halava,
Tero Harju,
Juhani Karhumäki:
Decidability of the binary infinite Post Correspondence Problem.
Discrete Applied Mathematics 130(3): 521-526 (2003) |
2002 |
13 | EE | Vesa Halava,
Tero Harju:
Infinite Solutions of Marked Post Correspondence Problem.
Formal and Natural Computing 2002: 57-68 |
12 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Binary (generalized) Post Correspondence Problem.
Theor. Comput. Sci. 276(1-2): 183-204 (2002) |
2001 |
11 | EE | Vesa Halava,
Tero Harju:
An Undecidability Result Concerning Periodic Morphisms.
Developments in Language Theory 2001: 304-310 |
10 | | Vesa Halava,
Tero Harju:
Some New Results on Post Correspondence Problem and Its Modifications.
Bulletin of the EATCS 73: 131-141 (2001) |
9 | EE | Vesa Halava,
Mika Hirvensalo,
Ronald de Wolf:
Marked PCP is decidable.
Theor. Comput. Sci. 255(1-2): 193-204 (2001) |
2000 |
8 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Generalized Post Correspondence Problem for Marked Morphisms.
IJAC 10(6): 757-772 (2000) |
7 | EE | Vesa Halava,
Tero Harju,
Lucian Ilie:
Periods and Binary Words.
J. Comb. Theory, Ser. A 89(2): 298-303 (2000) |
1999 |
6 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Generalized PCP Is Decidable for Marked Morphisms.
FCT 1999: 304-315 |
5 | | Vesa Halava,
Tero Harju:
Languages Accepted by Integer Weighted Finite Automata.
Jewels are Forever 1999: 123-134 |
4 | EE | Vesa Halava,
Mika Hirvensalo,
Ronald de Wolf:
Decidability and Undecidability of Marked PCP.
STACS 1999: 207-216 |
3 | | Vesa Halava,
Tero Harju:
Undecidability in Integer Weighted Finite Automata.
Fundam. Inform. 38(1-2): 189-200 (1999) |
2 | | Vesa Halava,
Tero Harju:
Undecidability of the equivalence of finite substitutions on regular language.
ITA 33(2): 117-124 (1999) |
1997 |
1 | EE | Vesa Halava,
Tero Harju,
Lucian Ilie:
On a Geometric Problem of Zigzags.
Inf. Process. Lett. 62(1): 1-4 (1997) |