Juhani Karhumäki
karhumak@utu.fi +358 40 589 6305 Vesilinnantie 5 Turku |
Publications 
4 of 5
- An Analysis and a Reproof of Hmelevskii's Theorem (Extended Abstract)Post Correspondence Problem for short words (2008)
- Lecture Notes in Computer ScienceInformation Processing Letters
(A4 Refereed article in a conference publication ) - MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM (2008)
- International Journal of Algebra and ComputationRAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - Special issue - Developments in language theory (DLT 2007) - Preface (2008)
(A1 Refereed original research article in a scientific journal) - RAIRO - Theoretical Informatics and Application Preface2008
(A1 Refereed original research article in a scientific journal) - (2008)
- International Journal of Foundations of Computer Science
(A1 Refereed original research article in a scientific journal) - Extension of the decidability of the marked PCP to instances with unique blocks (2007)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - The structure of infinite solutions of marked and binary post correspondence problems (2007)
- Theory of Computing Systems
(A1 Refereed original research article in a scientific journal) - Undecidability in omega-regular languages (2006)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - Combinatorics on words - Preface (2005)
- Theoretical Computer Science
(B1 Non-refereed article in a scientific journal) - Commutation with codesThe commutation with ternary sets of words (2005)
- Theoretical Computer ScienceTheory of Computing Systems
- (2005)
(A1 Refereed original research article in a scientific journal) - Two problems on commutation of languages2004
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - (2004) Current trends in Theoretical Computer Science (The Challenge of the New Century) Karhumäki Juhani, Petre Ion
(B2 Non-refereed book chapter or chapter in a compilation book) - Decidability of the binary infinite post correspondence problemThe commutation with codes and ternary sets of words (2003)
- Discrete Applied Mathematics
(A1 Refereed original research article in a scientific journal) - Conway's Problem for three word sets (2003) Proceedings of 21st International Symposium on Theoretical Aspects of Computer Science STACS 2003 Karhumäki Juhani, Latteux Michel, Petre Ion
(A4 Refereed article in a conference publication ) - Some decision problems concerning semilinearity and commutation (2002)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - The branching point approach to Conway Problem (2002)
- Journal of Computer and System Sciences
(A1 Refereed original research article in a scientific journal) - Decision questions concerning semilinearity, morphisms, and commutation of languages2002Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg Karhumäki Juhani, Petre Ion
(B2 Non-refereed book chapter or chapter in a compilation book) - Conway problem and the commutation of languages (2001) Karhumäki Juhani, Petre Ion
(A1 Refereed original research article in a scientific journal) - (2001)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal)
UTU Research Portal