Karhumäki, Juhani

name

• Karhumäki, Juhani

Authored works

• A lower bound for a constant in Shallit's conjecture
• Combinatorial and computational problems of finite sets of words
• Combinatorics on infinite words
• Combinatorics on Words : a new challenging topic
• Commutation with codes
• Computing by commuting
• Defect theorems for trees
• Finite sets of words and computing (a survey)
• Generalized factorizations of words and their algorithmic properties
• Locally periodic infinite words and a chaotic behaviour
• Multiple factorizations of words and defect effect
• On defect effect of bi-infinite words
• On some special equations on words
• On the centralizer of a finite set
• On the equivalence of finite substitutions and transducers
• On the expressibility of languages by word equations with a bounded number of variables
• Pattern matching problems for 2-dimensional images described by finite automata
• Polynomial versus exponential growth in repetition-free binary words
• Sanat ja automaatit
• Some open problems in combinatorics of words and related areas
• Studies of informationless L systems
• Studies of informationsless L systems
• The commutation with codes and ternary sets of words
• The commutation with ternary sets of words
• The compression of subsegments of images described by finite automata
• The expressibility of languages and relations by word equations
• The family of PDOL growth-sets is properly included in the family of DOL growth-sets
• Two problems on commutation of languages

Works contributed to

• Auditointiraportti kunnallisvaalien sähköisen äänestyksen pilotista
• Characterization of infinite solutions of marked and binary post correspondence problems
• Combinatorics of words
• Combinatorics on words : a tutorial
• Computing partial information out of intractable : powers of algebraic numbers as an example
• Computing partial information out of uncomputable one : the first digit of 2[sup n] at base 3 as an example
• Decidability of binary infinite post correspondence problem
• Examples of undecidable problems for 2-generator matrix semigroups
• Fixed point approach to commutation of languages
• Freeness of multiplicative matrix semigroups
• Morphisms
• On conjugacy of languages
• On different constrains on three and four words
• On Fatou properties of rational languages
• On the decidability of the freeness of matrix semigroups
• Proceedings of Conference on Algorithmic Number Theory 2007
• Proceedings of the Finnish Mathematical Days 2016 : organized in Turku on 7.-8.1.2016
• Proceedings of WORDS'03
• RuFiDiM 2017
• RuFiDiM II : proceedings of the second Russian Finnish Symposium on Discrete Mathematics 2012
• The commutation of finite sets : a challenging problem
• Undecidability in [omega]-regular languages
• WORDS 2013

Works about Karhumäki, Juhani