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.
1 of 4
- Codes, Graphs, Coverings, and Identification: Special Issue Honoring the 60-th Birthday of Professor Iiro Honkala (2024)
- Fundamenta Informaticae
- Codes, Graphs, Coverings, and Identification: Special Issue Honoring the 60-th Birthday of Professor Iiro Honkala (Preface) (2024)
- Fundamenta Informaticae
- Decision Problems on Copying and ShufflingUndecidability in Finite Transducers, Defense Systems and Finite Substitutions (2024)
- Fundamenta Informaticae
- On simulating Turing machines with matrix semigroups with integrality tests (2024)
- Theoretical Computer SciencearXiv.org
- Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial TimeOn Shuffling a Word with its Letter-to-Letter Substitution (2023)
- International Journal of Foundations of Computer Science
- Highly Tuneable Photochromic Sodalites for Dosimetry, Security Marking and Imaging (2023)
- Advanced Functional Materials
- Integer Weighted Automata on Infinite Words (2023)
- International Journal of Foundations of Computer Science
- On bi-infinite and conjugate post correspondence problems (2023)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and ApplicationsTheoretical Computer Science
- Certain linear and weakly linear systems of matrix equations over semirings. Applications in a state reduction of weighted automataPreface -- Russian-Finnish Symposium in Discrete Mathematics (Fundamenta Informaticae, vol. 162, no. 2-3, pp. i-i, 2018) (2022)
- FilomatFundamenta Informaticae
- Integer Weighted Automata on Infinite Words (2021)
- Lecture Notes in Computer ScienceFundamenta Informaticae
- 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
- (2021)
- (2020)
- Fundamenta Informaticae
- On the Steps of Emil Post: from Normal Systems to the Correspondence Decision Problem (2020)
- Acta CyberneticaInformation and Computation
- On fixed points of rational transductions (2018)
- (2018)
- A new proof for undecidability of the bi-infinite post correspondence problem (2017)
- Small semi-thue system universal with respect to the termination problem (2017)
- Fundamenta Informaticae
- Walks on tilings of polygons (2017)
- Theoretical Computer Science
- Weighted automata on infinite words in the context of Attacker-Defender games (2017)
UTU Research Portal