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 |
Areas of expertise
computability; automata and formal languages; logic; combinatorics on words
computability; automata and formal languages; logic; combinatorics on words
Biography
I am a Professor of Discrete Mathematics and Theoretical Computer Science.
Research
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.
Teaching
I teach two course in Logic, basic course and advanced level course. I also teach Analysis I for (the first year) students of mathematics.
Publications 
2 of 3
- Similarity relations on words (2016) Combinatorics, Words and Symbolic Dynamics Vesa Halava, Tero Harju, Tomi Kärki
(A3 Refereed book chapter or chapter in a compilation book) - On Robot Games of Degree Two (2015) Language and Automata Theory and Applications - 9th International Conference, {LATA} 2015, Nice, France, March 2-6, 2015, Proceedings Vesa Halava, Reino Niskanen, Igor Potapov
(A4 Refereed article in a conference publication ) - On the n-permutation Post Correspondence Problem (2015)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (2015)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Another proof of undecidability for the correspondence decision problem - Had I been Emil Post (2014)
- arXiv.org
(B1 Non-refereed article in a scientific journal) - Russian-Finnish Symposium in Discrete Mathematics (2014)
- Fundamenta Informaticae
(Other publication) - Undecidability of the Universality Problem for 3-State Integer Weighted Büchi Automata (2014)
- TUCS Publication Series
(B1 Non-refereed article in a scientific journal) - Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (2014)
- TUCS Publication Series
(B1 Non-refereed article in a scientific journal) - Word problem for deterministic and reversible semi-Thue systems (2014)
- Semigroup Forum
(A1 Refereed original research article in a scientific journal) - Decision Problems for Probabilistic Finite Automata on Bounded Languages (2013)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem (2013)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - New proof for the undecidability of the circular PCP (2013)
- Acta Informatica
(A1 Refereed original research article in a scientific journal) - On n-permutation Post Correspondence Problem (2013) Vesa Halava, Tero Harju, Mari Huova
(D4 Published development or research report or study ) - New Proof for the Undecidability of the Circular PCP (2012)
- TUCS Publication Series
(D4 Published development or research report or study ) - RuFiDiM II, Proceedings of the Second Russian Finnish Symposium on Discrete Mathematics 2012 (2012)
- TUCS Lecture Notes
(C2 Editorial work for a scientific compilation book) - Word Problem for deterministic and reversible semi-Thue systems (2012)
- TUCS Publication Series
(D4 Published development or research report or study ) - Words, Graphs, Automata, and Languages: Special Issue Honoring the 60th Birthday of Professor Tero Harju (2012)
- Fundamenta Informaticae
(C2 Editorial work for a scientific compilation book) - A new proof for the decidability of D0L ultimate periodicity (2011)
- Electronic Proceedings in Theoretical Computer Science
(A4 Refereed article in a conference publication ) - REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM (2011)
- International Journal of Foundations of Computer Science
(A1 Refereed original research article in a scientific journal) - On the Joint Spectral Radius for Bounded Matrix Languages (2010)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication )
UTU Research Portal