Juhani Karhumäki

According to our database, Juhani Karhumäki authored at least 186 papers between 1973 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

On abelian closures of infinite non-binary words.

Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland

Discret. Math., 2024

2021

Finite automata, image manipulation, and automatic real functions.

Juhani Karhumäki, Jarkko Kari

Proceedings of the Handbook of Automata Theory., 2021

Finite transducers and rational transductions.

Tero Harju, Juhani Karhumäki

Proceedings of the Handbook of Automata Theory., 2021

2020

A compactness property of the <i>k</i>-abelian monoids.

Juhani Karhumäki, Markus A. Whiteland

Theor. Comput. Sci., 2020

Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata.

Fabian Frei, Juraj Hromkovic, Juhani Karhumäki

Fundam. Informaticae, 2020

2019

On abelian saturated infinite words.

Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela

Theor. Comput. Sci., 2019

The Salomaa Prize 2019 was given to Dr. Artur Jez.

Mikhail V. Volkov, Juhani Karhumäki, Dominique Perrin

Bull. EATCS, 2019

2018

Degrees of Infinite Words, Polynomials and Atoms.

Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela

Int. J. Found. Comput. Sci., 2018

On <i>k</i>-abelian palindromes.

Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina

Inf. Comput., 2018

Perface.

Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich, Mikhail V. Volkov

Fundam. Informaticae, 2018

The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin.

Juhani Karhumäki, Dominique Perrin, Mikhail V. Volkov

Bull. EATCS, 2018

Degrees of Infinite Words, Polynomials, and Atoms (Extended Version).

Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela

CoRR, 2018

On Abelian Subshifts.

Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Regularity of k-Abelian Equivalence Classes of Fixed Cardinality.

Juhani Karhumäki, Markus A. Whiteland

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

On cardinalities of k-abelian equivalence classes.

Juhani Karhumäki, Svetlana Puzynina, Michaël Rao, Markus A. Whiteland

Theor. Comput. Sci., 2017

k-Abelian Equivalence and Rationality.

Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland

Fundam. Informaticae, 2017

On growth and fluctuation of k-abelian complexity.

Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela

Eur. J. Comb., 2017

Variations of the Morse-Hedlund Theorem for <i>k</i>-Abelian Equivalence.

Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni

Acta Cybern., 2017

2016

Descriptional Complexity of Formal Systems.

Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin

Theor. Comput. Sci., 2016

Preface.

Juhani Karhumäki, Vladimir V. Mazalov, Yuri V. Matiyasevich

Fundam. Informaticae, 2016

2015

Words 2013.

Juhani Karhumäki, Luca Q. Zamboni

Theor. Comput. Sci., 2015

Preface.

Juhani Karhumäki, Edward A. Hirsch

Theory Comput. Syst., 2015

Testing k-binomial equivalence.

Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter

CoRR, 2015

2014

Preface.

Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich

Fundam. Informaticae, 2014

From Models to Languages.

Pierpaolo Degano, Juhani Karhumäki, Paolo Massazza

Fundam. Informaticae, 2014

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence.

Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

On k-Abelian Palindromic Rich and Poor Words.

Juhani Karhumäki, Svetlana Puzynina

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages.

Juhani Karhumäki, Alexander Okhotin

Proceedings of the Computing with New Resources, 2014

2013

On a generalization of Abelian equivalence and complexity of infinite words.

Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni

J. Comb. Theory A, 2013

Fine and Wilf's Theorem for k-Abelian Periods.

Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela

Int. J. Found. Comput. Sci., 2013

2012

Problems in between words and abelian words: k-abelian avoidability.

Mari Huova, Juhani Karhumäki, Aleksi Saarela

Theor. Comput. Sci., 2012

Preface.

Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa

Theor. Comput. Sci., 2012

On abelian versions of critical factorization theorem.

Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina

RAIRO Theor. Informatics Appl., 2012

Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju.

Vesa Halava, Juhani Karhumäki, Dirk Nowotka, Grzegorz Rozenberg

Fundam. Informaticae, 2012

Equations in the Partial Semigroup of Words with Overlapping Products.

Mari Huova, Juhani Karhumäki

Proceedings of the Languages Alive, 2012

2011

Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.

Christian Choffrut, Juhani Karhumäki

Theory Comput. Syst., 2011

Locally catenative sequences and Turtle graphics.

Juhani Karhumäki, Svetlana Puzynina

RAIRO Theor. Informatics Appl., 2011

Preface.

Juhani Karhumäki, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa

Fundam. Informaticae, 2011

The Unique Decipherability in the Monoid of Regular Languages is Undecidable.

Juhani Karhumäki, Aleksi Saarela

Fundam. Informaticae, 2011

Weighted Finite Automata: Computing with Different Topologies.

Juhani Karhumäki, Turo Sallinen

Proceedings of the Unconventional Computation - 10th International Conference, 2011

Local Squares, Periodicity and Finite Automata.

Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari

Proceedings of the Rainbow of Computer Science, 2011

2010

On stateless multihead automata: Hierarchies and the emptiness problem.

Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin

Theor. Comput. Sci., 2010

Computational power of two stacks with restricted communication.

Juhani Karhumäki, Michal Kunc, Alexander Okhotin

Inf. Comput., 2010

Noneffective Regularity of Equality Languages and Bounded Delay Morphisms.

Juhani Karhumäki, Aleksi Saarela

Discret. Math. Theor. Comput. Sci., 2010

Tiling Periodicity.

Juhani Karhumäki, Yury Lifshits, Wojciech Rytter

Discret. Math. Theor. Comput. Sci., 2010

2009

Conjugacy of finite biprefix codes.

Julien Cassaigne, Juhani Karhumäki, Petri Salmela

Theor. Comput. Sci., 2009

On the Power of Cooperating Morphisms via Reachability Problems.

Juhani Karhumäki

Int. J. Found. Comput. Sci., 2009

2008

Binary operations on automatic functions.

Juhani Karhumäki, Jarkko Kari, Joachim Kupke

RAIRO Theor. Informatics Appl., 2008

Preface.

Jean Berstel, Tero Harju, Juhani Karhumäki

RAIRO Theor. Informatics Appl., 2008

Post Correspondence Problem for short words.

Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki

Inf. Process. Lett., 2008

Preface.

Tero Harju, Juhani Karhumäki

Int. J. Found. Comput. Sci., 2008

Matrix Equations and Hilbert's Tenth Problem.

Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov

Int. J. Algebra Comput., 2008

Reachability via Cooperating Morphisms.

Juhani Karhumäki

Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

An Analysis and a Reproof of Hmelevskii's Theorem.

Juhani Karhumäki, Aleksi Saarela

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

Extension of the decidability of the marked PCP to instances with unique blocks.

Vesa Halava, Tero Harju, Juhani Karhumäki, Michel Latteux

Theor. Comput. Sci., 2007

The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems.

Vesa Halava, Tero Harju, Juhani Karhumäki

Theory Comput. Syst., 2007

On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns.

Elena Czeizler, Juhani Karhumäki

Int. J. Found. Comput. Sci., 2007

Intricacies of Simple Word Equations: an Example.

Elena Czeizler, Stepan Holub, Juhani Karhumäki, Markku Laine

Int. J. Found. Comput. Sci., 2007

2006

Computing by commuting.

Juhani Karhumäki, Michal Kunc, Alexander Okhotin

Theor. Comput. Sci., 2006

Preface.

Alberto Bertoni, Zoltán Ésik, Juhani Karhumäki

Theor. Comput. Sci., 2006

Undecidability in omega-Regular Languages.

Vesa Halava, Tero Harju, Juhani Karhumäki

Fundam. Informaticae, 2006

Communication of Two Stacks and Rewriting.

Juhani Karhumäki, Michal Kunc, Alexander Okhotin

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Preface: Insightful Theory.

Juhani Karhumäki, Grzegorz Rozenberg

Theor. Comput. Sci., 2005

On the complexity of decidable cases of the commutation problem of languages.

Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter

Theor. Comput. Sci., 2005

Commutation with codes.

Juhani Karhumäki, Michel Latteux, Ion Petre

Theor. Comput. Sci., 2005

Preface.

Tero Harju, Juhani Karhumäki, Antonio Restivo

Theor. Comput. Sci., 2005

Preface.

Josep Díaz, Juhani Karhumäki

Theor. Comput. Sci., 2005

Commutation with Ternary Sets of Words.

Juhani Karhumäki, Michel Latteux, Ion Petre

Theory Comput. Syst., 2005

Some decision problems on integer matrices.

Christian Choffrut, Juhani Karhumäki

RAIRO Theor. Informatics Appl., 2005

2004

Many aspects of defect theorems.

Tero Harju, Juhani Karhumäki

Theor. Comput. Sci., 2004

Polynomial versus exponential growth in repetition-free binary words.

Juhani Karhumäki, Jeffrey O. Shallit

J. Comb. Theory A, 2004

Finite Sets of Words and Computing.

Juhani Karhumäki

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Fixed Point Approach to Commutation of Languages.

Karel Culík II, Juhani Karhumäki, Petri Salmela

Proceedings of the Aspects of Molecular Computing, 2004

2003

A defect theorem for bi-infinite words.

Juhani Karhumäki, Ján Manuch, Wojciech Plandowski

Theor. Comput. Sci., 2003

The Equivalence Problem of Finite Substitutions on ab*c, with Applications.

Juhani Karhumäki, Leonid P. Lisovik

Int. J. Found. Comput. Sci., 2003

A simple undecidable problem: the inclusion problem for finite substitutions on ab*c.

Juhani Karhumäki, Leonid P. Lisovik

Inf. Comput., 2003

Combinatorics on words: a tutorial.

Jean Berstel, Juhani Karhumäki

Bull. EATCS, 2003

The complexity of compressing subsegments of images described by finite automata.

Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter

Discret. Appl. Math., 2003

Decidability of the binary infinite Post Correspondence Problem.

Vesa Halava, Tero Harju, Juhani Karhumäki

Discret. Appl. Math., 2003

Automata on Words.

Juhani Karhumäki

Proceedings of the Implementation and Application of Automata, 2003

The Commutation with Codes and Ternary Sets of Words.

Juhani Karhumäki, Michel Latteux, Ion Petre

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

Conway's problem for three-word sets.

Juhani Karhumäki, Ion Petre

Theor. Comput. Sci., 2002

Multiple factorizations of words and defect effect.

Juhani Karhumäki, Ján Manuch

Theor. Comput. Sci., 2002

The commutation of finite sets: a challenging problem.

Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger

Theor. Comput. Sci., 2002

Locally Periodic Versus Globally Periodic Infinite Words.

Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski

J. Comb. Theory A, 2002

Some Decision Problems Concerning Semilinearity and Commutation.

Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa

J. Comput. Syst. Sci., 2002

A Note on Synchronized Automata and Road Coloring Problem.

Karel Culík II, Juhani Karhumäki, Jarkko Kari

Int. J. Found. Comput. Sci., 2002

Communication Complexity Method for Measuring Nondeterminism in Finite Automata.

Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger

Inf. Comput., 2002

Applications of Finite Automata.

Juhani Karhumäki

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Computing Partial Information out of Intractable One - The First Digit of 2ⁿ at Base 3 as an Example.

Mika Hirvensalo, Juhani Karhumäki

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

The Equivalence Problem of Finite Substitutions on ab^*c, with Applications.

Juhani Karhumäki, Leonid P. Lisovik

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

The Branching Point Approach to Conway's Problem.

Juhani Karhumäki, Ion Petre

Proceedings of the Formal and Natural Computing, 2002

2001

On Conjugacy of Languages.

Julien Cassaigne, Juhani Karhumäki, Ján Manuch

RAIRO Theor. Informatics Appl., 2001

Conway's Problem and the Communication of Languages.

Juhani Karhumäki, Ion Petre

Bull. EATCS, 2001

A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab^*c.

Juhani Karhumäki, Leonid P. Lisovik

Proceedings of the STACS 2001, 2001

Combinatorial and Computational Problems on Finite Sets of Words.

Juhani Karhumäki

Proceedings of the Machines, 2001

Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.

Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Challenges of Commutation.

Juhani Karhumäki

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

On Fatou properties of rational languages.

Christian Choffrut, Juhani Karhumäki

Proceedings of the Where Mathematics, 2001

2000

Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata.

Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter

Nord. J. Comput., 2000

The expressibility of languages and relations by word equations.

Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski

J. ACM, 2000

Measures of Nondeterminism in Finite Automata

Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert

Electron. Colloquium Comput. Complex., 2000

On the Centralizer of a Finite Set.

Juhani Karhumäki, Ion Petre

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Generalized Factorizations of Words and Their Algorithmic Properties.

Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter

Theor. Comput. Sci., 1999

A Short Biography of Arto Salomaa.

Juhani Karhumäki

Theor. Comput. Sci., 1999

On the Undecidability of Freeness of Matrix Semigroups.

Julien Cassaigne, Tero Harju, Juhani Karhumäki

Int. J. Algebra Comput., 1999

Defect Theorems for Trees.

Juhani Karhumäki, Sabrina Mantaci

Fundam. Informaticae, 1999

On the complexity of computing the order of repetition of a string.

Juhani Karhumäki, Wojciech Plandowski

Proceedings of the Developments in Language Theory, 1999

The Compression of Subsegments of Images Described by Finite Automata.

Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

On the Equivalence of Finite Substitutions and Transducers.

Juhani Karhumäki, Leonid P. Lisovik

Proceedings of the Jewels are Forever, 1999

1998

Examples of Undecidable Problems for 2-Generator Matrix Semigroups.

Julien Cassaigne, Juhani Karhumäki

Theor. Comput. Sci., 1998

On Defect Effect of Bi-Infinite Words.

Juhani Karhumäki, Ján Manuch, Wojciech Plandowski

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Locally Periodic Infinite Words and a Chaotic Behaviour.

Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Morphisms.

Tero Harju, Juhani Karhumäki

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

Combinatorics of Words.

Christian Choffrut, Juhani Karhumäki

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

A Note on Decidability Questions on Presentations of Word Semigroups.

Christian Choffrut, Tero Harju, Juhani Karhumäki

Theor. Comput. Sci., 1997

Compactness of Systems of Equations in Semigroups.

Tero Harju, Juhani Karhumäki, Wojciech Plandowski

Int. J. Algebra Comput., 1997

Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms.

Julien Cassaigne, Juhani Karhumäki

Eur. J. Comb., 1997

Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.

Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

A lower bound for a constant in Shallit's conjecture.

Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Two Lower Bounds on Computational Complexity of Infinite Words.

Juraj Hromkovic, Juhani Karhumäki

Proceedings of the New Trends in Formal Languages, 1997

Compactness of Systems of Equations on Completely Regular Semigroups.

Tero Harju, Juhani Karhumäki, Mario Petrich

Proceedings of the Structures in Logic and Computer Science, 1997

1996

On the Size of Independent Systems of Equations in Semigroups.

Juhani Karhumäki, Wojciech Plandowski

Theor. Comput. Sci., 1996

On Computational Power of Weighted Finite Automata.

Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte

Fundam. Informaticae, 1996

Remarks on Generalized Post Correspondence Problem.

Tero Harju, Juhani Karhumäki, Daniel Krob

Proceedings of the STACS 96, 1996

1995

Polynomial Size Test Sets for Context-Free Languages.

Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter

J. Comput. Syst. Sci., 1995

Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract).

Julien Cassaigne, Juhani Karhumäki

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Finite Automata Computing Real Functions.

Karel Culík II, Juhani Karhumäki

SIAM J. Comput., 1994

On Continuous Functions Computed by Finite Automata.

Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte

RAIRO Theor. Informatics Appl., 1994

Iterative Devices Generating Infinite Words.

Karel Culík II, Juhani Karhumäki

Int. J. Found. Comput. Sci., 1994

Two Lower Bounds on Computational Complexity of Infinite Word Generation.

Juraj Hromkovic, Juhani Karhumäki

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Comparing Descriptional and Computational Complexity of Infinite Words.

Juraj Hromkovic, Juhani Karhumäki, Arto Lepistö

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

On the Defect Effect of Many Identities in Free Semigroups.

Juhani Karhumäki, Wojciech Plandowski

Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1993

The Impact of the DOL Problem.

Juhani Karhumäki

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Efficient constructions of test sets for regular and context-free languages.

Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek

Theor. Comput. Sci., 1993

Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory.

Juhani Karhumäki

Theor. Comput. Sci., 1993

1992

Multiplicities: A Deterministsic View of Nondeterminism.

Juhani Karhumäki

Theor. Comput. Sci., 1992

1991

The Equivalence Problem of Multitape Finite Automata.

Tero Harju, Juhani Karhumäki

Theor. Comput. Sci., 1991

On the power of synchronization in parallel computations.

Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová

Discret. Appl. Math., 1991

1990

Loops in automata and HDTOL relations.

Karel Culík II, Juhani Karhumäki

RAIRO Theor. Informatics Appl., 1990

Decidability of the Multiplicity Equivalence of Multitape Finite Automata

Tero Harju, Juhani Karhumäki

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Systems of Equations over a Finite Set of Words and Automata Theory.

Juhani Karhumäki

Proceedings of the Word Equations and Related Topics, First International Workshop, 1990

1989

A note on HDTOL Languages and the Equivalence of Deterministic Pushdown Transducers.

Karel Culík II, Juhani Karhumäki

Proceedings of the A Perspective in Theoretical Computer Science, 1989

HDTOL Matching of Computations of Multitape Automata.

Karel Culík II, Juhani Karhumäki

Acta Informatica, 1989

On the Equivalence Problem for Deterministic Multitape Automata and Transducers.

Karel Culík II, Juhani Karhumäki

Proceedings of the STACS 89, 1989

On the Power of Synchronization in Parallel Computations.

Jürgen Dassow, Juraj Hromkovic, Juhani Karhumäki, Branislav Rovan, Anna Slobodová

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

On Totalistic Systolic Networks.

Karel Culík II, Juhani Karhumäki

Inf. Process. Lett., 1988

The Formal Language Theory Column.

Arto Salomaa, Juhani Karhumäki

Bull. EATCS, 1988

1987

The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable.

Karel Culík II, Juhani Karhumäki

SIAM J. Comput., 1987

The Ehrenfeucht Conjecture for Transducers.

Juhani Karhumäki

J. Inf. Process. Cybern., 1987

Results Concerning Palindromicity.

Sándor Horváth, Juhani Karhumäki, Jetty Kleijn

J. Inf. Process. Cybern., 1987

On Recent Trends in Formal Language Theory.

Juhani Karhumäki

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable.

Karel Culík II, Juhani Karhumäki

Theor. Comput. Sci., 1986

A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language.

Juhani Karhumäki, Yael Maon

J. Comput. Syst. Sci., 1986

A Note on the Equivalence Problem of Rational Formal Power Series.

Karel Culík II, Juhani Karhumäki

Inf. Process. Lett., 1986

On morphic generation of regular languages.

Tero Harju, Juhani Karhumäki, H. C. M. Kleijn

Discret. Appl. Math., 1986

Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence.

Karel Culík II, Juhani Karhumäki

Acta Informatica, 1986

The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable.

Karel Culík II, Juhani Karhumäki

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

The equivalence of mappings on languages.

Juhani Karhumäki

Proceedings of the Trends, 1986

1985

A Property of Three-Element Codes.

Juhani Karhumäki

Theor. Comput. Sci., 1985

On Three-Element Codes.

Juhani Karhumäki

Theor. Comput. Sci., 1985

On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages.

Juhani Karhumäki, H. C. M. Kleijn

RAIRO Theor. Informatics Appl., 1985

Decision problems solved with the help of the Ehrenfeucht conjecture.

Karel Culík II, Juhani Karhumäki

Bull. EATCS, 1985

Test sets for morphisms with bounded delay.

Christian Choffrut, Juhani Karhumäki

Discret. Appl. Math., 1985

1984

The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids.

Juhani Karhumäki

Theor. Comput. Sci., 1984

Inverse Morphic Equivalence on Languages.

Juhani Karhumäki, Derick Wood

Inf. Process. Lett., 1984

1983

On the Ehrenfeucht Conjecture for DOL Languages.

Karel Culík II, Juhani Karhumäki

RAIRO Theor. Informatics Appl., 1983

Systems of equations over a free monoid and Ehrenfeucht's conjecture.

Karel Culík II, Juhani Karhumäki

Discret. Math., 1983

A note on morphic characterization of languages.

Juhani Karhumäki, Matti Linna

Discret. Appl. Math., 1983

On cube-free ω-words generated by binary morphisms.

Juhani Karhumäki

Discret. Appl. Math., 1983

A Note on Intersections of Free Submonoids of a Free Monoid.

Juhani Karhumäki

Proceedings of the Automata, 1983

1982

Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid

Jürgen Albert, Karel Culík II, Juhani Karhumäki

Inf. Control., February, 1982

The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable.

Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg

Theor. Comput. Sci., 1982

1981

On the Equivalence Problem for Binary DOL Systems

Juhani Karhumäki

Inf. Control., September, 1981

On Strongly Cube-Free Omega-Words Generated by Binary Morphisms.

Juhani Karhumäki

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Generalized Parikh Mappings and Homomorphisms

Juhani Karhumäki

Inf. Control., December, 1980

On the Equality Sets for Homomorphisms on Free Monoids with Two Generators.

Karel Culík II, Juhani Karhumäki

RAIRO Theor. Informatics Appl., 1980

1979

Interactive L Systems with Almost Interactionless Behaviour

Karel Culík II, Juhani Karhumäki

Inf. Control., October, 1979

On Commutative DT0L Systems.

Juhani Karhumäki

Theor. Comput. Sci., 1979

1978

A note on DOL length sets.

Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg

Discret. Math., 1978

1977

Remarks on Commutative <i>N</i> -Rational Series.

Juhani Karhumäki

Theor. Comput. Sci., 1977

The Decidability of the Equivalence Problem for Polynomially Bounded DOL Sequences.

Juhani Karhumäki

RAIRO Theor. Informatics Appl., 1977

1976

Two Theorems Concerning Recognizable N-Subsets of sigma*.

Juhani Karhumäki

Theor. Comput. Sci., 1976

1975

On Length Sets of Informationless L Systems.

Juhani Karhumäki

Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974

Some Growth Functions of Context-Dependent L-Systems.

Juhani Karhumäki

Proceedings of the L Systems, 1974

1973

An Example of a PD2L-System with the Growth Type 2½.

Juhani Karhumäki

Inf. Process. Lett., 1973