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.
- Undecidability of infinite post correspondence problem for instances of size 9 (2006)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - Equality sets for recursively enumerable languages (2005)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - Equality sets of prefix morphisms and regular star languages (2005)
- Information Processing Letters
(A1 Refereed original research article in a scientific journal) - Integer weighted finite automata, matrices, and formal power series-over Laurent polynomials (2004)
- Lecture Notes in Computer Science
(A3 Refereed book chapter or chapter in a compilation book) - Undecidability in matrices over Laurent polynomials\ (2004)
- Advances in Applied Mathematics
(A1 Refereed original research article in a scientific journal) - Decidability of the binary infinite post correspondence problem (2003)
- Discrete Applied Mathematics
(A1 Refereed original research article in a scientific journal) - Languages defined by generalized equality sets (2003)
- Lecture Notes in Computer Science
(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 ) - Binary (generalized) Post Correspondence Problem (2002)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Marked PCP is decidable (2001)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal)
