Juhani Karhumäki

According to our database1, Juhani Karhumäki
  • authored at least 194 papers between 1973 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
On cardinalities of k-abelian equivalence classes.
Theor. Comput. Sci., 2017

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence.
Acta Cybern., 2017

2016
Descriptional Complexity of Formal Systems.
Theor. Comput. Sci., 2016

Preface.
Fundam. Inform., 2016

On cardinalities of k-abelian equivalence classes.
CoRR, 2016

Degrees of Infinite Words, Polynomials and Atoms.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

k-Abelian Equivalence and Rationality.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
Words 2013.
Theor. Comput. Sci., 2015

Preface.
Theory Comput. Syst., 2015

Testing k-binomial equivalence.
CoRR, 2015

On Growth and Fluctuation of k-Abelian Complexity.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
Preface.
Fundam. Inform., 2014

From Models to Languages.
Fundam. Inform., 2014

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

On k-Abelian Palindromic Rich and Poor Words.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages.
Proceedings of the Computing with New Resources, 2014

2013
On a generalization of Abelian equivalence and complexity of infinite words.
J. Comb. Theory, Ser. A, 2013

Fine and Wilf's Theorem for k-Abelian Periods.
Int. J. Found. Comput. Sci., 2013

On a generalization of Abelian equivalence and complexity of infinite words
CoRR, 2013

2012
Problems in between words and abelian words: k-abelian avoidability.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

On abelian versions of critical factorization theorem.
RAIRO - Theor. Inf. and Applic., 2012

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

Fine and Wilf's Theorem for k-Abelian Periods.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Equations in the Partial Semigroup of Words with Overlapping Products.
Proceedings of the Languages Alive, 2012

2011
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.
Theory Comput. Syst., 2011

Locally catenative sequences and Turtle graphics.
RAIRO - Theor. Inf. and Applic., 2011

Preface.
Fundam. Inform., 2011

The Unique Decipherability in the Monoid of Regular Languages is Undecidable.
Fundam. Inform., 2011

Weighted Finite Automata: Computing with Different Topologies.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

Local Squares, Periodicity and Finite Automata.
Proceedings of the Rainbow of Computer Science, 2011

2010
On stateless multihead automata: Hierarchies and the emptiness problem.
Theor. Comput. Sci., 2010

Computational power of two stacks with restricted communication.
Inf. Comput., 2010

Noneffective Regularity of Equality Languages and Bounded Delay Morphisms.
Discrete Mathematics & Theoretical Computer Science, 2010

Tiling Periodicity.
Discrete Mathematics & Theoretical Computer Science, 2010

2009
Conjugacy of finite biprefix codes.
Theor. Comput. Sci., 2009

On the Power of Cooperating Morphisms via Reachability Problems.
Int. J. Found. Comput. Sci., 2009

Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.
Proceedings of the Computer Science, 2009

2008
Binary operations on automatic functions.
ITA, 2008

Preface.
ITA, 2008

Post Correspondence Problem for short words.
Inf. Process. Lett., 2008

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

Matrix Equations and Hilbert's Tenth Problem.
IJAC, 2008

Reachability via Cooperating Morphisms.
Electr. Notes Theor. Comput. Sci., 2008

On Stateless Multihead Automata: Hierarchies and the Emptiness Problem.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

An Analysis and a Reproof of Hmelevskii's Theorem.
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.
Theor. Comput. Sci., 2007

The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems.
Theory Comput. Syst., 2007

On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns.
Int. J. Found. Comput. Sci., 2007

Intricacies of Simple Word Equations: an Example.
Int. J. Found. Comput. Sci., 2007

Tiling Periodicity.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Computing by commuting.
Theor. Comput. Sci., 2006

Preface.
Theor. Comput. Sci., 2006

Undecidability in omega-Regular Languages.
Fundam. Inform., 2006

Communication of Two Stacks and Rewriting.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Preface: Insightful Theory.
Theor. Comput. Sci., 2005

On the complexity of decidable cases of the commutation problem of languages.
Theor. Comput. Sci., 2005

Commutation with codes.
Theor. Comput. Sci., 2005

Preface.
Theor. Comput. Sci., 2005

Preface.
Theor. Comput. Sci., 2005

Commutation with Ternary Sets of Words.
Theory Comput. Syst., 2005

Some decision problems on integer matrices.
ITA, 2005

2004
Many aspects of defect theorems.
Theor. Comput. Sci., 2004

Polynomial versus exponential growth in repetition-free binary words.
J. Comb. Theory, Ser. A, 2004

Finite Sets of Words and Computing.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Fixed Point Approach to Commutation of Languages.
Proceedings of the Aspects of Molecular Computing, 2004

2003
A defect theorem for bi-infinite words.
Theor. Comput. Sci., 2003

The Equivalence Problem of Finite Substitutions on ab*c, with Applications.
Int. J. Found. Comput. Sci., 2003

A simple undecidable problem: the inclusion problem for finite substitutions on ab*c.
Inf. Comput., 2003

Combinatorics on words: a tutorial.
Bulletin of the EATCS, 2003

The complexity of compressing subsegments of images described by finite automata.
Discrete Applied Mathematics, 2003

Decidability of the binary infinite Post Correspondence Problem.
Discrete Applied Mathematics, 2003

Polynomial versus Exponential Growth in Repetition-Free Binary Words
CoRR, 2003

Automata on Words.
Proceedings of the Implementation and Application of Automata, 2003

The Commutation with Codes and Ternary Sets of Words.
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.
Theor. Comput. Sci., 2002

Multiple factorizations of words and defect effect.
Theor. Comput. Sci., 2002

The commutation of finite sets: a challenging problem.
Theor. Comput. Sci., 2002

Locally Periodic Versus Globally Periodic Infinite Words.
J. Comb. Theory, Ser. A, 2002

Some Decision Problems Concerning Semilinearity and Commutation.
J. Comput. Syst. Sci., 2002

A Note on Synchronized Automata and Road Coloring Problem.
Int. J. Found. Comput. Sci., 2002

Communication Complexity Method for Measuring Nondeterminism in Finite Automata.
Inf. Comput., 2002

Applications of Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

The Equivalence Problem of Finite Substitutions on ab*c, with Applications.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

The Branching Point Approach to Conway's Problem.
Proceedings of the Formal and Natural Computing, 2002

2001
On Conjugacy of Languages.
ITA, 2001

Conway's Problem and the Communication of Languages.
Bulletin of the EATCS, 2001

A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c.
Proceedings of the STACS 2001, 2001

Combinatorial and Computational Problems on Finite Sets of Words.
Proceedings of the Machines, 2001

Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On the Complexity of Decidable Cases of Commutation Problem for Languages.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

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

A Note on Synchronized Automata and Road Coloring Problem.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

On Fatou properties of rational languages.
Proceedings of the Where Mathematics, 2001

2000
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata.
Nord. J. Comput., 2000

The expressibility of languages and relations by word equations.
J. ACM, 2000

Measures of Nondeterminism in Finite Automata
Electronic Colloquium on Computational Complexity (ECCC), 2000

On the Centralizer of a Finite Set.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Measures of Nondeterminism in Finite Automata.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Generalized Factorizations of Words and Their Algorithmic Properties.
Theor. Comput. Sci., 1999

A Short Biography of Arto Salomaa.
Theor. Comput. Sci., 1999

On the Undecidability of Freeness of Matrix Semigroups.
IJAC, 1999

Defect Theorems for Trees.
Fundam. Inform., 1999

On the complexity of computing the order of repetition of a string.
Proceedings of the Developments in Language Theory, 1999

Defect theorems for trees.
Proceedings of the Developments in Language Theory, 1999

The Compression of Subsegments of Images Described by Finite Automata.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

On the Equivalence of Finite Substitutions and Transducers.
Proceedings of the Jewels are Forever, 1999

1998
Examples of Undecidable Problems for 2-Generator Matrix Semigroups.
Theor. Comput. Sci., 1998

On Defect Effect of Bi-Infinite Words.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Locally Periodic Infinite Words and a Chaotic Behaviour.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
A Note on Decidability Questions on Presentations of Word Semigroups.
Theor. Comput. Sci., 1997

Compactness of Systems of Equations in Semigroups.
IJAC, 1997

Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms.
Eur. J. Comb., 1997

The Expressibility of Languages and Relations by Word Equations.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

A lower bound for a constant in Shallit's conjecture.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Two Lower Bounds on Computational Complexity of Infinite Words.
Proceedings of the New Trends in Formal Languages, 1997

Compactness of Systems of Equations on Completely Regular Semigroups.
Proceedings of the Structures in Logic and Computer Science, 1997

1996
On the Size of Independent Systems of Equations in Semigroups.
Theor. Comput. Sci., 1996

On Computational Power of Weighted Finite Automata.
Fundam. Inform., 1996

Remarks on Generalized Post Correspondence Problem.
Proceedings of the STACS 96, 1996

1995
Polynomial Size Test Sets for Context-Free Languages.
J. Comput. Syst. Sci., 1995

Compactness of Systems of Equations in Semigroups.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Finite Automata Computing Real Functions.
SIAM J. Comput., 1994

On Continuous Functions Computed by Finite Automata.
ITA, 1994

Iterative Devices Generating Infinite Words.
Int. J. Found. Comput. Sci., 1994

On the Size of Independent Systems of Equations in Semigroups.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Two Lower Bounds on Computational Complexity of Infinite Word Generation.
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.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
The Impact of the DOL Problem.
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Efficient constructions of test sets for regular and context-free languages.
Theor. Comput. Sci., 1993

Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory.
Theor. Comput. Sci., 1993

1992
Multiplicities: A Deterministsic View of Nondeterminism.
Theor. Comput. Sci., 1992

Iterative Devices Generating Infinite Words.
Proceedings of the STACS 92, 1992

On Computational Power of Weighted Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Polynomial Size Test Sets for Context-Free Languages.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991
The Equivalence Problem of Multitape Finite Automata.
Theor. Comput. Sci., 1991

On the power of synchronization in parallel computations.
Discrete Applied Mathematics, 1991

Efficient Constructions of Test Sets for Regular and Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990
Loops in automata and HDTOL relations.
ITA, 1990

Decidability of the Multiplicity Equivalence of Multitape Finite Automata
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Systems of Equations over a Finite Set of Words and Automata Theory.
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.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

HDTOL Matching of Computations of Multitape Automata.
Acta Inf., 1989

On the Equivalence Problem for Deterministic Multitape Automata and Transducers.
Proceedings of the STACS 89, 1989

On the Power of Synchronization in Parallel Computations.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988
On Totalistic Systolic Networks.
Inf. Process. Lett., 1988

The Formal Language Theory Column.
Bulletin of the EATCS, 1988

1987
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable.
SIAM J. Comput., 1987

The Ehrenfeucht Conjecture for Transducers.
Elektronische Informationsverarbeitung und Kybernetik, 1987

Results Concerning Palindromicity.
Elektronische Informationsverarbeitung und Kybernetik, 1987

On Recent Trends in Formal Language Theory.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable.
Theor. Comput. Sci., 1986

A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language.
J. Comput. Syst. Sci., 1986

A Note on the Equivalence Problem of Rational Formal Power Series.
Inf. Process. Lett., 1986

On morphic generation of regular languages.
Discrete Applied Mathematics, 1986

Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence.
Acta Inf., 1986

The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

The equivalence of mappings on languages.
Proceedings of the Trends, 1986

1985
A Property of Three-Element Codes.
Theor. Comput. Sci., 1985

On Three-Element Codes.
Theor. Comput. Sci., 1985

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

Decision problems solved with the help of the Ehrenfeucht conjecture.
Bulletin of the EATCS, 1985

Test sets for morphisms with bounded delay.
Discrete Applied Mathematics, 1985

1984
The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids.
Theor. Comput. Sci., 1984

Inverse Morphic Equivalence on Languages.
Inf. Process. Lett., 1984

A Property of Three-Element Codes.
Proceedings of the STACS 84, 1984

On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

On Three-Element Codes.
Proceedings of the Automata, 1984

1983
On the Ehrenfeucht Conjecture for DOL Languages.
ITA, 1983

Systems of equations over a free monoid and Ehrenfeucht's conjecture.
Discrete Mathematics, 1983

A note on morphic characterization of languages.
Discrete Applied Mathematics, 1983

On cube-free ω-words generated by binary morphisms.
Discrete Applied Mathematics, 1983

A Note on Intersections of Free Submonoids of a Free Monoid.
Proceedings of the Automata, 1983

Test Sets for Morphisms with Bounded Delay.
Proceedings of the Automata, 1983

1982
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid
Information and Control, February, 1982

The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable.
Theor. Comput. Sci., 1982

On the Equivalence Problem for Binary DOL Systems.
Proceedings of the Automata, 1982

1981
On the Equivalence Problem for Binary DOL Systems
Information and Control, September, 1981

Generalized Parikh Mappings and Homomorphisms.
Proceedings of the Automata, 1981

On Strongly Cube-Free Omega-Words Generated by Binary Morphisms.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
Generalized Parikh Mappings and Homomorphisms
Information and Control, December, 1980

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

1979
Interactive L Systems with Almost Interactionless Behaviour
Information and Control, October, 1979

On Commutative DT0L Systems.
Theor. Comput. Sci., 1979

Interactive L Systems with Almost Interactionless Behaviour.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978
A note on DOL length sets.
Discrete Mathematics, 1978

1977
Remarks on Commutative N -Rational Series.
Theor. Comput. Sci., 1977

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

1976
Two Theorems Concerning Recognizable N-Subsets of sigma*.
Theor. Comput. Sci., 1976

1974
Some Growth Functions of Context-Dependent L-Systems.
Proceedings of the L Systems, 1974

1973
An Example of a PD2L-System with the Growth Type 2½.
Inf. Process. Lett., 1973


  Loading...