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 3
- ON THE NUMBER OF SQUARES IN PARTIAL WORDSInteraction properties of relational periods (2010)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and ApplicationsDiscrete Mathematics and Theoretical Computer Science
- On the Periodicity of Morphic Words (2010)
- Lecture Notes in Computer Science
- Overlap-freeness in infinite partial wordsSquare-free partial words (2009)
- Theoretical Computer ScienceInformation Processing Letters
- 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
- (2008)
- Reachability probelms (RP 2007) - Preface (2008)
- International Journal of Foundations of Computer Science
- 2008
- An undecidability result concerning periodic morphisms (2002)
- Lecture Notes in Computer Science
UTU Research Portal