Where academic tradition
meets the exciting future

FUNDIM, Fundamentals of Computing and Discrete Mathematics

FUNDIM Centre carries out basic research in discrete mathematics and computing. More specifically research topics cover

Research is typically in cooperation with foreign partners.

Research Unit Web Page: http://www.math.utu.fi/projects/fundim/

Leader of the unit

Juhani Karhumäki

Research Groups

Automata and Combinatorics on Words

Leaders: Juhani Karhumäki
Tero Harju
Senior researchers:    Juha Honkala
Alexander Okhotin
Vesa Halava
Tomi Kärki
Svetlana Puzynina
Researchers: Alexi Saarela
Mari Huova
Doctoral students:       Markku Laine
Markus Whiteland
Mikhail Barash


Coding Theory Group

Leaders: Iiro Honkala
Senior researchers:    Jyrki Lahtonen
Tero Laihonen
Roope Vehkalahti
Researchers: Camilla Hollanti
Mikko Pelto
Ville Junnila
Petri Rosendahl
Doctoral students:       Toni Ernvall


Discrete Complex Systems

Leaders: Jarkko Kari
Senior researchers:    Mika Hirvensalo
Researchers: Ville Salo
Doctoral students:       S. Carlampos
Michael Szabodas
Ilkka Törmä


FiDiPro group

Leaders: Luca Zamboni
Juhani Karhumäki
Doctoral students:       Jetro Vesti
Jarkko Peltomäki


Cryptography and Data Security

Leaders: Valtteri Niemi
Researchers: Tommi Meskanen
Doctoral students:       Noora Nieminen


Projects 

FiDiPro project on Words, Numbers and Tilings with applications

2010-2015, Total budget 2.500.000 euros (1.400.000 from the Academy of Finland)

Research grant (Juhani Karhumäki)

2012-2016, from the Academy of Finland, 500.000 euros

Sabbatical grant (Jarkko Kari)

Three post doc grants (A. Saarela, M. Huova and V. Salo)

Finnish Cultural Foundation and Magnus Ehrnrooth Foundation

Publications 

Click here to see the full list of publications from the TUCS Publication Database

The latest updated publications:

Yo-Sub Han, Arto Salomaa, Kai Salomaa, Ambiguity, Non-Determinism and State Complexity of Finite Automata. Acta Cybernetica 23, 141–157, 2017.

Arto Salomaa, Minimal Reaction Systems: Duration and Blips. Theoretical Computer Science 682C, 208–216, 2017.

Jarkko Peltomäki, Markus Whiteland, A Square Root Map on Sturmian Words. Electronic Journal of Combinatorics 24(1), 1–50, 2017.

Arto Salomaa, The Depth of Closed Classes of Truth Functions in Many-Valued Logic. In: Stavros Konstantinidis, Nelma Moreira, Rogerio Reis, Jeffrey Shallit (Eds.), The Role of Theory in Computer Science, 203–216, World Scientific, 2017.

Juhani Karhumäki, Aleksi Saarela (Eds.), Proceedings of the Fourth Russian Finnish Symposium on Discrete Mathematics, TUCS Lecture Notes, 2017.

Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Jarkko Peltomäki, Élise Prieur-Gaston, Abelian Powers and Repetitions in Sturmian Words. Theoretical Computer Science 635, 16–34, 2016.

Michael Forsyth, Amlesh Jayakumar, Jarkko Peltomäki, Jeffrey Shallit, Remarks on Privileged Words. International Journal of Foundations of Computer Science 27(4), 431–442, 2016.

Juhani Karhumäki, Aleksi Saarela (Eds.), Proceedings of the Finnish Mathematical Days 2016, TUCS Lecture Notes, 2016.

Jarkko Peltomäki, Privileged Words and Sturmian Words. TUCS Dissertations 214. 2016.