Juhani Karhumäki

Publication Activity (10 Years)

Years Active: 1973-2020
Publications (10 Years): 25

Top Venues

Fundam. Informaticae

Theor. Comput. Sci.

CoRR

Developments in Language Theory

Publications

Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
On Abelian Closures of Infinite Non-binary Words. CoRR (2020)
Fabian Frei, Juraj Hromkovic, Juhani Karhumäki
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata. Fundam. Informaticae 175 (1-4) (2020)
Juhani Karhumäki, Markus A. Whiteland
-abelian monoids. Theor. Comput. Sci. 834 (2020)
Mikhail V. Volkov, Juhani Karhumäki, Dominique Perrin
The Salomaa Prize 2019 was given to Dr. Artur Jez. Bull. EATCS 129 (2019)
Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
On abelian saturated infinite words. Theor. Comput. Sci. 792 (2019)
Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich, Mikhail V. Volkov
Perface. Fundam. Informaticae 162 (2-3) (2018)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials and Atoms. Int. J. Found. Comput. Sci. 29 (5) (2018)
Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
On Abelian Subshifts. DLT (2018)
Juhani Karhumäki, Dominique Perrin, Mikhail V. Volkov
The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin. Bull. EATCS 126 (2018)
Juhani Karhumäki, Markus A. Whiteland
Regularity of k-Abelian Equivalence Classes of Fixed Cardinality. Adventures Between Lower Bounds and Higher Altitudes (2018)
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina
-abelian palindromes. Inf. Comput. 260 (2018)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). CoRR (2018)
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
On growth and fluctuation of k-abelian complexity. Eur. J. Comb. 65 (2017)
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
On cardinalities of k-abelian equivalence classes. Theor. Comput. Sci. 658 (2017)
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
-Abelian Equivalence. Acta Cybern. 23 (1) (2017)
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
k-Abelian Equivalence and Rationality. Fundam. Informaticae 154 (1-4) (2017)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials and Atoms. DLT (2016)
Juhani Karhumäki, V. Mazalov, Yuri V. Matiyasevich
Preface. Fundam. Informaticae 145 (3) (2016)
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
k-Abelian Equivalence and Rationality. DLT (2016)
Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin
Descriptional Complexity of Formal Systems. Theor. Comput. Sci. 610 (2016)
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
On cardinalities of k-abelian equivalence classes. CoRR (2016)
Juhani Karhumäki, Luca Q. Zamboni
Words 2013. Theor. Comput. Sci. 601 (2015)
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
On Growth and Fluctuation of k-Abelian Complexity. CSR (2015)
Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter
Testing k-binomial equivalence. CoRR (2015)
Juhani Karhumäki, Edward A. Hirsch
Preface. Theory Comput. Syst. 56 (4) (2015)
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. Developments in Language Theory (2014)
Juhani Karhumäki, Alexander Okhotin
On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages. Computing with New Resources (2014)
Pierpaolo Degano, Juhani Karhumäki, Paolo Massazza
From Models to Languages. Fundam. Informaticae 134 (3-4) (2014)
Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich
Preface. Fundam. Informaticae 132 (1) (2014)
Juhani Karhumäki, Svetlana Puzynina
On k-Abelian Palindromic Rich and Poor Words. Developments in Language Theory (2014)
Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
Fine and Wilf's Theorem for k-Abelian Periods. Int. J. Found. Comput. Sci. 24 (7) (2013)
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
On a generalization of Abelian equivalence and complexity of infinite words. J. Comb. Theory, Ser. A 120 (8) (2013)
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
On a generalization of Abelian equivalence and complexity of infinite words CoRR (2013)
Vesa Halava, Juhani Karhumäki, Dirk Nowotka, Grzegorz Rozenberg
Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju. Fundam. Informaticae 116 (1-4) (2012)
Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina
On abelian versions of critical factorization theorem. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
Fine and Wilf's Theorem for k-Abelian Periods. Developments in Language Theory (2012)
Mari Huova, Juhani Karhumäki, Aleksi Saarela
Problems in between words and abelian words: k-abelian avoidability. Theor. Comput. Sci. 454 (2012)
Mari Huova, Juhani Karhumäki
Equations in the Partial Semigroup of Words with Overlapping Products. Languages Alive (2012)
Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa
Preface. Theor. Comput. Sci. 429 (2012)
Juhani Karhumäki, Aleksi Saarela
The Unique Decipherability in the Monoid of Regular Languages is Undecidable. Fundam. Informaticae 110 (1-4) (2011)
Juhani Karhumäki, Turo Sallinen
Weighted Finite Automata: Computing with Different Topologies. UC (2011)
Christian Choffrut, Juhani Karhumäki
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. Theory Comput. Syst. 49 (2) (2011)
Juhani Karhumäki, Svetlana Puzynina
Locally catenative sequences and Turtle graphics. RAIRO Theor. Informatics Appl. 45 (3) (2011)
Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari
Local Squares, Periodicity and Finite Automata. Rainbow of Computer Science (2011)
Juhani Karhumäki, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
Preface. Fundam. Informaticae 110 (1-4) (2011)
Juhani Karhumäki, Yury Lifshits, Wojciech Rytter
Tiling Periodicity. Discret. Math. Theor. Comput. Sci. 12 (2) (2010)
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
Computational power of two stacks with restricted communication. Inf. Comput. 208 (9) (2010)
Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin
On stateless multihead automata: Hierarchies and the emptiness problem. Theor. Comput. Sci. 411 (3) (2010)
Juhani Karhumäki, Aleksi Saarela
Noneffective Regularity of Equality Languages and Bounded Delay Morphisms. Discret. Math. Theor. Comput. Sci. 12 (4) (2010)
Julien Cassaigne, Juhani Karhumäki, Petri Salmela
Conjugacy of finite biprefix codes. Theor. Comput. Sci. 410 (24-25) (2009)
Christian Choffrut, Juhani Karhumäki
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. CSR (2009)
Juhani Karhumäki
On the Power of Cooperating Morphisms via Reachability Problems. Int. J. Found. Comput. Sci. 20 (5) (2009)
Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. LATIN (2008)
Tero Harju, Juhani Karhumäki
Preface. Int. J. Found. Comput. Sci. 19 (3) (2008)
Juhani Karhumäki, Aleksi Saarela
An Analysis and a Reproof of Hmelevskii's Theorem. Developments in Language Theory (2008)
Juhani Karhumäki, Jarkko Kari, Joachim Kupke
Binary operations on automatic functions. RAIRO Theor. Informatics Appl. 42 (2) (2008)
Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki
Post Correspondence Problem for short words. Inf. Process. Lett. 108 (3) (2008)
Juhani Karhumäki
Reachability via Cooperating Morphisms. Electron. Notes Theor. Comput. Sci. 223 (2008)
Jean Berstel, Tero Harju, Juhani Karhumäki
Preface. RAIRO Theor. Informatics Appl. 42 (4) (2008)
Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov
Matrix Equations and Hilbert's Tenth Problem. Int. J. Algebra Comput. 18 (8) (2008)
Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux
Extension of the decidability of the marked PCP to instances with unique blocks. Theor. Comput. Sci. 380 (3) (2007)
Vesa Halava, Tero Harju, Juhani Karhumäki
The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. Theory Comput. Syst. 40 (1) (2007)
Elena Czeizler, Stepan Holub, Juhani Karhumäki, Markku Laine
Intricacies of Simple Word Equations: an Example. Int. J. Found. Comput. Sci. 18 (6) (2007)
Elena Czeizler, Juhani Karhumäki
On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns. Int. J. Found. Comput. Sci. 18 (4) (2007)
Juhani Karhumäki, Yury Lifshits, Wojciech Rytter
Tiling Periodicity. CPM (2007)
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
Computing by commuting. Theor. Comput. Sci. 356 (1-2) (2006)
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
Communication of Two Stacks and Rewriting. ICALP (2) (2006)
Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki
Preface. Theor. Comput. Sci. 356 (1-2) (2006)
Vesa Halava, Tero Harju, Juhani Karhumäki
Undecidability in omega-Regular Languages. Fundam. Informaticae 73 (1-2) (2006)
Juhani Karhumäki, Michel Latteux, Ion Petre
Commutation with codes. Theor. Comput. Sci. 340 (1) (2005)
Christian Choffrut, Juhani Karhumäki
Some decision problems on integer matrices. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Josep Díaz, Juhani Karhumäki
Preface. Theor. Comput. Sci. 348 (2-3) (2005)
Juhani Karhumäki, Grzegorz Rozenberg
Preface: Insightful Theory. Theor. Comput. Sci. 330 (1) (2005)
Juhani Karhumäki, Michel Latteux, Ion Petre
Commutation with Ternary Sets of Words. Theory Comput. Syst. 38 (2) (2005)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
On the complexity of decidable cases of the commutation problem of languages. Theor. Comput. Sci. 337 (1-3) (2005)
Tero Harju, Juhani Karhumäki, Antonio Restivo
Preface. Theor. Comput. Sci. 339 (1) (2005)
Karel Culík II, Juhani Karhumäki, Petri Salmela
Fixed Point Approach to Commutation of Languages. Aspects of Molecular Computing (2004)
Tero Harju, Juhani Karhumäki
Many aspects of defect theorems. Theor. Comput. Sci. 324 (1) (2004)
Juhani Karhumäki
Finite Sets of Words and Computing. MCU (2004)
Juhani Karhumäki, Jeffrey O. Shallit
Polynomial versus exponential growth in repetition-free binary words. J. Comb. Theory, Ser. A 105 (2) (2004)
Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
A defect theorem for bi-infinite words. Theor. Comput. Sci. 292 (1) (2003)
Juhani Karhumäki, Michel Latteux, Ion Petre
The Commutation with Codes and Ternary Sets of Words. STACS (2003)
Juhani Karhumäki, Jeffrey O. Shallit
Polynomial versus Exponential Growth in Repetition-Free Binary Words CoRR (2003)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
The complexity of compressing subsegments of images described by finite automata. Discret. Appl. Math. 125 (2-3) (2003)
Juhani Karhumäki
Automata on Words. CIAA (2003)
Juhani Karhumäki, Leonid P. Lisovik
The Equivalence Problem of Finite Substitutions on ab*c, with Applications. Int. J. Found. Comput. Sci. 14 (4) (2003)
Vesa Halava, Tero Harju, Juhani Karhumäki
Decidability of the binary infinite Post Correspondence Problem. Discret. Appl. Math. 130 (3) (2003)
Juhani Karhumäki, Leonid P. Lisovik
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c. Inf. Comput. 187 (1) (2003)
Jean Berstel, Juhani Karhumäki
Combinatorics on words: a tutorial. Bull. EATCS 79 (2003)
Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inf. Comput. 172 (2) (2002)
Juhani Karhumäki, Leonid P. Lisovik
c, with Applications. ICALP (2002)
Mika Hirvensalo, Juhani Karhumäki
at Base 3 as an Example. MFCS (2002)
Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa
Some Decision Problems Concerning Semilinearity and Commutation. J. Comput. Syst. Sci. 65 (2) (2002)
Juhani Karhumäki, Ion Petre
The Branching Point Approach to Conway's Problem. Formal and Natural Computing (2002)
Juhani Karhumäki, Ion Petre
Conway's problem for three-word sets. Theor. Comput. Sci. 289 (1) (2002)
Karel Culík II, Juhani Karhumäki, Jarkko Kari
A Note on Synchronized Automata and Road Coloring Problem. Int. J. Found. Comput. Sci. 13 (3) (2002)
Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger
The commutation of finite sets: a challenging problem. Theor. Comput. Sci. 273 (1-2) (2002)
Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski
Locally Periodic Versus Globally Periodic Infinite Words. J. Comb. Theory, Ser. A 100 (2) (2002)
Juhani Karhumäki, Ján Manuch
Multiple factorizations of words and defect effect. Theor. Comput. Sci. 273 (1-2) (2002)
Juhani Karhumäki
Applications of Finite Automata. MFCS (2002)

Juhani Karhumäki.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Juhani Karhumäki