default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuhani Karhumäki
Person information
- affiliation: University of Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j127]Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland:
On abelian closures of infinite non-binary words. Discret. Math. 347(9): 114069 (2024)- 2021
- [p7]Tero Harju
, Juhani Karhumäki:
Finite transducers and rational transductions. Handbook of Automata Theory (I.) 2021: 79-111 - [p6]Juhani Karhumäki, Jarkko Kari:
Finite automata, image manipulation, and automatic real functions. Handbook of Automata Theory (II.) 2021: 1105-1143 - 2020
- [j126]Fabian Frei, Juraj Hromkovic, Juhani Karhumäki:
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata. Fundam. Informaticae 175(1-4): 173-185 (2020) - [j125]Juhani Karhumäki, Markus A. Whiteland:
A compactness property of the k-abelian monoids. Theor. Comput. Sci. 834: 3-13 (2020) - [i7]Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland:
On Abelian Closures of Infinite Non-binary Words. CoRR abs/2012.14701 (2020)
2010 – 2019
- 2019
- [j124]Mikhail V. Volkov, Juhani Karhumäki, Dominique Perrin:
The Salomaa Prize 2019 was given to Dr. Artur Jez. Bull. EATCS 129 (2019) - [j123]Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela:
On abelian saturated infinite words. Theor. Comput. Sci. 792: 154-160 (2019) - 2018
- [j122]Juhani Karhumäki, Dominique Perrin, Mikhail V. Volkov:
The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin. Bull. EATCS 126 (2018) - [j121]Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich, Mikhail V. Volkov:
Perface. Fundam. Informaticae 162(2-3): i (2018) - [j120]Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina:
On k-abelian palindromes. Inf. Comput. 260: 89-98 (2018) - [j119]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): 825-843 (2018) - [c74]Juhani Karhumäki, Markus A. Whiteland:
Regularity of k-Abelian Equivalence Classes of Fixed Cardinality. Adventures Between Lower Bounds and Higher Altitudes 2018: 49-62 - [c73]Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland:
On Abelian Subshifts. DLT 2018: 453-464 - [i6]Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). CoRR abs/1803.03158 (2018) - 2017
- [j118]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. Acta Cybern. 23(1): 175-189 (2017) - [j117]Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela:
On growth and fluctuation of k-abelian complexity. Eur. J. Comb. 65: 92-105 (2017) - [j116]Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland:
k-Abelian Equivalence and Rationality. Fundam. Informaticae 154(1-4): 65-94 (2017) - [j115]Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland:
On cardinalities of k-abelian equivalence classes. Theor. Comput. Sci. 658: 190-204 (2017) - 2016
- [j114]Juhani Karhumäki, Vladimir V. Mazalov, Yuri V. Matiyasevich:
Preface. Fundam. Informaticae 145(3): i-ii (2016) - [j113]Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin:
Descriptional Complexity of Formal Systems. Theor. Comput. Sci. 610: 1 (2016) - [c72]Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland:
k-Abelian Equivalence and Rationality. DLT 2016: 77-88 - [c71]Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials and Atoms. DLT 2016: 164-176 - [i5]Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland:
On cardinalities of k-abelian equivalence classes. CoRR abs/1605.03319 (2016) - 2015
- [j112]Juhani Karhumäki, Edward A. Hirsch:
Preface. Theory Comput. Syst. 56(4): 591-592 (2015) - [j111]Juhani Karhumäki, Luca Q. Zamboni:
Words 2013. Theor. Comput. Sci. 601: 1 (2015) - [c70]Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela:
On Growth and Fluctuation of k-Abelian Complexity. CSR 2015: 109-122 - [i4]Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter:
Testing k-binomial equivalence. CoRR abs/1509.00622 (2015) - 2014
- [j110]Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich:
Preface. Fundam. Informaticae 132(1) (2014) - [j109]Pierpaolo Degano, Juhani Karhumäki, Paolo Massazza:
From Models to Languages. Fundam. Informaticae 134(3-4): i (2014) - [c69]Juhani Karhumäki, Alexander Okhotin:
On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages. Computing with New Resources 2014: 71-82 - [c68]Juhani Karhumäki, Svetlana Puzynina:
On k-Abelian Palindromic Rich and Poor Words. Developments in Language Theory 2014: 191-202 - [c67]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. Developments in Language Theory 2014: 203-214 - [e13]Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin:
Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings. Lecture Notes in Computer Science 8614, Springer 2014, ISBN 978-3-319-09703-9 [contents] - 2013
- [j108]Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela:
Fine and Wilf's Theorem for k-Abelian Periods. Int. J. Found. Comput. Sci. 24(7): 1135-1152 (2013) - [j107]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
On a generalization of Abelian equivalence and complexity of infinite words. J. Comb. Theory A 120(8): 2189-2206 (2013) - [e12]Juhani Karhumäki, Arto Lepistö, Luca Q. Zamboni:
Combinatorics on Words - 9th International Conference, WORDS 2013, Turku, Finland, September 16-20. Proceedings. Lecture Notes in Computer Science 8079, Springer 2013, ISBN 978-3-642-40578-5 [contents] - [i3]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
On a generalization of Abelian equivalence and complexity of infinite words. CoRR abs/1301.5104 (2013) - 2012
- [j106]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) - [j105]Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina:
On abelian versions of critical factorization theorem. RAIRO Theor. Informatics Appl. 46(1): 3-15 (2012) - [j104]Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa:
Preface. Theor. Comput. Sci. 429: 1-20 (2012) - [j103]Mari Huova, Juhani Karhumäki, Aleksi Saarela:
Problems in between words and abelian words: k-abelian avoidability. Theor. Comput. Sci. 454: 172-177 (2012) - [c66]Mari Huova, Juhani Karhumäki:
Equations in the Partial Semigroup of Words with Overlapping Products. Languages Alive 2012: 99-110 - [c65]Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela:
Fine and Wilf's Theorem for k-Abelian Periods. Developments in Language Theory 2012: 296-307 - [e11]Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Kh. Prilutskii:
Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings. Lecture Notes in Computer Science 7353, Springer 2012, ISBN 978-3-642-30641-9 [contents] - 2011
- [j102]Juhani Karhumäki, Aleksi Saarela:
The Unique Decipherability in the Monoid of Regular Languages is Undecidable. Fundam. Informaticae 110(1-4): 197-200 (2011) - [j101]Juhani Karhumäki, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Preface. Fundam. Informaticae 110(1-4) (2011) - [j100]Juhani Karhumäki, Svetlana Puzynina:
Locally catenative sequences and Turtle graphics. RAIRO Theor. Informatics Appl. 45(3): 311-330 (2011) - [j99]Christian Choffrut, Juhani Karhumäki:
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. Theory Comput. Syst. 49(2): 355-364 (2011) - [c64]Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari:
Local Squares, Periodicity and Finite Automata. Rainbow of Computer Science 2011: 90-101 - [c63]Juhani Karhumäki, Turo Sallinen:
Weighted Finite Automata: Computing with Different Topologies. UC 2011: 14-33 - 2010
- [j98]Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. Discret. Math. Theor. Comput. Sci. 12(2): 237-248 (2010) - [j97]Juhani Karhumäki, Aleksi Saarela:
Noneffective Regularity of Equality Languages and Bounded Delay Morphisms. Discret. Math. Theor. Comput. Sci. 12(4): 9-18 (2010) - [j96]Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Computational power of two stacks with restricted communication. Inf. Comput. 208(9): 1060-1089 (2010) - [j95]Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin:
On stateless multihead automata: Hierarchies and the emptiness problem. Theor. Comput. Sci. 411(3): 581-593 (2010)
2000 – 2009
- 2009
- [j94]Juhani Karhumäki:
On the Power of Cooperating Morphisms via Reachability Problems. Int. J. Found. Comput. Sci. 20(5): 803-818 (2009) - [j93]Julien Cassaigne, Juhani Karhumäki, Petri Salmela:
Conjugacy of finite biprefix codes. Theor. Comput. Sci. 410(24-25): 2345-2351 (2009) - [c62]Christian Choffrut, Juhani Karhumäki:
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. CSR 2009: 71-79 - 2008
- [j92]Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov:
Matrix Equations and Hilbert's Tenth Problem. Int. J. Algebra Comput. 18(8): 1231-1241 (2008) - [j91]Tero Harju, Juhani Karhumäki:
Preface. Int. J. Found. Comput. Sci. 19(3): 495-496 (2008) - [j90]Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki:
Post Correspondence Problem for short words. Inf. Process. Lett. 108(3): 115-118 (2008) - [j89]Juhani Karhumäki, Jarkko Kari, Joachim Kupke:
Binary operations on automatic functions. RAIRO Theor. Informatics Appl. 42(2): 217-236 (2008) - [j88]Jean Berstel, Tero Harju, Juhani Karhumäki:
Preface. RAIRO Theor. Informatics Appl. 42(4): 657 (2008) - [c61]Juhani Karhumäki, Aleksi Saarela:
An Analysis and a Reproof of Hmelevskii's Theorem. Developments in Language Theory 2008: 467-478 - [c60]Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin:
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. LATIN 2008: 94-105 - [c59]Juhani Karhumäki:
Reachability via Cooperating Morphisms. RP 2008: 15-27 - [e10]Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, C.-H. Luke Ong:
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 273, Springer 2008, ISBN 978-0-387-09679-7 [contents] - [e9]Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková:
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. Lecture Notes in Computer Science 4910, Springer 2008, ISBN 978-3-540-77565-2 [contents] - [e8]Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková:
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. Safarik University, Kosice, Slovakia 2008, ISBN 978-80-7097-697-5 [contents] - 2007
- [j87]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): 873-897 (2007) - [j86]Elena Czeizler, Stepan Holub, Juhani Karhumäki, Markku Laine:
Intricacies of Simple Word Equations: an Example. Int. J. Found. Comput. Sci. 18(6): 1167-1175 (2007) - [j85]Vesa Halava, Tero Harju, Juhani Karhumäki:
The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. Theory Comput. Syst. 40(1): 43-54 (2007) - [j84]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): 355-362 (2007) - [c58]Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. CPM 2007: 295-306 - [e7]Tero Harju, Juhani Karhumäki, Arto Lepistö:
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings. Lecture Notes in Computer Science 4588, Springer 2007, ISBN 978-3-540-73207-5 [contents] - 2006
- [j83]Vesa Halava, Tero Harju, Juhani Karhumäki:
Undecidability in omega-Regular Languages. Fundam. Informaticae 73(1-2): 119-125 (2006) - [j82]Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki:
Preface. Theor. Comput. Sci. 356(1-2): 1-5 (2006) - [j81]Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Computing by commuting. Theor. Comput. Sci. 356(1-2): 200-211 (2006) - [c57]Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Communication of Two Stacks and Rewriting. ICALP (2) 2006: 468-479 - [e6]Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki:
Finite-State Methods and Natural Language Processing, 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005. Revised Papers. Lecture Notes in Computer Science 4002, Springer 2006, ISBN 3-540-35467-0 [contents] - 2005
- [j80]Christian Choffrut, Juhani Karhumäki:
Some decision problems on integer matrices. RAIRO Theor. Informatics Appl. 39(1): 125-131 (2005) - [j79]Juhani Karhumäki, Michel Latteux, Ion Petre:
Commutation with Ternary Sets of Words. Theory Comput. Syst. 38(2): 161-169 (2005) - [j78]Juhani Karhumäki, Grzegorz Rozenberg:
Preface: Insightful Theory. Theor. Comput. Sci. 330(1): 1 (2005) - [j77]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): 105-118 (2005) - [j76]Tero Harju, Juhani Karhumäki, Antonio Restivo:
Preface. Theor. Comput. Sci. 339(1): 1-2 (2005) - [j75]Juhani Karhumäki, Michel Latteux, Ion Petre:
Commutation with codes. Theor. Comput. Sci. 340(1): 322-333 (2005) - [j74]Josep Díaz, Juhani Karhumäki:
Preface. Theor. Comput. Sci. 348(2-3): 129 (2005) - 2004
- [j73]Juhani Karhumäki, Jeffrey O. Shallit:
Polynomial versus exponential growth in repetition-free binary words. J. Comb. Theory A 105(2): 335-347 (2004) - [j72]Tero Harju, Juhani Karhumäki:
Many aspects of defect theorems. Theor. Comput. Sci. 324(1): 35-54 (2004) - [c56]Karel Culík II, Juhani Karhumäki, Petri Salmela:
Fixed Point Approach to Commutation of Languages. Aspects of Molecular Computing 2004: 119-131 - [c55]Juhani Karhumäki:
Finite Sets of Words and Computing. MCU 2004: 36-49 - [e5]Juhani Karhumäki, Hermann A. Maurer, Gheorghe Paun, Grzegorz Rozenberg:
Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday. Lecture Notes in Computer Science 3113, Springer 2004, ISBN 3-540-22393-2 [contents] - [e4]Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella:
Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings. Lecture Notes in Computer Science 3142, Springer 2004, ISBN 3-540-22849-7 [contents] - 2003
- [j71]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
The complexity of compressing subsegments of images described by finite automata. Discret. Appl. Math. 125(2-3): 235-254 (2003) - [j70]Vesa Halava, Tero Harju, Juhani Karhumäki:
Decidability of the binary infinite Post Correspondence Problem. Discret. Appl. Math. 130(3): 521-526 (2003) - [j69]Jean Berstel, Juhani Karhumäki:
Combinatorics on words: a tutorial. Bull. EATCS 79: 178- (2003) - [j68]Juhani Karhumäki, Leonid P. Lisovik:
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c. Inf. Comput. 187(1): 40-48 (2003) - [j67]Juhani Karhumäki, Leonid P. Lisovik:
The Equivalence Problem of Finite Substitutions on ab*c, with Applications. Int. J. Found. Comput. Sci. 14(4): 699- (2003) - [j66]Juhani Karhumäki, Ján Manuch, Wojciech Plandowski:
A defect theorem for bi-infinite words. Theor. Comput. Sci. 292(1): 237-243 (2003) - [c54]Juhani Karhumäki, Michel Latteux, Ion Petre:
The Commutation with Codes and Ternary Sets of Words. STACS 2003: 74-84 - [c53]Juhani Karhumäki:
Automata on Words. CIAA 2003: 3-10 - [i2]Juhani Karhumäki, Jeffrey O. Shallit:
Polynomial versus Exponential Growth in Repetition-Free Binary Words. CoRR math.CO/0304095 (2003) - 2002
- [j65]Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger:
Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Inf. Comput. 172(2): 202-217 (2002) - [j64]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): 459-471 (2002) - [j63]Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa:
Some Decision Problems Concerning Semilinearity and Commutation. J. Comput. Syst. Sci. 65(2): 278-294 (2002) - [j62]Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski:
Locally Periodic Versus Globally Periodic Infinite Words. J. Comb. Theory A 100(2): 250-264 (2002) - [j61]Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger:
The commutation of finite sets: a challenging problem. Theor. Comput. Sci. 273(1-2): 69-79 (2002) - [j60]Juhani Karhumäki, Ján Manuch:
Multiple factorizations of words and defect effect. Theor. Comput. Sci. 273(1-2): 81-97 (2002) - [j59]Juhani Karhumäki, Ion Petre:
Conway's problem for three-word sets. Theor. Comput. Sci. 289(1): 705-725 (2002) - [c52]Juhani Karhumäki, Ion Petre:
The Branching Point Approach to Conway's Problem. Formal and Natural Computing 2002: 69-76 - [c51]Juhani Karhumäki, Leonid P. Lisovik:
The Equivalence Problem of Finite Substitutions on ab*c, with Applications. ICALP 2002: 812-820 - [c50]Juhani Karhumäki:
Applications of Finite Automata. MFCS 2002: 40-58 - [c49]Mika Hirvensalo, Juhani Karhumäki:
Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example. MFCS 2002: 319-327 - [e3]Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto Salomaa:
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]. Lecture Notes in Computer Science 2300, Springer 2002, ISBN 3-540-43190-X [contents] - 2001
- [j58]Juhani Karhumäki, Ion Petre:
Conway's Problem and the Communication of Languages. Bull. EATCS 74: 171-189 (2001) - [j57]Julien Cassaigne, Juhani Karhumäki, Ján Manuch:
On Conjugacy of Languages. RAIRO Theor. Informatics Appl. 35(6): 535-550 (2001) - [c48]Christian Choffrut, Juhani Karhumäki:
On Fatou properties of rational languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 227-235 - [c47]Karel Culík II, Juhani Karhumäki, Jarkko Kari:
A Note on Synchronized Automata and Road Coloring Problem. Developments in Language Theory 2001: 175-185 - [c46]Juhani Karhumäki:
Challenges of Commutation. FCT 2001: 15-23 - [c45]