Juhani Karhumäki

229 papers A* 16A 6B 18C 16Misc 4Journal 135Unranked 18
YearRankTypeTitle / Venue / Authors
2025 J jnl
Tribute to Arto Salomaa.
Bull. EATCS
Juhani Karhumäki, Jarkko Kari, Lila Kari, Hermann Maurer, Ion Petre, Grzegorz Rozenberg
2024 J jnl
On abelian closures of infinite non-binary words.
Discret. Math.
Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
2021 — ch.
Finite automata, image manipulation, and automatic real functions.
Handbook of Automata Theory (II.)
Juhani Karhumäki, Jarkko Kari
2021 — ch.
Finite transducers and rational transductions.
Handbook of Automata Theory (I.)
Tero Harju, Juhani Karhumäki
2020 J jnl
A compactness property of the
Theor. Comput. Sci.
Juhani Karhumäki, Markus A. Whiteland
2020 J jnl
On Abelian Closures of Infinite Non-binary Words.
CoRR
Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
2020 J jnl
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata.
Fundam. Informaticae
Fabian Frei, Juraj Hromkovic, Juhani Karhumäki
2019 J jnl
On abelian saturated infinite words.
Theor. Comput. Sci.
Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
2019 J jnl
The Salomaa Prize 2019 was given to Dr. Artur Jez.
Bull. EATCS
Mikhail V. Volkov, Juhani Karhumäki, Dominique Perrin
2018 J jnl
Degrees of Infinite Words, Polynomials and Atoms.
Int. J. Found. Comput. Sci.
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2018 J jnl
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version).
CoRR
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2018 J jnl
On
Inf. Comput.
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina
2018 C conf
On Abelian Subshifts.
DLT
Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
2018 J jnl
Perface.
Fundam. Informaticae
Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich, Mikhail V. Volkov
2018 — conf
Regularity of k-Abelian Equivalence Classes of Fixed Cardinality.
Adventures Between Lower Bounds and Higher Altitudes
Juhani Karhumäki, Markus A. Whiteland
2018 J jnl
The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin.
Bull. EATCS
Juhani Karhumäki, Dominique Perrin, Mikhail V. Volkov
2017 J jnl
On cardinalities of k-abelian equivalence classes.
Theor. Comput. Sci.
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
2017 J jnl
On growth and fluctuation of k-abelian complexity.
Eur. J. Comb.
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
2017 J jnl
Variations of the Morse-Hedlund Theorem for
Acta Cybern.
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
2017 J jnl
k-Abelian Equivalence and Rationality.
Fundam. Informaticae
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
2016 C conf
Degrees of Infinite Words, Polynomials and Atoms.
DLT
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2016 J jnl
Descriptional Complexity of Formal Systems.
Theor. Comput. Sci.
Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin
2016 J jnl
On cardinalities of k-abelian equivalence classes.
CoRR
Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland
2016 J jnl
Preface.
Fundam. Informaticae
Juhani Karhumäki, Vladimir V. Mazalov, Yuri V. Matiyasevich
2016 C conf
k-Abelian Equivalence and Rationality.
DLT
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
2015 Misc conf
On Growth and Fluctuation of k-Abelian Complexity.
CSR
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
2015 J jnl
Preface.
Theory Comput. Syst.
Juhani Karhumäki, Edward A. Hirsch
2015 J jnl
Testing k-binomial equivalence.
CoRR
Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter
2015 J jnl
Words 2013.
Theor. Comput. Sci.
Juhani Karhumäki, Luca Q. Zamboni
2014 — ed.
Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings
DCFS
Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin
2014 J jnl
From Models to Languages.
Fundam. Informaticae
Pierpaolo Degano, Juhani Karhumäki, Paolo Massazza
2014 C conf
On k-Abelian Palindromic Rich and Poor Words.
Developments in Language Theory
Juhani Karhumäki, Svetlana Puzynina
2014 — conf
On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages.
Computing with New Resources
Juhani Karhumäki, Alexander Okhotin
2014 J jnl
Preface.
Fundam. Informaticae
Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich
2014 C conf
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence.
Developments in Language Theory
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
2013 — ed.
Combinatorics on Words - 9th International Conference, WORDS 2013, Turku, Finland, September 16-20. Proceedings
WORDS
Juhani Karhumäki, Arto Lepistö, Luca Q. Zamboni
2013 J jnl
Fine and Wilf's Theorem for k-Abelian Periods.
Int. J. Found. Comput. Sci.
Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
2013 J jnl
On a generalization of Abelian equivalence and complexity of infinite words
CoRR
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
2013 J jnl
On a generalization of Abelian equivalence and complexity of infinite words.
J. Comb. Theory A
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
2012 Misc ed.
Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings
CSR
Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Kh. Prilutskii
2012 — conf
Equations in the Partial Semigroup of Words with Overlapping Products.
Languages Alive
Mari Huova, Juhani Karhumäki
2012 C conf
Fine and Wilf's Theorem for k-Abelian Periods.
Developments in Language Theory
Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
2012 J jnl
On abelian versions of critical factorization theorem.
RAIRO Theor. Informatics Appl.
Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina
2012 J jnl
Preface.
Theor. Comput. Sci.
Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa
2012 J jnl
Problems in between words and abelian words: k-abelian avoidability.
Theor. Comput. Sci.
Mari Huova, Juhani Karhumäki, Aleksi Saarela
2012 J jnl
Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju.
Fundam. Informaticae
Vesa Halava, Juhani Karhumäki, Dirk Nowotka, Grzegorz Rozenberg
2011 — conf
Local Squares, Periodicity and Finite Automata.
Rainbow of Computer Science
Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari
2011 J jnl
Locally catenative sequences and Turtle graphics.
RAIRO Theor. Informatics Appl.
Juhani Karhumäki, Svetlana Puzynina
2011 J jnl
Preface.
Fundam. Informaticae
Juhani Karhumäki, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
2011 J jnl
The Unique Decipherability in the Monoid of Regular Languages is Undecidable.
Fundam. Informaticae
Juhani Karhumäki, Aleksi Saarela
2011 J jnl
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.
Theory Comput. Syst.
Christian Choffrut, Juhani Karhumäki
2011 C conf
Weighted Finite Automata: Computing with Different Topologies.
UC
Juhani Karhumäki, Turo Sallinen
2010 J jnl
Computational power of two stacks with restricted communication.
Inf. Comput.
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
2010 J jnl
Noneffective Regularity of Equality Languages and Bounded Delay Morphisms.
Discret. Math. Theor. Comput. Sci.
Juhani Karhumäki, Aleksi Saarela
2010 J jnl
On stateless multihead automata: Hierarchies and the emptiness problem.
Theor. Comput. Sci.
Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin
2010 J jnl
Tiling Periodicity.
Discret. Math. Theor. Comput. Sci.
Juhani Karhumäki, Yury Lifshits, Wojciech Rytter
2009 J jnl
Conjugacy of finite biprefix codes.
Theor. Comput. Sci.
Julien Cassaigne, Juhani Karhumäki, Petri Salmela
2009 J jnl
On the Power of Cooperating Morphisms via Reachability Problems.
Int. J. Found. Comput. Sci.
Juhani Karhumäki
2009 Misc conf
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.
CSR
Christian Choffrut, Juhani Karhumäki
2008 C conf
An Analysis and a Reproof of Hmelevskii's Theorem.
Developments in Language Theory
Juhani Karhumäki, Aleksi Saarela
2008 J jnl
Binary operations on automatic functions.
RAIRO Theor. Informatics Appl.
Juhani Karhumäki, Jarkko Kari, Joachim Kupke
2008 — ed.
Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy
IFIP TCS
Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, C.-H. Luke Ong
2008 J jnl
Matrix Equations and Hilbert's Tenth Problem.
Int. J. Algebra Comput.
Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov
2008 B conf
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem.
LATIN
Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin
2008 J jnl
Post Correspondence Problem for short words.
Inf. Process. Lett.
Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki
2008 J jnl
Preface.
Int. J. Found. Comput. Sci.
Tero Harju, Juhani Karhumäki
2008 J jnl
Preface.
RAIRO Theor. Informatics Appl.
Jean Berstel, Tero Harju, Juhani Karhumäki
2008 — conf
Reachability via Cooperating Morphisms.
RP
Juhani Karhumäki
2008 B ed.
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings
SOFSEM
Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková
2008 — ed.
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II - Student Research Forum
SOFSEM (2)
Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková
2007 C ed.
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings
Developments in Language Theory
Tero Harju, Juhani Karhumäki, Arto Lepistö
2007 J jnl
Extension of the decidability of the marked PCP to instances with unique blocks.
Theor. Comput. Sci.
Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux
2007 J jnl
Intricacies of Simple Word Equations: an Example.
Int. J. Found. Comput. Sci.
Elena Czeizler, Stepan Holub, Juhani Karhumäki, Markku Laine
2007 J jnl
On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns.
Int. J. Found. Comput. Sci.
Elena Czeizler, Juhani Karhumäki
2007 J jnl
The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems.
Theory Comput. Syst.
Vesa Halava, Tero Harju, Juhani Karhumäki
2007 B conf
Tiling Periodicity.
CPM
Juhani Karhumäki, Yury Lifshits, Wojciech Rytter
2006 — conf
Communication of Two Stacks and Rewriting.
ICALP (2)
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
2006 J jnl
Computing by commuting.
Theor. Comput. Sci.
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
2006 — ed.
Finite-State Methods and Natural Language Processing, 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005. Revised Papers
FSMNLP
Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki
2006 J jnl
Preface.
Theor. Comput. Sci.
Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki
2006 J jnl
Undecidability in omega-Regular Languages.
Fundam. Informaticae
Vesa Halava, Tero Harju, Juhani Karhumäki
2005 J jnl
Commutation with Ternary Sets of Words.
Theory Comput. Syst.
Juhani Karhumäki, Michel Latteux, Ion Petre
2005 J jnl
Commutation with codes.
Theor. Comput. Sci.
Juhani Karhumäki, Michel Latteux, Ion Petre
2005 J jnl
On the complexity of decidable cases of the commutation problem of languages.
Theor. Comput. Sci.
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
2005 J jnl
Preface.
Theor. Comput. Sci.
Josep Díaz, Juhani Karhumäki
2005 J jnl
Preface.
Theor. Comput. Sci.
Tero Harju, Juhani Karhumäki, Antonio Restivo
2005 J jnl
Preface: Insightful Theory.
Theor. Comput. Sci.
Juhani Karhumäki, Grzegorz Rozenberg
2005 J jnl
Some decision problems on integer matrices.
RAIRO Theor. Informatics Appl.
Christian Choffrut, Juhani Karhumäki
2004 A* ed.
Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings
ICALP
Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella
2004 C conf
Finite Sets of Words and Computing.
MCU
Juhani Karhumäki
2004 — conf
Fixed Point Approach to Commutation of Languages.
Aspects of Molecular Computing
Karel Culík II, Juhani Karhumäki, Petri Salmela
2004 J jnl
Many aspects of defect theorems.
Theor. Comput. Sci.
Tero Harju, Juhani Karhumäki
2004 J jnl
Polynomial versus exponential growth in repetition-free binary words.
J. Comb. Theory A
Juhani Karhumäki, Jeffrey O. Shallit
2004 — ed.
Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday
Theory Is Forever
Juhani Karhumäki, Hermann A. Maurer, Gheorghe Paun, Grzegorz Rozenberg
2003 J jnl
A defect theorem for bi-infinite words.
Theor. Comput. Sci.
Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
2003 J jnl
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c.
Inf. Comput.
Juhani Karhumäki, Leonid P. Lisovik
2003 C conf
Automata on Words.
CIAA
Juhani Karhumäki
2003 J jnl
Combinatorics on words: a tutorial.
Bull. EATCS
Jean Berstel, Juhani Karhumäki
2003 J jnl
Decidability of the binary infinite Post Correspondence Problem.
Discret. Appl. Math.
Vesa Halava, Tero Harju, Juhani Karhumäki
2003 J jnl
Polynomial versus Exponential Growth in Repetition-Free Binary Words
CoRR
Juhani Karhumäki, Jeffrey O. Shallit
2003 A conf
The Commutation with Codes and Ternary Sets of Words.
STACS
Juhani Karhumäki, Michel Latteux, Ion Petre
2003 J jnl
The Equivalence Problem of Finite Substitutions on ab*c, with Applications.
Int. J. Found. Comput. Sci.
Juhani Karhumäki, Leonid P. Lisovik
2003 J jnl
The complexity of compressing subsegments of images described by finite automata.
Discret. Appl. Math.
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
2002 J jnl
A Note on Synchronized Automata and Road Coloring Problem.
Int. J. Found. Comput. Sci.
Karel Culík II, Juhani Karhumäki, Jarkko Kari
2002 B conf
Applications of Finite Automata.
MFCS
Juhani Karhumäki
2002 J jnl
Communication Complexity Method for Measuring Nondeterminism in Finite Automata.
Inf. Comput.
Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
2002 B conf
Computing Partial Information out of Intractable One - The First Digit of 2
MFCS
Mika Hirvensalo, Juhani Karhumäki
2002 J jnl
Conway's problem for three-word sets.
Theor. Comput. Sci.
Juhani Karhumäki, Ion Petre
2002 — ed.
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Formal and Natural Computing
Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto Salomaa
2002 J jnl
Locally Periodic Versus Globally Periodic Infinite Words.
J. Comb. Theory A
Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski
2002 J jnl
Multiple factorizations of words and defect effect.
Theor. Comput. Sci.
Juhani Karhumäki, Ján Manuch
2002 J jnl
Some Decision Problems Concerning Semilinearity and Commutation.
J. Comput. Syst. Sci.
Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa
2002 — conf
The Branching Point Approach to Conway's Problem.
Formal and Natural Computing
Juhani Karhumäki, Ion Petre
2002 A* conf
The Equivalence Problem of Finite Substitutions on ab
ICALP
Juhani Karhumäki, Leonid P. Lisovik
2002 J jnl
The commutation of finite sets: a challenging problem.
Theor. Comput. Sci.
Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger
2001 C conf
A Note on Synchronized Automata and Road Coloring Problem.
Developments in Language Theory
Karel Culík II, Juhani Karhumäki, Jarkko Kari
2001 A conf
A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab
STACS
Juhani Karhumäki, Leonid P. Lisovik
2001 B conf
Challenges of Commutation.
FCT
Juhani Karhumäki
2001 C conf
Combinatorial and Computational Problems on Finite Sets of Words.
MCU
Juhani Karhumäki
2001 J jnl
Conway's Problem and the Communication of Languages.
Bull. EATCS
Juhani Karhumäki, Ion Petre
2001 A* conf
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.
ICALP
Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa
2001 J jnl
On Conjugacy of Languages.
RAIRO Theor. Informatics Appl.
Julien Cassaigne, Juhani Karhumäki, Ján Manuch
2001 — conf
On Fatou properties of rational languages.
Where Mathematics, Computer Science, Linguistics and Biology Meet
Christian Choffrut, Juhani Karhumäki
2001 B conf
On the Complexity of Decidable Cases of Commutation Problem for Languages.
FCT
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
2000 J jnl
Measures of Nondeterminism in Finite Automata
Electron. Colloquium Comput. Complex.
Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
2000 A* conf
Measures of Nondeterminism in Finite Automata.
ICALP
Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
2000 A* conf
On the Centralizer of a Finite Set.
ICALP
Juhani Karhumäki, Ion Petre
2000 J jnl
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata.
Nord. J. Comput.
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
2000 J jnl
The expressibility of languages and relations by word equations.
J. ACM
Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski
1999 J jnl
A Short Biography of Arto Salomaa.
Theor. Comput. Sci.
Juhani Karhumäki
1999 J jnl
Defect Theorems for Trees.
Fundam. Informaticae
Juhani Karhumäki, Sabrina Mantaci
1999 C conf
Defect theorems for trees.
Developments in Language Theory
Juhani Karhumäki, Sabrina Mantaci
1999 J jnl
Generalized Factorizations of Words and Their Algorithmic Properties.
Theor. Comput. Sci.
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1999 — ed.
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Jewels are Forever
Juhani Karhumäki, Hermann A. Maurer, Gheorghe Paun, Grzegorz Rozenberg
1999 — conf
On the Equivalence of Finite Substitutions and Transducers.
Jewels are Forever
Juhani Karhumäki, Leonid P. Lisovik
1999 J jnl
On the Undecidability of Freeness of Matrix Semigroups.
Int. J. Algebra Comput.
Julien Cassaigne, Tero Harju, Juhani Karhumäki
1999 C conf
On the complexity of computing the order of repetition of a string.
Developments in Language Theory
Juhani Karhumäki, Wojciech Plandowski
1999 B conf
The Compression of Subsegments of Images Described by Finite Automata.
CPM
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1998 J jnl
Examples of Undecidable Problems for 2-Generator Matrix Semigroups.
Theor. Comput. Sci.
Julien Cassaigne, Juhani Karhumäki
1998 A* conf
Locally Periodic Infinite Words and a Chaotic Behaviour.
ICALP
Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski
1998 B conf
On Defect Effect of Bi-Infinite Words.
MFCS
Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
1997 J jnl
A Note on Decidability Questions on Presentations of Word Semigroups.
Theor. Comput. Sci.
Christian Choffrut, Tero Harju, Juhani Karhumäki
1997 C conf
A lower bound for a constant in Shallit's conjecture.
Developments in Language Theory
Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi
1997 — ch.
Combinatorics of Words.
Handbook of Formal Languages (1)
Christian Choffrut, Juhani Karhumäki
1997 J jnl
Compactness of Systems of Equations in Semigroups.
Int. J. Algebra Comput.
Tero Harju, Juhani Karhumäki, Wojciech Plandowski
1997 — conf
Compactness of Systems of Equations on Completely Regular Semigroups.
Structures in Logic and Computer Science
Tero Harju, Juhani Karhumäki, Mario Petrich
1997 — ch.
Morphisms.
Handbook of Formal Languages (1)
Tero Harju, Juhani Karhumäki
1997 B conf
Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.
FCT
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1997 A* conf
The Expressibility of Languages and Relations by Word Equations.
ICALP
Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi
1997 J jnl
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms.
Eur. J. Comb.
Julien Cassaigne, Juhani Karhumäki
1997 — conf
Two Lower Bounds on Computational Complexity of Infinite Words.
New Trends in Formal Languages
Juraj Hromkovic, Juhani Karhumäki
1996 J jnl
On Computational Power of Weighted Finite Automata.
Fundam. Informaticae
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
1996 J jnl
On the Size of Independent Systems of Equations in Semigroups.
Theor. Comput. Sci.
Juhani Karhumäki, Wojciech Plandowski
1996 A conf
Remarks on Generalized Post Correspondence Problem.
STACS
Tero Harju, Juhani Karhumäki, Daniel Krob
1995 A* conf
Compactness of Systems of Equations in Semigroups.
ICALP
Tero Harju, Juhani Karhumäki, Wojciech Plandowski
1995 J jnl
Polynomial Size Test Sets for Context-Free Languages.
J. Comput. Syst. Sci.
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1995 Misc conf
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract).
COCOON
Julien Cassaigne, Juhani Karhumäki
1994 — conf
Comparing Descriptional and Computational Complexity of Infinite Words.
Results and Trends in Theoretical Computer Science
Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö
1994 J jnl
Finite Automata Computing Real Functions.
SIAM J. Comput.
Karel Culík II, Juhani Karhumäki
1994 J jnl
Iterative Devices Generating Infinite Words.
Int. J. Found. Comput. Sci.
Karel Culík II, Juhani Karhumäki
1994 J jnl
On Continuous Functions Computed by Finite Automata.
RAIRO Theor. Informatics Appl.
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
1994 — ch.
On the Defect Effect of Many Identities in Free Semigroups.
Mathematical Aspects of Natural and Formal Languages
Juhani Karhumäki, Wojciech Plandowski
1994 B conf
On the Size of Independent Systems of Equations in Semigroups.
MFCS
Juhani Karhumäki, Wojciech Plandowski
1994 — ed.
Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10-11, 1994, Proceedings
Results and Trends in Theoretical Computer Science
Juhani Karhumäki, Hermann A. Maurer, Grzegorz Rozenberg
1994 — conf
Two Lower Bounds on Computational Complexity of Infinite Word Generation.
IFIP Congress (1)
Juraj Hromkovic, Juhani Karhumäki
1993 J jnl
Efficient constructions of test sets for regular and context-free languages.
Theor. Comput. Sci.
Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek
1993 J jnl
Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory.
Theor. Comput. Sci.
Juhani Karhumäki
1993 — ch.
The Impact of the DOL Problem.
Current Trends in Theoretical Computer Science
Juhani Karhumäki
1992 A conf
Iterative Devices Generating Infinite Words.
STACS
Karel Culík II, Juhani Karhumäki
1992 J jnl
Multiplicities: A Deterministsic View of Nondeterminism.
Theor. Comput. Sci.
Juhani Karhumäki
1992 B conf
On Computational Power of Weighted Finite Automata.
MFCS
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
1992 A* conf
Polynomial Size Test Sets for Context-Free Languages.
ICALP
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
1991 B conf
Efficient Constructions of Test Sets for Regular and Context-Free Languages.
MFCS
Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek
1991 J jnl
On the power of synchronization in parallel computations.
Discret. Appl. Math.
Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová
1991 J jnl
The Equivalence Problem of Multitape Finite Automata.
Theor. Comput. Sci.
Tero Harju, Juhani Karhumäki
1990 A* conf
Decidability of the Multiplicity Equivalence of Multitape Finite Automata
STOC
Tero Harju, Juhani Karhumäki
1990 J jnl
Loops in automata and HDTOL relations.
RAIRO Theor. Informatics Appl.
Karel Culík II, Juhani Karhumäki
1990 — conf
Systems of Equations over a Finite Set of Words and Automata Theory.
IWWERT
Juhani Karhumäki
1989 — ch.
A note on HDTOL Languages and the Equivalence of Deterministic Pushdown Transducers.
A Perspective in Theoretical Computer Science
Karel Culík II, Juhani Karhumäki
1989 J jnl
HDTOL Matching of Computations of Multitape Automata.
Acta Informatica
Karel Culík II, Juhani Karhumäki
1989 A conf
On the Equivalence Problem for Deterministic Multitape Automata and Transducers.
STACS
Karel Culík II, Juhani Karhumäki
1989 B conf
On the Power of Synchronization in Parallel Computations.
MFCS
Jürgen Dassow, Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová
1988 J jnl
On Totalistic Systolic Networks.
Inf. Process. Lett.
Karel Culík II, Juhani Karhumäki
1988 J jnl
The Formal Language Theory Column.
Bull. EATCS
Arto Salomaa, Juhani Karhumäki
1987 A* conf
On Recent Trends in Formal Language Theory.
ICALP
Juhani Karhumäki
1987 J jnl
Results Concerning Palindromicity.
J. Inf. Process. Cybern.
Sándor Horváth, Juhani Karhumäki, Jetty Kleijn
1987 J jnl
The Ehrenfeucht Conjecture for Transducers.
J. Inf. Process. Cybern.
Juhani Karhumäki
1987 J jnl
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable.
SIAM J. Comput.
Karel Culík II, Juhani Karhumäki
1986 J jnl
A Note on the Equivalence Problem of Rational Formal Power Series.
Inf. Process. Lett.
Karel Culík II, Juhani Karhumäki
1986 J jnl
A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language.
J. Comput. Syst. Sci.
Juhani Karhumäki, Yael Maon
1986 J jnl
On morphic generation of regular languages.
Discret. Appl. Math.
Tero Harju, Juhani Karhumäki, H. C. M. Kleijn
1986 J jnl
Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence.
Acta Informatica
Karel Culík II, Juhani Karhumäki
1986 J jnl
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable.
Theor. Comput. Sci.
Karel Culík II, Juhani Karhumäki
1986 B conf
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable.
MFCS
Karel Culík II, Juhani Karhumäki
1986 — conf
The equivalence of mappings on languages.
IMYCS
Juhani Karhumäki
1985 J jnl
A Property of Three-Element Codes.
Theor. Comput. Sci.
Juhani Karhumäki
1985 J jnl
Decision problems solved with the help of the Ehrenfeucht conjecture.
Bull. EATCS
Karel Culík II, Juhani Karhumäki
1985 J jnl
On Three-Element Codes.
Theor. Comput. Sci.
Juhani Karhumäki
1985 J jnl
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages.
RAIRO Theor. Informatics Appl.
Juhani Karhumäki, H. C. M. Kleijn
1985 J jnl
Test sets for morphisms with bounded delay.
Discret. Appl. Math.
Christian Choffrut, Juhani Karhumäki
1984 A conf
A Property of Three-Element Codes.
STACS
Juhani Karhumäki
1984 J jnl
Inverse Morphic Equivalence on Languages.
Inf. Process. Lett.
Juhani Karhumäki, Derick Wood
1984 A* conf
On Three-Element Codes.
ICALP
Juhani Karhumäki
1984 B conf
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages.
MFCS
Juhani Karhumäki, H. C. M. Kleijn
1984 J jnl
The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids.
Theor. Comput. Sci.
Juhani Karhumäki
1983 A* conf
A Note on Intersections of Free Submonoids of a Free Monoid.
ICALP
Juhani Karhumäki
1983 J jnl
A note on morphic characterization of languages.
Discret. Appl. Math.
Juhani Karhumäki, Matti Linna
1983 J jnl
On cube-free ω-words generated by binary morphisms.
Discret. Appl. Math.
Juhani Karhumäki
1983 J jnl
On the Ehrenfeucht Conjecture for DOL Languages.
RAIRO Theor. Informatics Appl.
Karel Culík II, Juhani Karhumäki
1983 J jnl
Systems of equations over a free monoid and Ehrenfeucht's conjecture.
Discret. Math.
Karel Culík II, Juhani Karhumäki
1983 A* conf
Test Sets for Morphisms with Bounded Delay.
ICALP
Christian Choffrut, Juhani Karhumäki
1982 A* conf
On the Equivalence Problem for Binary DOL Systems.
ICALP
Juhani Karhumäki
1982 J jnl
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid
Inf. Control.
Jürgen Albert, Karel Culík II, Juhani Karhumäki
1982 J jnl
The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable.
Theor. Comput. Sci.
Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg
1981 A* conf
Generalized Parikh Mappings and Homomorphisms.
ICALP
Juhani Karhumäki
1981 B conf
On Strongly Cube-Free Omega-Words Generated by Binary Morphisms.
FCT
Juhani Karhumäki
1981 J jnl
On the Equivalence Problem for Binary DOL Systems
Inf. Control.
Juhani Karhumäki
1980 J jnl
Generalized Parikh Mappings and Homomorphisms
Inf. Control.
Juhani Karhumäki
1980 J jnl
On the Equality Sets for Homomorphisms on Free Monoids with Two Generators.
RAIRO Theor. Informatics Appl.
Karel Culík II, Juhani Karhumäki
1979 J jnl
Interactive L Systems with Almost Interactionless Behaviour
Inf. Control.
Karel Culík II, Juhani Karhumäki
1979 B conf
Interactive L Systems with Almost Interactionless Behaviour.
MFCS
Karel Culík II, Juhani Karhumäki
1979 J jnl
On Commutative DT0L Systems.
Theor. Comput. Sci.
Juhani Karhumäki
1978 J jnl
A note on DOL length sets.
Discret. Math.
Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg
1977 J jnl
Remarks on Commutative
Theor. Comput. Sci.
Juhani Karhumäki
1977 J jnl
The Decidability of the Equivalence Problem for Polynomially Bounded DOL Sequences.
RAIRO Theor. Informatics Appl.
Juhani Karhumäki
1976 J jnl
Two Theorems Concerning Recognizable N-Subsets of sigma*.
Theor. Comput. Sci.
Juhani Karhumäki
1975 — conf
On Length Sets of Informationless L Systems.
Automata, Languages, Development
Juhani Karhumäki
1974 — conf
Some Growth Functions of Context-Dependent L-Systems.
L Systems
Juhani Karhumäki
1973 J jnl
An Example of a PD2L-System with the Growth Type 2½.
Inf. Process. Lett.
Juhani Karhumäki