Vesa Halava
vesa.halava@utu.fi +358 29 450 4304 +358 50 320 6267 Vesilinnantie 5 Turku : 368 Contact by email. |
computability; automata and formal languages; logic; combinatorics on words
I am a Professor of Discrete Mathematics and Theoretical Computer Science.
My main field of research is in the field of Computability, more precisely on undecidable problems in automata and formal langauges and in the semigroups generated by integer matrices. Recently, I have also focused on the Foundations of Computation and related issues in the Foundations of Mathematics -- in Logic and Set Theory. I have also published articles in Combinatorics on Words.
I teach two course in Logic, basic course and advanced level course. I also teach Analysis I for (the first year) students of mathematics.
3 of 4
- ON THE NUMBER OF SQUARES IN PARTIAL WORDS (2010)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- On the Periodicity of Morphic Words (2010)
- Lecture Notes in Computer Science
- On post correspondence problem for letter monotonic languages (2009)
- Theoretical Computer Science
- Overlap-freeness in infinite partial words (2009)
- Theoretical Computer Science
- Reachability problems (RP 2008) - Preface (2009)
- International Journal of Foundations of Computer Science
- The theorem of Fine and Wilf for relational periods (2009)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
- Defect theorems with compatibility relations (2008)
- Semigroup Forum
- Interaction properties of relational periods (2008)
- Discrete Mathematics and Theoretical Computer Science
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM (2008)
- International Journal of Algebra and Computation
- Post Correspondence Problem for short words (2008)
- Information Processing Letters
- Reachability probelms (RP 2007) - Preface (2008)
- International Journal of Foundations of Computer Science
- Square-free partial words (2008)
- Information Processing Letters
- Extension of the decidability of the marked PCP to instances with unique blocks (2007)
- Theoretical Computer Science
- Improved matrix pair undecidability results (2007)
- Acta Informatica
- On Markov's undecidability theorem for integer matrices (2007)
- Semigroup Forum
- Relational codes of words (2007)
- Theoretical Computer Science
- The structure of infinite solutions of marked and binary post correspondence problems (2007)
- Theory of Computing Systems
- Undecidability bounds for integer matrices using claus instances (2007)
- International Journal of Foundations of Computer Science
- Positivity of second order linear recurrent sequences (2006)
- Discrete Applied Mathematics
- Undecidability in omega-regular languages (2006)
- Fundamenta Informaticae
UTU Research Portal