Share to: share facebook share twitter share wa share telegram print page

Juhani Karhumäki

Juhani Karhumäki
Born (1949-08-20) August 20, 1949 (age 75)
Jyväskylän maalaiskunta, Finland
Alma materUniversity of Turku
Known forcombinatorics on words, equivalence problem for multitape finite automata
Scientific career
FieldsTheoretical computer science
Automata theory
Combinatorics on words
InstitutionsUniversity of Turku
Doctoral advisorArto Salomaa

Eero Urho Juhani Karhumäki[1] (born 1949) is a Finnish mathematician and theoretical computer scientist known for his contributions to automata theory. He is a professor at the University of Turku in southwestern Finland.

Biography

Karhumäki earned his doctorate from the University of Turku in 1976. In 1980–1985, he was a junior researcher of Academy of Finland. Since 1986, he has held teaching positions at the University of Turku, attaining full professorship in 1998. In 1998–2015, Karhumäki was the head of the mathematics department at the University of Turku. He has authored altogether around 200 research papers.

Karhumäki is a member of the Finnish Academy of Science and Letters since 2000 and of Academia Europaea since 2006. A festschrift in his honour was published in 2009 as a special issue of Theoretical Computer Science.[2]

Research contributions

Karhumäki has been a member of the Lothaire group of mathematicians that developed the foundations of combinatorics of words. In 1991, jointly with Tero Harju, he solved the long-standing equivalence problem for multitape finite automata in automata theory.[3] Karhumäki contributed to different areas of formal language theory, such as word equations,[4] language equations[5] and descriptional complexity of finite automata.[6]

References

  1. ^ "Luonnontieteiden ja tekniikan tiedekunnan yksiköt".
  2. ^ "Preface". Theoretical Computer Science. 410 (30–32): 2785–2794. 2009. doi:10.1016/j.tcs.2009.04.014. ISSN 0304-3975.
  3. ^ Harju, T.; Karhumäki, J. (1991). "The equivalence problem of multitape finite automata". Theoretical Computer Science. 78 (2): 347–355. doi:10.1016/0304-3975(91)90356-7. ISSN 0304-3975.
  4. ^ Karhumäki, Juhani; Mignosi, Filippo; Plandowski, Wojciech (2000). "The expressibility of languages and relations by word equations". Journal of the ACM. 47 (3): 483–505. doi:10.1145/337244.337255. ISSN 0004-5411. S2CID 16088773.
  5. ^ Karhumäki, Juhani; Petre, Ion (2002). "Conway's problem for three-word sets". Theoretical Computer Science. 289 (1): 705–725. doi:10.1016/S0304-3975(01)00389-9. ISSN 0304-3975.
  6. ^ Hromkovič, Juraj; Seibert, Sebastian; Karhumäki, Juhani; Klauck, Hartmut; Schnitger, Georg (2002). "Communication Complexity Method for Measuring Nondeterminism in Finite Automata". Information and Computation. 172 (2): 202–217. doi:10.1006/inco.2001.3069. ISSN 0890-5401.
Kembali kehalaman sebelumnya