Vesa Halava
vesa.halava@utu.fi +358 29 450 4304 +358 50 320 6267 Vesilinnantie 5 Turku Office: 368 Contact by email. ORCID identifier: https://orcid.org/0000-0003-3633-4902 |
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.
- ON THE NUMBER OF SQUARES IN PARTIAL WORDS (2010)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - On the Periodicity of Morphic Words (2010)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Overlap-freeness in infinite partial words (2009)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Reachability problems (RP 2008) - Preface (2009)
- International Journal of Foundations of Computer Science
(C2 Editorial work for a scientific compilation book) - The theorem of Fine and Wilf for relational periods (2009)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - Defect theorems with compatibility relations (2008)
- Semigroup Forum
(A1 Refereed original research article in a scientific journal) - Interaction properties of relational periods (2008)
- Discrete Mathematics and Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Reachability probelms (RP 2007) - Preface (2008)
- International Journal of Foundations of Computer Science
(C2 Editorial work for a scientific compilation book) - Square-free partial words (2008)
- Information Processing Letters
(A1 Refereed original research article in a scientific journal) - An undecidability result concerning periodic morphisms (2002)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication )