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.
2 of 8
- Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics (2021) Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics Hakanen Anni, Halava Vesa, Herva Pyry, Kari Jarkko, Laihonen Tero, Petre Ion, Saarela Aleksi
- Undecidability in Finite Transducers, Defense Systems and Finite Substitutions (2021)
- arXiv.org
- On Shuffling a Word with its Letter-to-Letter SubstitutionOn the Steps of Emil Post: from Normal Systems to the Correspondence Decision Problem (2020)
- Fundamenta Informaticae
- (2020)
- Acta CyberneticaTheoretical Computer Science
- On fixed points of rational transductions (2018)
- Preface -- Russian-Finnish Symposium in Discrete Mathematics (Fundamenta Informaticae, vol. 162, no. 2-3, pp. i-i, 2018) (2018)
- Fundamenta Informaticae
- A new proof for undecidability of the bi-infinite post correspondence problem (2017)
- Fundamenta InformaticaeFundamenta Informaticae
- Small semi-thue system universal with respect to the termination problemWalks on tilings of polygons (2017)
- (2017)
- Theoretical Computer Science
- Weighted automata on infinite words in the context of Attacker-Defender games (2017)
- Information and Computation
UTU Research Portal