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]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Decidable Cases of Commutation Problem for Languages. FCT 2001: 193-203 - [c44]Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa:
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. ICALP 2001: 579-590 - [c43]Juhani Karhumäki:
Combinatorial and Computational Problems on Finite Sets of Words. MCU 2001: 69-81 - [c42]Juhani Karhumäki, Leonid P. Lisovik:
A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c. STACS 2001: 388-395 - 2000
- [j56]Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski:
The expressibility of languages and relations by word equations. J. ACM 47(3): 483-505 (2000) - [j55]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata. Nord. J. Comput. 7(1): 1-13 (2000) - [c41]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert:
Measures of Nondeterminism in Finite Automata. ICALP 2000: 199-210 - [c40]Juhani Karhumäki, Ion Petre:
On the Centralizer of a Finite Set. ICALP 2000: 536-546 - [i1]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert:
Measures of Nondeterminism in Finite Automata. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j54]Juhani Karhumäki, Sabrina Mantaci:
Defect Theorems for Trees. Fundam. Informaticae 38(1-2): 119-133 (1999) - [j53]Julien Cassaigne, Tero Harju, Juhani Karhumäki:
On the Undecidability of Freeness of Matrix Semigroups. Int. J. Algebra Comput. 9(3-4): 295-306 (1999) - [j52]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Generalized Factorizations of Words and Their Algorithmic Properties. Theor. Comput. Sci. 218(1): 123-133 (1999) - [j51]Juhani Karhumäki:
A Short Biography of Arto Salomaa. Theor. Comput. Sci. 226(1-2): 3-5 (1999) - [c39]Juhani Karhumäki, Leonid P. Lisovik:
On the Equivalence of Finite Substitutions and Transducers. Jewels are Forever 1999: 97-108 - [c38]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
The Compression of Subsegments of Images Described by Finite Automata. CPM 1999: 186-195 - [c37]Juhani Karhumäki, Sabrina Mantaci:
Defect theorems for trees. Developments in Language Theory 1999: 164-177 - [c36]Juhani Karhumäki, Wojciech Plandowski:
On the complexity of computing the order of repetition of a string. Developments in Language Theory 1999: 178-184 - [e2]Juhani Karhumäki, Hermann A. Maurer, Gheorghe Paun, Grzegorz Rozenberg:
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa. Springer 1999, ISBN 3-540-65984-6 [contents] - 1998
- [j50]Julien Cassaigne, Juhani Karhumäki:
Examples of Undecidable Problems for 2-Generator Matrix Semigroups. Theor. Comput. Sci. 204(1-2): 29-34 (1998) - [c35]Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski:
Locally Periodic Infinite Words and a Chaotic Behaviour. ICALP 1998: 421-430 - [c34]Juhani Karhumäki, Ján Manuch, Wojciech Plandowski:
On Defect Effect of Bi-Infinite Words. MFCS 1998: 674-682 - 1997
- [j49]Julien Cassaigne, Juhani Karhumäki:
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms. Eur. J. Comb. 18(5): 497-510 (1997) - [j48]Tero Harju, Juhani Karhumäki, Wojciech Plandowski:
Compactness of Systems of Equations in Semigroups. Int. J. Algebra Comput. 7(4): 457-470 (1997) - [j47]Christian Choffrut, Tero Harju, Juhani Karhumäki:
A Note on Decidability Questions on Presentations of Word Semigroups. Theor. Comput. Sci. 183(1): 83-92 (1997) - [c33]Tero Harju, Juhani Karhumäki, Mario Petrich:
Compactness of Systems of Equations on Completely Regular Semigroups. Structures in Logic and Computer Science 1997: 268-280 - [c32]Juraj Hromkovic, Juhani Karhumäki:
Two Lower Bounds on Computational Complexity of Infinite Words. New Trends in Formal Languages 1997: 366-376 - [c31]Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi:
A lower bound for a constant in Shallit's conjecture. Developments in Language Theory 1997: 103-118 - [c30]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. FCT 1997: 245-256 - [c29]Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi:
The Expressibility of Languages and Relations by Word Equations. ICALP 1997: 98-109 - [p5]Christian Choffrut, Juhani Karhumäki:
Combinatorics of Words. Handbook of Formal Languages (1) 1997: 329-438 - [p4]Tero Harju, Juhani Karhumäki:
Morphisms. Handbook of Formal Languages (1) 1997: 439-510 - 1996
- [j46]Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Computational Power of Weighted Finite Automata. Fundam. Informaticae 25(3): 285-293 (1996) - [j45]Juhani Karhumäki, Wojciech Plandowski:
On the Size of Independent Systems of Equations in Semigroups. Theor. Comput. Sci. 168(1): 105-119 (1996) - [c28]Tero Harju, Juhani Karhumäki, Daniel Krob:
Remarks on Generalized Post Correspondence Problem. STACS 1996: 39-48 - 1995
- [j44]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Polynomial Size Test Sets for Context-Free Languages. J. Comput. Syst. Sci. 50(1): 11-19 (1995) - [c27]Julien Cassaigne, Juhani Karhumäki:
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). COCOON 1995: 244-253 - [c26]Tero Harju, Juhani Karhumäki, Wojciech Plandowski:
Compactness of Systems of Equations in Semigroups. ICALP 1995: 444-454 - 1994
- [j43]Karel Culík II, Juhani Karhumäki:
Iterative Devices Generating Infinite Words. Int. J. Found. Comput. Sci. 5(1): 69-97 (1994) - [j42]Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Continuous Functions Computed by Finite Automata. RAIRO Theor. Informatics Appl. 28(3-4): 387-403 (1994) - [j41]Karel Culík II, Juhani Karhumäki:
Finite Automata Computing Real Functions. SIAM J. Comput. 23(4): 789-814 (1994) - [c25]Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö:
Comparing Descriptional and Computational Complexity of Infinite Words. Results and Trends in Theoretical Computer Science 1994: 169-182 - [c24]Juraj Hromkovic, Juhani Karhumäki:
Two Lower Bounds on Computational Complexity of Infinite Word Generation. IFIP Congress (1) 1994: 479-484 - [c23]Juhani Karhumäki, Wojciech Plandowski:
On the Size of Independent Systems of Equations in Semigroups. MFCS 1994: 443-452 - [p3]Juhani Karhumäki, Wojciech Plandowski:
On the Defect Effect of Many Identities in Free Semigroups. Mathematical Aspects of Natural and Formal Languages 1994: 225-232 - [e1]Juhani Karhumäki, Hermann A. Maurer, Grzegorz Rozenberg:
Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10-11, 1994, Proceedings. Lecture Notes in Computer Science 812, Springer 1994, ISBN 3-540-58131-6 [contents] - 1993
- [j40]Juhani Karhumäki:
Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory. Theor. Comput. Sci. 108(1): 103-118 (1993) - [j39]Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek:
Efficient constructions of test sets for regular and context-free languages. Theor. Comput. Sci. 116(2): 305-316 (1993) - [p2]Juhani Karhumäki:
The Impact of the DOL Problem. Current Trends in Theoretical Computer Science 1993: 586-594 - 1992
- [j38]Juhani Karhumäki:
Multiplicities: A Deterministsic View of Nondeterminism. Theor. Comput. Sci. 98(1): 15-25 (1992) - [c22]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Polynomial Size Test Sets for Context-Free Languages. ICALP 1992: 53-64 - [c21]Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Computational Power of Weighted Finite Automata. MFCS 1992: 236-245 - [c20]Karel Culík II, Juhani Karhumäki:
Iterative Devices Generating Infinite Words. STACS 1992: 531-543 - 1991
- [j37]Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová:
On the power of synchronization in parallel computations. Discret. Appl. Math. 32(2): 155-182 (1991) - [j36]Tero Harju, Juhani Karhumäki:
The Equivalence Problem of Multitape Finite Automata. Theor. Comput. Sci. 78(2): 347-355 (1991) - [c19]Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek:
Efficient Constructions of Test Sets for Regular and Context-Free Languages. MFCS 1991: 249-258 - 1990
- [j35]Karel Culík II, Juhani Karhumäki:
Loops in automata and HDTOL relations. RAIRO Theor. Informatics Appl. 24: 327-337 (1990) - [c18]Juhani Karhumäki:
Systems of Equations over a Finite Set of Words and Automata Theory. IWWERT 1990: 247-249 - [c17]Tero Harju, Juhani Karhumäki:
Decidability of the Multiplicity Equivalence of Multitape Finite Automata. STOC 1990: 477-481
1980 – 1989
- 1989
- [j34]Karel Culík II, Juhani Karhumäki:
HDTOL Matching of Computations of Multitape Automata. Acta Informatica 27(2): 179-191 (1989) - [c16]Jürgen Dassow, Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová:
On the Power of Synchronization in Parallel Computations. MFCS 1989: 196-206 - [c15]Karel Culík II, Juhani Karhumäki:
On the Equivalence Problem for Deterministic Multitape Automata and Transducers. STACS 1989: 468-479 - [p1]Karel Culík II, Juhani Karhumäki:
A note on HDTOL Languages and the Equivalence of Deterministic Pushdown Transducers. A Perspective in Theoretical Computer Science 1989: 23-32 - 1988
- [j33]Arto Salomaa, Juhani Karhumäki:
The Formal Language Theory Column. Bull. EATCS 34: 82-96 (1988) - [j32]Karel Culík II, Juhani Karhumäki:
On Totalistic Systolic Networks. Inf. Process. Lett. 26(5): 231-236 (1988) - 1987
- [j31]Juhani Karhumäki:
The Ehrenfeucht Conjecture for Transducers. J. Inf. Process. Cybern. 23(8/9): 389-401 (1987) - [j30]Sándor Horváth, Juhani Karhumäki, Jetty Kleijn:
Results Concerning Palindromicity. J. Inf. Process. Cybern. 23(8/9): 441-451 (1987) - [j29]Karel Culík II, Juhani Karhumäki:
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable. SIAM J. Comput. 16(2): 221-230 (1987) - [c14]Juhani Karhumäki:
On Recent Trends in Formal Language Theory. ICALP 1987: 136-162 - 1986
- [j28]Karel Culík II, Juhani Karhumäki:
Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence. Acta Informatica 23(5): 597-605 (1986) - [j27]Tero Harju, Juhani Karhumäki, H. C. M. Kleijn:
On morphic generation of regular languages. Discret. Appl. Math. 15(1): 55-60 (1986) - [j26]Karel Culík II, Juhani Karhumäki:
A Note on the Equivalence Problem of Rational Formal Power Series. Inf. Process. Lett. 23(1): 29-31 (1986) - [j25]Juhani Karhumäki, Yael Maon:
A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language. J. Comput. Syst. Sci. 32(3): 315-322 (1986) - [j24]Karel Culík II, Juhani Karhumäki:
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable. Theor. Comput. Sci. 47(3): 71-84 (1986) - [c13]Juhani Karhumäki:
The equivalence of mappings on languages. IMYCS 1986: 26-38 - [c12]Karel Culík II, Juhani Karhumäki:
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. MFCS 1986: 264-272 - 1985
- [j23]Christian Choffrut, Juhani Karhumäki:
Test sets for morphisms with bounded delay. Discret. Appl. Math. 12(2): 93-101 (1985) - [j22]Karel Culík II, Juhani Karhumäki:
Decision problems solved with the help of the Ehrenfeucht conjecture. Bull. EATCS 27: 30-34 (1985) - [j21]Juhani Karhumäki, H. C. M. Kleijn:
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages. RAIRO Theor. Informatics Appl. 19(3): 203-211 (1985) - [j20]Juhani Karhumäki:
On Three-Element Codes. Theor. Comput. Sci. 40: 3-11 (1985) - [j19]Juhani Karhumäki:
A Property of Three-Element Codes. Theor. Comput. Sci. 41: 215-222 (1985) - 1984
- [j18]Juhani Karhumäki, Derick Wood:
Inverse Morphic Equivalence on Languages. Inf. Process. Lett. 19(5): 213-218 (1984) - [j17]Juhani Karhumäki:
The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids. Theor. Comput. Sci. 29: 285-308 (1984) - [c11]Juhani Karhumäki:
On Three-Element Codes. ICALP 1984: 292-302 - [c10]Juhani Karhumäki, H. C. M. Kleijn:
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages. MFCS 1984: 355-363 - [c9]Juhani Karhumäki:
A Property of Three-Element Codes. STACS 1984: 305-313 - 1983
- [j16]Juhani Karhumäki, Matti Linna:
A note on morphic characterization of languages. Discret. Appl. Math. 5(2): 243-246 (1983) - [j15]Juhani Karhumäki:
On cube-free ω-words generated by binary morphisms. Discret. Appl. Math. 5(3): 279-297 (1983) - [j14]Karel Culík II, Juhani Karhumäki:
Systems of equations over a free monoid and Ehrenfeucht's conjecture. Discret. Math. 43(2-3): 139-153 (1983) - [j13]Karel Culík II, Juhani Karhumäki:
On the Ehrenfeucht Conjecture for DOL Languages. RAIRO Theor. Informatics Appl. 17(3): 205-230 (1983) - [c8]Christian Choffrut, Juhani Karhumäki:
Test Sets for Morphisms with Bounded Delay. ICALP 1983: 118-127 - [c7]Juhani Karhumäki:
A Note on Intersections of Free Submonoids of a Free Monoid. ICALP 1983: 397-407 - 1982
- [j12]Jürgen Albert, Karel Culík II, Juhani Karhumäki:
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid. Inf. Control. 52(2): 172-186 (1982) - [j11]Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg:
The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable. Theor. Comput. Sci. 21: 119-144 (1982) - [c6]Juhani Karhumäki:
On the Equivalence Problem for Binary DOL Systems. ICALP 1982: 339-347 - 1981
- [j10]Juhani Karhumäki:
On the Equivalence Problem for Binary DOL Systems. Inf. Control. 50(3): 276-284 (1981) - [c5]Juhani Karhumäki:
On Strongly Cube-Free Omega-Words Generated by Binary Morphisms. FCT 1981: 182-189 - [c4]Juhani Karhumäki:
Generalized Parikh Mappings and Homomorphisms. ICALP 1981: 324-332 - 1980
- [j9]Juhani Karhumäki:
Generalized Parikh Mappings and Homomorphisms. Inf. Control. 47(3): 155-165 (1980) - [j8]Karel Culík II, Juhani Karhumäki:
On the Equality Sets for Homomorphisms on Free Monoids with Two Generators. RAIRO Theor. Informatics Appl. 14(4): 349-369 (1980)
1970 – 1979
- 1979
- [j7]Karel Culík II, Juhani Karhumäki:
Interactive L Systems with Almost Interactionless Behaviour. Inf. Control. 43(1): 83-100 (1979) - [j6]Juhani Karhumäki:
On Commutative DT0L Systems. Theor. Comput. Sci. 9: 207-220 (1979) - [c3]Karel Culík II, Juhani Karhumäki:
Interactive L Systems with Almost Interactionless Behaviour. MFCS 1979: 246-257 - 1978
- [j5]Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg:
A note on DOL length sets. Discret. Math. 22(3): 233-242 (1978) - 1977
- [j4]Juhani Karhumäki:
The Decidability of the Equivalence Problem for Polynomially Bounded DOL Sequences. RAIRO Theor. Informatics Appl. 11(1): 17-28 (1977) - [j3]Juhani Karhumäki:
Remarks on Commutative N -Rational Series. Theor. Comput. Sci. 5(2): 211-217 (1977) - 1976
- [j2]Juhani Karhumäki:
Two Theorems Concerning Recognizable N-Subsets of sigma*. Theor. Comput. Sci. 1(4): 317-323 (1976) - 1975
- [c2]Juhani Karhumäki:
On Length Sets of Informationless L Systems. Automata, Languages, Development 1975: 227-242 - 1974
- [c1]Juhani Karhumäki:
Some Growth Functions of Context-Dependent L-Systems. L Systems 1974: 127-135 - 1973
- [j1]Juhani Karhumäki:
An Example of a PD2L-System with the Growth Type 2½. Inf. Process. Lett. 2(5): 131-134 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
