• HOME
• ABOUT US
  • Organization
  • Personnel
• NEWS&EVENTS
  • News & Events archive
  • Newsletter archive
  • Conference archive
  • Travel reports
• COOPERATION
  • International Involvement
  • National Involvement
  • Regional Involvement
• EDUCATION
  • Master's Programmes
  • TUCS Graduate Programmes
  • Information for Students
  • Courses
  • TUCS Short Courses
• PUBLICATIONS
  • TUCS Publication Series
  • How to Publish in TUCS Series
  • Publication Search
  • Publication Graph
  • Publication Input
  • Publication Input Guide
  • JuFo Browser
• RESEARCH
  • Focus areas
  • Research Programmes
  • Research Units
  • Distinguished Lectures

Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search

• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Department: Any ÅAU / Department of Information Technologies UTU / Department of Information Technology UTU / Department of Mathematics and Statistics UTU / Turku School of Economics, Institute of Information Systems Sciences

Research Unit: Any Algorithmics and Computational Intelligence Group (ACI) Biomathematics Research Unit (BIOMATH) Communication Systems (ComSys) Computational Biomodeling Laboratory (Combio Lab) Data Mining and Knowledge Management Laboratory Distributed Systems Laboratory (DS Lab) Embedded Computer and Electronic Systems (ECES) Embedded Systems Laboratory (ESLAB) FUNDIM, Fundamentals of Computing and Discrete Mathematics Institute for Advanced Management Systems Research (IAMSR) Learning and Reasoning Lab Software Construction Laboratorium Software Development Laboratory (SwDev) Software Engineering Laboratory (SE Lab) Turku BioNLP Group Turku Optimization Group (TOpGroup) UTU Information Systems Science (ISS)

Publication type: Any Monographs Edited books Edited special issues of journals Edited proceedings Articles in journals Articles in proceedings Chapters in edited books Ph.D. thesis Lic. thesis Technical reports

Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points

Sort output by publication type Sort output by publication year

and display below and download in BibTeX and download as CSV and download as 2014-CSV

Edited proceedings (1):

• Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo (Eds.), On the Periodicity of Morphic Words , Lecture Notes in Computer Science 6224, Springer-Verlag, 2010.

Articles in journals (30):

• Paul C. Bell, Vesa Halava, Mika Hirvensalo, Decision Problems for Probabilistic Finite Automata on Bounded Languages. Fundamenta Informaticae 123(1), 1–14, 2013.
• Vesa Halava, Jarkko Kari, Yuri Matiyasevich, On Post Correspondence Problem for Letter Monotonic Languages. Theoretical Computer Science 410(30-32), 2957–2960, 2009.
• Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov, Matrix Equations and Hilbert's Tenth Problem. International Journal of Algebra and Computation 18(8), 1231–1241, 2008.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki, Post Correspondence Problem for Short Words. Information Processing Letters 108(3), 115–118 , 2008.
• Vesa Halava, Tero Harju, Tomi Kärki, Defect Theorems with Compatibility Relation. Semigroup Forum 76, 1–24, 2008.
• Vesa Halava, Tero Harju, Tomi Kärki, Defect Theorems with Compatibility Relations. Semigroup Forum 76(1), 1–24, 2008.
• Vesa Halava, Tero Harju, Tomi Kärki, Interaction Properties of Relational Words. Discrete Math.ematics & Theoretical Computer Science 10, 87-112, 2008.
• Vesa Halava, Tero Harju, Juhani Karhumäki, The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. Theory of Computing Systems 40(1), 43–54, 2007.
• Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux, Extension of the Decidability of the Marked PCP to Instances with Unique Blocks. Theoretical Computer Science 380(3), 355–362, 2007.
• Vesa Halava, Tero Harju, Tomi Kärki, Relational Codes of Words. Theoret. Comput. Sci 389, 237-249, 2007.
• Vesa Halava, Tero Harju, Undecidability of Infinite Post Correspondence Problem for Instances of Size 9. Theoretical Informatics and Applications 40, 551-557, 2006.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Positivity of Second Order Linear Recurrent Sequences. Discrete Applied Mathematics 154(3), 447–451, 2006.
• Vesa Halava, Tero Harju, Juhani Karhumäki, Undecidability in omega-Regular Languages. Fundamenta Informaticae 73(1-2), 1–7, 2006.
• Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux, Equality Sets for Recursively Enumerable Languages. Theoretical Informatics and Applications 39(4), 661-675, 2005.
• Vesa Halava, Tero Harju, Michel Latteux, Representation of Regular Languages by Equality Sets. Bulletin of the EATCS (86), 225-228, 2005.
• Vesa Halava, Tero Harju, Michel Latteux, Equality Sets of Prefix Morphisms and Regular Star Languages. Information Processing Letters 94(4), 151–154, 2005.
• Vesa Halava, Ratkeavuuden ja ratkeamattomuuden välinen raja ja Postin vastaavuusongelma. Tietojenkäsittelytiede 21, 8-18, 2004.
• Vesa Halava, Tero Harju, Undecidability in Matrices over Laurent Polynomials. Advances in Applied Mathematics 33(4), 747–752, 2004.
• Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux, Valence Languages Generated by Equality Sets. Journal of Automata, Languages and Combinatorics 9, 399–406, 2004.
• Vesa Halava, Tero Harju, Juhani Karhumäki, Decidability of Binary Infinite Post Correspondence Problem. Discrete Applied Mathematics 130, 521–526, 2003.
• Vesa Halava, Tero Harju, An undecidability result concerning periodic morphisms. LNCS (2295), 304-310, 2002.
• Vesa Halava, Tero Harju, Infinite solutions of marked Post Correspondence Problem. LNCS (2300), 57-68, 2002.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Binary (generalized) Post Correspondence Problem. Theoretical Computer Science 1-2(276), 183–204, 2002.
• Vesa Halava, Tero Harju, Some New Results in Post Correspondence Problem and Its Modifications. Bulletin of the EATCS (73), 131-141, 2001.
• Vesa Halava, Mika Hirvensalo, Ronald de Wolf, Marked PCP is decidable. Theoret. Comput. Sci. 255(1), 193-204, 2001.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Generalized Post Correspondence Problem is decidable for marked morphisms. Internat. J. Algebra Comput. 10(6), (757-772), 2000.
• Vesa Halava, Tero Harju, Lucian Ilie, Periods and Binary Words. Journal of Combinatorial Theory, Series A 89, 298-303, 2000.
• Vesa Halava, Tero Harju, Undecidability in Integer Weighted Finite Automata. Fundamenta Informatica 34, 189-200, 1999.
• Vesa Halava, Tero Harju, Undecidability of the Equivalence of Finite Substitutions on Regular Language. RAIRO Theoret. Informatics Appl. 33, 117-124, 1999.
• Vesa Halava, Tero Harju, Lucian Ilie, On a geometric problem of zig-zags. Information Processing Letters 62, 1–4, 1997.

Articles in proceedings (10):

• Vesa Halava, Tero Harju, Tomi Kärki, Luca Q. Zamboni, Relational Fine and Wilf Words. In: N. Bedaride J. Cassaigne P. Arnoux (Ed.), WORDS 2007, Proceedings of the 6th International Conference on Words, 159-167, 2007.
• Vesa Halava, Tero Harju, Juhani Karhumäki, Characterization of Infinite Solutions of Marked Post Correspondence Problems. In: Proceedings of the Workshop on Word Avoidability, Complexity and Morphisms, LaRIA Technical report, 43-48, 2004.
• Vesa Halava, Ratkeavuus vs. ratkeamattomuus Postin vastaavuusongelmassa. In: Tietojenkäsittelytieteen päivät 2003, 13-16, 2003.
• Vesa Halava, Decidability in Infinite Post Correspondence Problem. In: Proceedings of WORDS'03, TUCS General Publications, 382-391, 2003.
• Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux, Languages Defined by Generalized Equality Sets. In: FCT'03, Fundamentals of Computation Theory, Lecture Notes in Computer Science 2751, 355–363, Springer, 2003.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki, (G)PCP for words of length two. In: 9-ème Conférence Internationale Journées Montoises d'Informatique Théorique, 2002.
• Vesa Halava, Stepan Holub, Binary generalized Post Correspondence Problem is decidable in polynomial time. In: 9-ème Conférence Internationale Journées Montoises d'Informatique Théorique, 2002.
• Vesa Halava, On Marked Post Correspondence Problem. In: Proceedings of the Seventh Nordic Combinatorial Conference, TUCS General Publications, 23-30, 1999.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Generalized PCP is Decidable for Marked Morphisms. In: FCT'99, Fundamentals of Computation Theory, Lecture Notes in Computer Science 1684, 304–315, Springer, 1999.
• Vesa Halava, Mika Hirvensalo, Ronald de Wolf, Decidability and Undecidability of Marked PCP. In: Sophie Tison Christoph Meinel (Ed.), STACS'99, Lecture Notes in Computer Science (LNCS) 1563, 207-216, Springer Verlag, 1999.

Chapters in edited books (3):

• Vesa Halava, Integer Weighted Finite Automata, Matrices and Formal Power Series over Laurent Polynomials. In: H. Maurer G. Paun G. Rozenberg J. karhumäki (Ed.), Theory is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday, Lecture Notes in Computer Science 3113, 81–88, Springer, 2004.
• Vesa Halava, Tero Harju, Post Correspondence Problem -- Recent Results. In: G. Rozenberg A. Salomaa G. Paun (Ed.), Current Trends in Theoretical Computer Science, 2 Formal Models and Semantics, 511–532, World Scientific, 2004.
• Vesa Halava, Tero Harju, Languages Accepted by Integer Weighted Finite Automata. In: H.Maurer G. Paun J. Karhumäki, G. Rozenberg (Eds.), Jewels are forever, 123–134, Springer, 1999.

TUCS General Series (1):

• Mika Hirvensalo, Vesa Halava, Igor Potapov, Jarkko Kari (Eds.), Proceedings of the Satellite Workshops of DLT 2007, TUCS General Publication, Turku Centre for Computer Science, 2007.

TUCS Lecture Notes (1):

• Vesa Halava, Juhani Karhumäki, Yuri Matiyasevich (Eds.), RuFiDiM II, Proceedings of the Second Russian Finnish Symposium on Discrete Mathematics 2012, TUCS Lecture Notes, 2012.

Ph.D. thesis (1):

• Vesa Halava, The Post Correspondence Problem for Marked Morphisms. TUCS Dissertations 37. Turku Centre for Computer Science, 2002.

Licenciate thesis (1):

• Vesa Halava, Finite Substitutions and Integer Weighted Finite Automata. 1998.

Technical reports (53):

• Vesa Halava, Tero Harju, Teemu Pirttimäki, Compactness and Elementary Proof of Woodin's Theorem. TUCS Technical Reports 1212, 2020.
• Vesa Halava, Teemu Pirttimäki, Model theoretic aspects of Kolmogorov quotients. TUCS Technical Reports 1211, TUCS, 2020.