Juhani Karhumäki | Academic Influence

Juhani Karhumäki's AcademicInfluence.com Rankings

Juhani Karhumäki

Computer Science

#3114

World Rank

#3265

Historical Rank

Theoretical Computer Science

#54

World Rank

#54

Historical Rank

computer-science Degrees

Juhani Karhumäki

Mathematics

#5402

World Rank

#7605

Historical Rank

Measure Theory

#2825

World Rank

#3363

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Juhani Karhumäki's Degrees

PhD Mathematics University of Turku

Why Is Juhani Karhumäki Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Eero Urho Juhani Karhumäki is a Finnish mathematician and theoretical computer scientist known for his contributions to automata theory. He is a professor at the University of Turku. Biography Karhumäki earned his doctorate from the University of Turku in 1976. In 1980–1985, he was a junior researcher of Academy of Finland. Since 1986, he has held teaching positions at the University of Turku, attaining full professorship in 1998. In 1998–2015, Karhumäki was the head of the mathematics department at the University of Turku. He has authored altogether around 200 research papers.

(See a Problem?)

Juhani Karhumäki's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Combinatorics of Words (1997) (218)
The Equivalence Problem of Multitape Finite Automata (1991) (136)
Combinatorics on words: a tutorial (2003) (97)
ALGEBRAIC COMBINATORICS ON WORDS (Encyclopedia of Mathematics and its Applications 90) By M. LOTHAIRE: 504 pp., 60.00, ISBN 0 521 81220 8 (Cambridge University Press, 2002) (2003) (93)
The expressibility of languages and relations by word equations (1997) (86)
The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable (1982) (86)
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 (2008) (86)
Computer Science - Theory and Applications (2014) (81)
On cube-free ω-words generated by binary morphisms (1983) (80)
Finite Automata Computing Real Functions (1994) (78)
Communication Complexity Method for Measuring Nondeterminism in Finite Automata (2002) (76)
Polynomial versus exponential growth in repetition-free binary words (2003) (75)
Systems of equations over a free monoid and Ehrenfeucht's conjecture (1983) (64)
On the Undecidability of Freeness of Matrix Semigroups (1999) (63)
Jewels are Forever (1999) (61)
Some Decision Problems Concerning Semilinearity and Commutation (2002) (60)
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable (1986) (60)
Formal and Natural Computing (2002) (59)
On a generalization of Abelian equivalence and complexity of infinite words (2013) (58)
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (1997) (58)
A Note on Synchronized Automata and Road Coloring Problem (2001) (49)
Some decision problems on integer matrices (2005) (46)
On the power of synchronization in parallel computations (1989) (44)
The commutation of finite sets: a challenging problem (1999) (39)
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid (1982) (38)
Theory Is Forever (2004) (37)
Iterative Devices Generating Infinite Words (1992) (36)
Generalized Parikh Mappings and Homomorphisms (1980) (36)
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable (1986) (35)
On the defect theorem and simplifiability (1986) (34)
On the Equality Sets for Homomorphisms on Free Monoids with Two Generators (1980) (34)
The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids (1984) (32)
On stateless multihead automata: Hierarchies and the emptiness problem (2008) (32)
Examples of Undecidable Problems for 2-Generator Matrix Semigroups (1998) (31)
A note on morphic characterization of languages (1983) (31)
On binary equality sets and a solution to the test set conjecture in the binary case (1983) (29)
Measures of Nondeterminism in Finite Automata (2000) (28)
Conway's problem for three-word sets (2002) (27)
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable (1987) (27)
Alternating Iteration of Morphisms and the Kolakovski Sequence (1992) (26)
A New Proof for the Dol Sequence Equivalence Problem and its Implications (1986) (26)
Problems in between words and abelian words: k-abelian avoidability (2012) (24)
On the Size of Independent Systems of Equations in Semigroups (1994) (24)
On the Equivalence Problem for Binary DOL Systems (1981) (24)
Many aspects of defect theorems (2004) (23)
Matrix Equations and Hilbert's Tenth Problem (2008) (22)
Results Concerning Palindromicity (1987) (22)
On Computational Power of Weighted Finite Automata (1992) (21)
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa (1999) (21)
On Recent Trends in Formal Language Theory (1987) (21)
On abelian versions of critical factorization theorem (2012) (20)
On Three-Element Codes (1984) (20)
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages (1984) (19)
Fine and Wilf's Theorem for k-Abelian Periods (2012) (19)
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002] (2002) (18)
Local Squares, Periodicity and Finite Automata (2011) (18)
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (2013) (18)
The Equivalence Problem of Finite Substitutions on ab*c, with Applications (2002) (18)
Commutation with codes (2005) (17)
On the Centralizer of a Finite Set (2000) (17)
TWO PROBLEMS ON COMMUTATION OF LANGUAGES (2004) (17)
A note on intersections of free submonoids of a free monoid (1983) (16)
On the Defect Effect of Many Identities in Free Semigroups (1994) (16)
On Fatou properties of rational languages (1999) (16)
A Note on Decidability Questions on Presentations of Word Semigroups (1997) (15)
On growth and fluctuation of k-abelian complexity (2015) (15)
Automata on Words (2003) (15)
On Continuous Functions Computed by Finite Automata (1994) (14)
Remarks on Generalized Post Correspondence Problem (1996) (14)
A Property of Three-Element Codes (1984) (14)
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata (1997) (13)
The Commutation with Codes and Ternary Sets of Words (2003) (13)
On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns (2007) (13)
Testing k-binomial equivalence (2015) (13)
On Strongly Cube-Free Omega-Words Generated by Binary Morphisms (1981) (13)
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages (2001) (12)
A defect theorem for bi-infinite words (2003) (12)
Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory (1993) (12)
Commutation with Ternary Sets of Words (2005) (12)
Efficient constructions of test sets for regular and context-free languages (1991) (12)
Independent systems of equations (2002) (12)
Degrees of Infinite Words, Polynomials and Atoms (2016) (11)
On the Ehrenfeucht Conjecture for DOL Languages (1983) (11)
Challenges of commutation : An advertisement (2001) (11)
Polynomial Size Test Sets for Context-Free Languages (1992) (11)
Two Theorems Concerning Recognizable N-Subsets of sigma* (1976) (10)
Decidability of the binary infinite Post Correspondence Problem (2003) (10)
Noneffective Regularity of Equality Languages and Bounded Delay Morphisms (2010) (10)
Compactness of Systems of Equations in Semigroups (1995) (10)
On Defect Effect of Bi-Infinite Words (1998) (9)
On the Unavoidability of k-Abelian Squares in Pure Morphic Words (2013) (9)
Combinatorial and Computational Problems on Finite Sets of Words (2001) (9)
Problem 10.3 Freeness of multiplicative matrix semigroups (2009) (9)
On cardinalities of k-abelian equivalence classes (2016) (9)
On maximal chains of systems of word equations (2011) (9)
The equivalence of mappings on languages (1986) (9)
Defect Theorems for Trees (1999) (9)
Computing by commuting (2006) (9)
Intricacies of Simple Word Equations: an Example (2007) (9)
Test sets for morphisms with bounded delay (1983) (8)
Tiling Periodicity (2007) (8)
Conjugacy of finite biprefix codes (2009) (8)
Decision problems solved with the help of the Ehrenfeucht conjecture (1985) (8)
The Branching Point Approach to Conway's Problem (2002) (8)
On Conjugacy of Languages (2001) (8)
Theory is forever : essays dedicated to Arto Salomaa on the occasion of his 70th birthday (2004) (8)
The Decidability of the Equivalence Problem for Polynomially Bounded DOL Sequences (1977) (8)
Inverse Morphic Equivalence on Languages (1984) (7)
Combinatorics on Words : A New Challenging Topic 1 (2004) (7)
Pattern matching for images generated by finite automata (2000) (7)
Comparing Descriptional and Computational Complexity of Infinite Words (1994) (7)
A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language (1986) (7)
Conway's Problem and the Communication of Languages (2001) (7)
On Totalistic Systolic Networks (1988) (7)
k-Abelian Equivalence and Rationality (2016) (7)
Decidability of the multiplicity equivalence of multitape finite automata (1990) (7)
Computing partial information out of intractable: Powers of algebraic numbers as an example (2010) (6)
On k-Abelian Palindromic Rich and Poor Words (2014) (6)
On k-abelian palindromes (2018) (6)
An Example of a PD2L-System with the Growth Type 2½ (1973) (6)
Freeness of Multiplicative Matrix Semigroups (2003) (6)
Compactness of Systems of Equations on Completely Regular Semigroups (1997) (6)
Challenges of Commutation (2001) (6)
Post Correspondence Problem for short words (2008) (6)
On morphic generation of regular languages (1986) (5)
An Analysis and a Reproof of Hmelevskii's Theorem (2008) (5)
On Abelian Subshifts (2018) (5)
Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example (2002) (5)
Locally Periodic Infinite Words and a Chaotic Behaviour (1998) (5)
Remarks on Commutative N -Rational Series (1977) (5)
Finite-State Methods and Natural Language Processing (2005) (5)
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c (2001) (5)
Multiple factorizations of words and defect effect (2000) (5)
Finite-State Methods and Natural Language Processing (2005) (5)
The Compression of Subsegments of Images Described by Finite Automata (1999) (4)
Interactive L Systems with Almost Interactionless Behaviour (1979) (4)
Applications of Finite Automata (2002) (4)
On the Equivalence of Finite Substitutions and Transducers (1999) (4)
Fixed Point Approach to Commutation of Languages (2004) (4)
Finite-state methods and natural language processing : 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005 : revised papers (2006) (4)
Generalized Factorizations of Words and Their Algorithmic Properties (1999) (4)
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata (2020) (4)
Extension of the decidability of the marked PCP to instances with unique blocks (2007) (4)
The Ehrenfeucht Conjecture for Transducers (1987) (3)
Multiplicities: A Deterministsic View of Nondeterminism (1992) (3)
Undecidability in ω-Regular Languages (2006) (3)
Proceedings of the 34th conference on Current trends in theory and practice of computer science (2008) (3)
Combinatorics on Infinite Words (2004) (3)
Automata, Languages and Programming (1974) (3)
Loops in automata and HDTOL relations (1990) (3)
The complexity of compressing subsegments of images described by finite automata (2003) (3)
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations (2009) (3)
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract) (1995) (3)
On abelian saturated infinite words (2019) (3)
Synchronizable deterministic pushdown automata and the decidability of their equivalence (1986) (3)
The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems (2007) (3)
Communication of Two Stacks and Rewriting (2006) (3)
On the expressibility of languages by word equations with a bounded number of variables (2001) (3)
Finite Sets of Words and Computing (2004) (3)
Post Correspondence Problem for morphisms with unique blocks (2005) (3)
Systems of equations over a finitely generated free monoid having an effectively findable equivalent finite subsystem (1988) (2)
On Commutative DT0L Systems (1979) (2)
Computer science -- theory and applications : 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012 : proceedings (2012) (2)
Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa Graz, Austria, June 10-11, 1994 : Proceedings (1994) (2)
Decision Questions Concerning Semilinearity Morphisms and (2000) (2)
Some Growth Functions of Context-Dependent L-Systems (1974) (2)
On k-abelian avoidability (2013) (2)
Finite transducers and rational transductions (2021) (2)
On Length Sets of Informationless L Systems (1975) (2)
Open problems and exercises on words and languages (2005) (2)
Weighted Finite Automata: Computing with Different Topologies (2011) (2)
A note on DOL length sets (1978) (2)
HDTOL matching of computations of multitape automata (1989) (2)
Locally catenative sequences and Turtle graphics (2011) (2)
Perface (2018) (2)
On the complexity of decidable cases of the commutation problem of languages (2005) (1)
Undecidability in omega-Regular Languages (2006) (1)
On the Power of Cooperating Morphisms via Reachability Problems (2009) (1)
Automata, languages and programming : 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004 : proceedings (2004) (1)
Two Lower Bounds on Computational Complexity of Infinite Words (1997) (1)
Computational power of two stacks with restricted communication (2010) (1)
On Abelian Closures of Infinite Non-binary Words (2020) (1)
On the Complexity of Decidable Cases of Commutation Problem for Languages (2001) (1)
Equations in the Partial Semigroup of Words with Overlapping Products (2012) (1)
Regularity of k-Abelian Equivalence Classes of Fixed Cardinality (2018) (1)
Two Lower Bounds on Computational Complexity of Infinite Word Generation (1994) (1)
A compactness property of the k-abelian monoids (2020) (1)
On the Equivalence Problem for Deterministic Multitape Automata and Transducers (1989) (1)
The Impact of the DOL Problem (1993) (1)
Mini-Workshop: Combinatorics on Words (2010) (1)
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version) (2018) (1)
Reachability via Cooperating Morphisms (2008) (1)
The Unique Decipherability in the Monoid of Regular Languages is Undecidable (2011) (1)
A Note on the Equivalence Problem of Rational Formal Power Series (1986) (1)
Preface (2011) (0)
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings (2007) (0)
A Short Biography of Arto Salomaa (1999) (0)
On k-abelian avoidability (2013) (0)
On the balance of d-bonacci word (2012) (0)
Proceedings of the Fourth Russian Finnish Symposium on DiscreteMathematics : Organized in Turku on 16.-19.5.2017 (2017) (0)
Preface (2015) (0)
Review: Jean Berstel and Dominique Perrin, Theory of codes (1987) (0)
Preface (2005) (0)
Finite automata, image manipulation, and automatic real functions (2021) (0)
Preface (2005) (0)
Theoretical Informatics and Applications on Conjugacy of Languages * (0)
Preface (2016) (0)
A lower bound for a constant in Shallit's conjecture (1997) (0)
Preface (2012) (0)
On the complexity of computing the order of repetition of a string (2000) (0)
Finite sets of words and computing : (A Survey) (2005) (0)
Words 2013 (2015) (0)
Preface (2008) (0)
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 (2008) (0)
Loughborough University Institutional Repository Matrix equations and Hilbert ' s tenth problem (2017) (0)
The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin (2018) (0)
Mathematisches Forschungsinstitut Oberwolfach Mini-workshop: Combinatorics on Words (2010) (0)
Automata, Languages and Programming (2001) (0)
On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (2014) (0)
On abelian versions of Critical Factorization Theorem ∗ Extended (2010) (0)
Systems of Equations over a Finite Set of Words and Automata Theory (1990) (0)
Proceedings of the 11th international conference on Developments in language theory (2007) (0)
The Salomaa Prize 2019 was given to Dr. Artur Jez (2019) (0)
Combinatorics on words : 9th International Conference, WORDS 2013, Turku, Finland, September 16-20, 2013, proceedings (2013) (0)
Preface: Special issue on combinatorics on words (2004) (0)
Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju (2012) (0)
A note on HDTOL Languages and the Equivalence of Deterministic Pushdown Transducers (1989) (0)
Preface: Insightful Theory (2005) (0)
Iwami : Syntactic Unification over Rational Terms Revisited 15 14 (2018) (0)
Automata on words: (Extended abstract) (2003) (0)
Ramsay Theory and Related Topics Period III , Spring 2015 (0)
Binary operations on automatic functions (2008) (0)
Preface (2006) (0)
From Models to Languages (2014) (0)
Interactive L systems with almost interactionless behaviour, faculty of mathematics res. rep. CS-78-47 (1980) (0)
Proceedings of the 9th International Conference on Combinatorics on Words - Volume 8079 (2013) (0)
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science (1994) (0)
Descriptional complexity of formal systems : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, proceedings (2014) (0)
Preface (2008) (0)
Preface (2014) (0)

This paper list is powered by the following services:

Other Resources About Juhani Karhumäki

What Schools Are Affiliated With Juhani Karhumäki?

Juhani Karhumäki is affiliated with the following schools:

University of Turku

Image Attributions

Image Source for Juhani Karhumäki