Juha Honkala

According to our database1, Juha Honkala authored at least 107 papers between 1982 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 



On csauthors.net:


A characterization of free pairs of upper triangular free monoid morphisms.
Inf. Comput., 2019

Equality sets of binary D0L sequences.
Theor. Comput. Sci., 2018

A new bound for the D0L language equivalence problem.
Acta Inf., 2018

Discrete Watson-Crick dynamical systems.
Theor. Comput. Sci., 2017

Rational series with high image complexity.
RAIRO - Theor. Inf. and Applic., 2017

D0L Sequences and their Equality Sets.
Fundam. Inform., 2017

Language-theoretic problems in certain matrix monoids.
Theor. Comput. Sci., 2015

Products of matrices and recursively enumerable sets.
J. Comput. Syst. Sci., 2015

The finiteness problem for monoids of morphisms.
RAIRO - Theor. Inf. and Applic., 2015

Remarks concerning the freeness problem over morphism and matrix semigroups.
Theor. Comput. Sci., 2014

A Kraft-McMillan inequality for free semigroups of upper-triangular matrices.
Inf. Comput., 2014

The freeness problem over matrix semigroups and bounded languages.
Inf. Comput., 2014

Recognizability in Certain Matrix Monoids.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

The sequence equivalence problem for primitive D0L systems.
J. Comput. Syst. Sci., 2013

Marked D0L systems and the 2n-conjecture.
Theor. Comput. Sci., 2012

Equality Sets of Morphic Word Sequences.
Int. J. Found. Comput. Sci., 2012

A Characterization of Regular Languages as Equality Sets of HDT0L Sequences.
Fundam. Inform., 2012

The cyclicity problem for the images of Q-rational series.
RAIRO - Theor. Inf. and Applic., 2011

The Sequence Equivalence Problem for Marked DT0L Systems.
Fundam. Inform., 2011

A characterization of rational D0L power series.
Acta Inf., 2011

Ultimately Periodic Languages.
Journal of Automata, Languages and Combinatorics, 2010

On the simplification of infinite morphic words.
Theor. Comput. Sci., 2009

Number Systems and the Injectivity Problem for Matrix Representations of Free Monoids.
IJAC, 2009

The equality problem for infinite words generated by primitive morphisms.
Inf. Comput., 2009

Cancellation and periodicity properties of iterated morphisms.
Theor. Comput. Sci., 2008

A periodicity property of iterated morphisms.
ITA, 2007

The D0l omega-equivalence Problem.
Int. J. Found. Comput. Sci., 2007

The Base Problem for D0l Parikh Sets.
Int. J. Found. Comput. Sci., 2006

On the Problem Whether the Image of an N-Rational Series Equals.
Fundam. Inform., 2006

The Ultimate Equivalence Problem for Uniform HDT0L Systems.
Bulletin of the EATCS, 2006

The language equivalence problem for HD0L systems having D0L growths.
Theor. Comput. Sci., 2005

An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet.
J. Comput. Syst. Sci., 2005

The class of HDT0L sequences is closed with respect to rational functions.
Inf. Process. Lett., 2005

The equivalence problem for languages defined by transductions on D0L languages.
Int. J. Comput. Math., 2005

On infinite HD0L words having sparse letters.
Int. J. Comput. Math., 2004

Bounds for the D0L language equivalence problem.
Inf. Comput., 2004

Decidability questions related to abstract numeration systems.
Discrete Mathematics, 2004

Decidability results for Watson-Crick D0L systems with nonregular triggers.
Theor. Comput. Sci., 2003

On images of D0L and DT0L power series.
Theor. Comput. Sci., 2003

The Equivalence Problem of Polynomially Bounded D0L Systems - a Bound Depending Only on the Size of the Alphabet.
Theory Comput. Syst., 2003

A bound for the [omega]-equivalence problem of polynomial D0L systems.
ITA, 2003

On the Images of N-Rational Sequences Counting Multiplicities.
IJAC, 2003

The DF0L Language Equivalence Problem.
Bulletin of the EATCS, 2003

On D0L systems with finite axiom sets.
Acta Cybern., 2003

On DOL Power Series over Various Semirings.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

On the Simplification of HD0L Power Series.
J. UCS, 2002

The Equivalence Problem for DF0L Languages and Power Series.
J. Comput. Syst. Sci., 2002

The equality problem for Parikh simple algebraic power series.
Inf. Process. Lett., 2002

Remarks Concerning the D0L w-Equivalence Problem.
Int. J. Found. Comput. Sci., 2002

A new class of algebraic series having a decidable equivalence problem.
Fundam. Inform., 2002

A Note on Systems of Alternative Word Equations.
Bulletin of the EATCS, 2002

On infinite words generated by polynomial D0L systems. Juha Honkala.
Discrete Applied Mathematics, 2002

Watson-Crick D0L systems with regular triggers.
Theor. Comput. Sci., 2001

On Parikh slender context-free languages.
Theor. Comput. Sci., 2001

A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem.
Theory Comput. Syst., 2001

Three Variants of the DT0L Sequence Equivalence Problem.
J. UCS, 2001

A Note on Uniform HDT0L Systems.
Bulletin of the EATCS, 2001

Easy cases of the D0L sequence equivalence problem.
Discrete Applied Mathematics, 2001

On Sparse 0L Languages Over the Binary Alphabet.
Proceedings of the Words, Semigroups, and Transductions, 2001

The D0L Problem Revisited.
Current Trends in Theoretical Computer Science, 2001

On Slender Languages.
Current Trends in Theoretical Computer Science, 2001

A short solution for the HDT0L sequence equivalence problem.
Theor. Comput. Sci., 2000

On D0L power series.
Theor. Comput. Sci., 2000

On Formal Power Series Generated by Lindenmayer Systems.
Journal of Automata, Languages and Combinatorics, 2000

A Kleene-Schützenberger theorem for Lindenmayerian rational power series.
ITA, 2000

Results Concerning Thinness of D0l Languages.
IJAC, 2000

The D0L Problem Revisited.
Bulletin of the EATCS, 2000

Zeros of Z-rational Sequences and Thin 0L Languages.
Bulletin of the EATCS, 2000

Results concerning EOL and COL power series.
Acta Cybern., 2000

On Slender 0L Languages over the Binary Alphabet.
Acta Inf., 2000

On algebraicness of D0L power series.
J. UCS, 1999

On sequences defined by D0L power series.
ITA, 1999

The Equivalence Problem of D0L and DF0L Power Series.
Fundam. Inform., 1999

On Chains of Word Equations and Test Sets.
Bulletin of the EATCS, 1999

On the Equivalence Problem of Context-free and DT0L Languages.
Discrete Applied Mathematics, 1999

A Power Series Approach to Bounded Languages.
Proceedings of the Jewels are Forever, 1999

On Number Systems with Finite Degree of Ambiguity.
Inf. Comput., 1998

On Slender Languages.
Bulletin of the EATCS, 1998

Decision Problems Concerning Thinness and Slenderness of Formal Languages.
Acta Inf., 1998

On Lindenmayerian Algebraic Power Series.
Theor. Comput. Sci., 1997

On Lindenmayerian Algebraic Sequences.
Theor. Comput. Sci., 1997

On N-algebraic Parikh slender power series.
J. UCS, 1997

On Lindenmayerian Rational Subsets of Monoids.
ITA, 1997

On the Decidability of Some Equivalence Problems for L Algebraic Series.
IJAC, 1997

Decision Problems Concerning a Power Series Generalization of DTOL Systems.
Fundam. Inform., 1997

A Decision Method for Parikh Slenderness of Context-free Languages.
Discrete Applied Mathematics, 1997

Decision Problems Concerning Algebraic Series with Noncommuting Variables.
Proceedings of the Structures in Logic and Computer Science, 1997

On Images of Algebraic Series.
J. UCS, 1996

On Parikh Slender Languages and Power Series.
J. Comput. Syst. Sci., 1996

On a Power Series Generalization of ETOL Languages.
Fundam. Inform., 1996

On the Equivalence Problem of Algebraic Series with Commuting Variables.
Bulletin of the EATCS, 1996

On Four Classes of Lindenmayerian Power Series.
J. UCS, 1995

A Decision Method for the Unambiguity of Sets Defined by Number Systems
J. UCS, 1995

On Morphycally Generated Formal Power Series.
ITA, 1995

On Generalized DT0L Systems and Their Fixed Points.
Theor. Comput. Sci., 1994

An Iteratio Property of Lindenmayerioan Power Series.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

On D0L Systems with Immigration.
Theor. Comput. Sci., 1993

On Lindenmayerian Series in Complete Semirings.
Proceedings of the Developments in Language Theory, 1993

Characterization results about L codes.
ITA, 1992

On Algebraic Generalized Zeta Functions of Formal Power Series.
Theor. Comput. Sci., 1991

On generalized zeta functions of formal languages and series.
Discrete Applied Mathematics, 1991

L Morphisms: Bounded Delay and Regularity of Ambiguity.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

A Necessary Condition for the Rationality of the Zeta Function of a Regular Language.
Theor. Comput. Sci., 1989

A defect property of codes with unbounded delays.
Discrete Applied Mathematics, 1988

A Decision Method for The Recognizability of Sets Defined by Number Systems.
ITA, 1986

Bases and Ambiguity of Number Systems.
Theor. Comput. Sci., 1984

Unique representation in number systems and L codes.
Discrete Applied Mathematics, 1982