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 4
- Similarity relations on wordsDecision Problems for Probabilistic Finite Automata on Bounded Languages (2016) Combinatorics, Words and Symbolic Dynamics Vesa Halava, Tero Harju, Tomi Kärki
- 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
- On the n-permutation Post Correspondence Problem (2015)
- Theoretical Computer ScienceActa Informatica
- Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (2015)
- Lecture Notes in Computer Science
- Another proof of undecidability for the correspondence decision problem - Had I been Emil Post (2014)
- arXiv.orgTUCS Publication Series
- Russian-Finnish Symposium in Discrete Mathematics (2014)
- Fundamenta InformaticaeTUCS Lecture Notes
- Undecidability of the Universality Problem for 3-State Integer Weighted Büchi Automata (2014)
- TUCS Publication Series
- Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (2014)
- TUCS Publication Series
- Word problem for deterministic and reversible semi-Thue systems (2014)
- Semigroup Forum
- (2013)
- Fundamenta Informaticae
- Deterministic Semi-Thue Systems and Variants of Post Correspondence ProblemREDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM (2013)
- Lecture Notes in Computer ScienceInternational Journal of Foundations of Computer Science
- New proof for the undecidability of the circular PCP (2013)
- On n-permutation Post Correspondence Problem (2013) Vesa Halava, Tero Harju, Mari Huova
- New Proof for the Undecidability of the Circular PCP2012
- RuFiDiM II, Proceedings of the Second Russian Finnish Symposium on Discrete Mathematics 2012 (2012)
- Word Problem for deterministic and reversible semi-Thue systems (2012)
- TUCS Publication Series
- Words, Graphs, Automata, and Languages: Special Issue Honoring the 60th Birthday of Professor Tero Harju (2012)
- Fundamenta Informaticae
- A new proof for the decidability of D0L ultimate periodicity (2011)
- Electronic Proceedings in Theoretical Computer Science
- (2011)
- On the Joint Spectral Radius for Bounded Matrix Languages (2010)
- Lecture Notes in Computer Science
UTU Research Portal