Juha Honkala

According to our database, Juha Honkala authored at least 109 papers between 1982 and 2023.

Collaborative distances:

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

2023

Commuting upper triangular binary morphisms.

Juha Honkala

CoRR, 2023

2021

Quasi-universal <i>k</i>-regular sequences.

Juha Honkala

Theor. Comput. Sci., 2021

2019

A characterization of free pairs of upper triangular free monoid morphisms.

Juha Honkala

Inf. Comput., 2019

2018

Equality sets of binary D0L sequences.

Juha Honkala

Theor. Comput. Sci., 2018

A new bound for the D0L language equivalence problem.

Juha Honkala

Acta Informatica, 2018

2017

Discrete Watson-Crick dynamical systems.

Juha Honkala

Theor. Comput. Sci., 2017

Rational series with high image complexity.

Juha Honkala

RAIRO Theor. Informatics Appl., 2017

D0L Sequences and their Equality Sets.

Juha Honkala

Fundam. Informaticae, 2017

2015

Language-theoretic problems in certain matrix monoids.

Juha Honkala

Theor. Comput. Sci., 2015

Products of matrices and recursively enumerable sets.

Juha Honkala

J. Comput. Syst. Sci., 2015

The finiteness problem for monoids of morphisms.

Juha Honkala

RAIRO Theor. Informatics Appl., 2015

2014

Remarks concerning the freeness problem over morphism and matrix semigroups.

Juha Honkala

Theor. Comput. Sci., 2014

A Kraft-McMillan inequality for free semigroups of upper-triangular matrices.

Juha Honkala

Inf. Comput., 2014

The freeness problem over matrix semigroups and bounded languages.

Emilie Charlier, Juha Honkala

Inf. Comput., 2014

Recognizability in Certain Matrix Monoids.

Juha Honkala

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

2013

The sequence equivalence problem for primitive D0L systems.

Juha Honkala

J. Comput. Syst. Sci., 2013

2012

Marked D0L systems and the 2n-conjecture.

Juha Honkala

Theor. Comput. Sci., 2012

Equality Sets of Morphic Word Sequences.

Juha Honkala

Int. J. Found. Comput. Sci., 2012

A Characterization of Regular Languages as Equality Sets of HDT0L Sequences.

Juha Honkala

Fundam. Informaticae, 2012

2011

The cyclicity problem for the images of Q-rational series.

Juha Honkala

RAIRO Theor. Informatics Appl., 2011

The Sequence Equivalence Problem for Marked DT0L Systems.

Juha Honkala

Fundam. Informaticae, 2011

A characterization of rational D0L power series.

Juha Honkala

Acta Informatica, 2011

2010

Ultimately Periodic Languages.

Juha Honkala

J. Autom. Lang. Comb., 2010

2009

On the simplification of infinite morphic words.

Juha Honkala

Theor. Comput. Sci., 2009

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

Juha Honkala

Int. J. Algebra Comput., 2009

The equality problem for infinite words generated by primitive morphisms.

Juha Honkala

Inf. Comput., 2009

2008

Cancellation and periodicity properties of iterated morphisms.

Juha Honkala

Theor. Comput. Sci., 2008

2007

A periodicity property of iterated morphisms.

Juha Honkala

RAIRO Theor. Informatics Appl., 2007

The D0l omega-equivalence Problem.

Juha Honkala

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

2006

The Base Problem for D0l Parikh Sets.

Juha Honkala

Int. J. Found. Comput. Sci., 2006

On the Problem Whether the Image of an N-Rational Series Equals.

Juha Honkala

Fundam. Informaticae, 2006

The Ultimate Equivalence Problem for Uniform HDT0L Systems.

Juha Honkala

Bull. EATCS, 2006

2005

The language equivalence problem for HD0L systems having D0L growths.

Juha Honkala

Theor. Comput. Sci., 2005

An <i>n</i>²-bound for the ultimate equivalence problem of certain D0L systems over an <i>n</i>-letter alphabet.

Juha Honkala

J. Comput. Syst. Sci., 2005

The class of HDT0L sequences is closed with respect to rational functions.

Juha Honkala

Inf. Process. Lett., 2005

The equivalence problem for languages defined by transductions on D0L languages.

Juha Honkala

Int. J. Comput. Math., 2005

2004

On infinite HD0L words having sparse letters.

Juha Honkala

Int. J. Comput. Math., 2004

Bounds for the D0L language equivalence problem.

Juha Honkala

Inf. Comput., 2004

Decidability questions related to abstract numeration systems.

Juha Honkala, Michel Rigo

Discret. Math., 2004

2003

Decidability results for Watson-Crick D0L systems with nonregular triggers.

Juha Honkala

Theor. Comput. Sci., 2003

On images of D0L and DT0L power series.

Juha Honkala

Theor. Comput. Sci., 2003

The Equivalence Problem of Polynomially Bounded D0L Systems - a Bound Depending Only on the Size of the Alphabet.

Juha Honkala

Theory Comput. Syst., 2003

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

Juha Honkala

RAIRO Theor. Informatics Appl., 2003

On the Images of N-Rational Sequences Counting Multiplicities.

Juha Honkala, Keijo Ruohonen

Int. J. Algebra Comput., 2003

The DF0L Language Equivalence Problem.

Juha Honkala

Bull. EATCS, 2003

On D0L systems with finite axiom sets.

Juha Honkala

Acta Cybern., 2003

On DOL Power Series over Various Semirings.

Juha Honkala

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002

On the Simplification of HD0L Power Series.

Juha Honkala

J. Univers. Comput. Sci., 2002

The Equivalence Problem for DF0L Languages and Power Series.

Juha Honkala

J. Comput. Syst. Sci., 2002

The equality problem for Parikh simple algebraic power series.

Juha Honkala

Inf. Process. Lett., 2002

Remarks Concerning the D0L w-Equivalence Problem.

Juha Honkala

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

A new class of algebraic series having a decidable equivalence problem.

Juha Honkala

Fundam. Informaticae, 2002

A Note on Systems of Alternative Word Equations.

Juha Honkala

Bull. EATCS, 2002

On infinite words generated by polynomial D0L systems. Juha Honkala.

Juha Honkala

Discret. Appl. Math., 2002

2001

Watson-Crick D0L systems with regular triggers.

Juha Honkala, Arto Salomaa

Theor. Comput. Sci., 2001

On Parikh slender context-free languages.

Juha Honkala

Theor. Comput. Sci., 2001

A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem.

Juha Honkala

Theory Comput. Syst., 2001

Three Variants of the DT0L Sequence Equivalence Problem.

Juha Honkala

J. Univers. Comput. Sci., 2001

A Note on Uniform HDT0L Systems.

Juha Honkala

Bull. EATCS, 2001

Easy cases of the D0L sequence equivalence problem.

Juha Honkala

Discret. Appl. Math., 2001

On Sparse 0L Languages Over the Binary Alphabet.

Juha Honkala

Proceedings of the Words, Semigroups, and Transductions, 2001

The D0L Problem Revisited.

Juha Honkala

Proceedings of the Current Trends in Theoretical Computer Science, 2001

On Slender Languages.

Juha Honkala

Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000

A short solution for the HDT0L sequence equivalence problem.

Juha Honkala

Theor. Comput. Sci., 2000

On D0L power series.

Juha Honkala

Theor. Comput. Sci., 2000

On Formal Power Series Generated by Lindenmayer Systems.

Juha Honkala

J. Autom. Lang. Comb., 2000

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

Juha Honkala

RAIRO Theor. Informatics Appl., 2000

Results Concerning Thinness of D0l Languages.

Juha Honkala

Int. J. Algebra Comput., 2000

The D0L Problem Revisited.

Juha Honkala

Bull. EATCS, 2000

Zeros of Z-rational Sequences and Thin 0L Languages.

Juha Honkala

Bull. EATCS, 2000

Results concerning EOL and COL power series.

Juha Honkala

Acta Cybern., 2000

On Slender 0L Languages over the Binary Alphabet.

Juha Honkala

Acta Informatica, 2000

1999

On algebraicness of D0L power series.

Juha Honkala

J. Univers. Comput. Sci., 1999

On sequences defined by D0L power series.

Juha Honkala

RAIRO Theor. Informatics Appl., 1999

The Equivalence Problem of D0L and DF0L Power Series.

Juha Honkala

Fundam. Informaticae, 1999

On Chains of Word Equations and Test Sets.

Juha Honkala

Bull. EATCS, 1999

On the Equivalence Problem of Context-free and DT0L Languages.

Juha Honkala

Discret. Appl. Math., 1999

A Power Series Approach to Bounded Languages.

Juha Honkala

Proceedings of the Jewels are Forever, 1999

1998

On Number Systems with Finite Degree of Ambiguity.

Juha Honkala

Inf. Comput., 1998

On Slender Languages.

Juha Honkala

Bull. EATCS, 1998

Decision Problems Concerning Thinness and Slenderness of Formal Languages.

Juha Honkala

Acta Informatica, 1998

1997

On Lindenmayerian Algebraic Power Series.

Juha Honkala, Werner Kuich

Theor. Comput. Sci., 1997

On Lindenmayerian Algebraic Sequences.

Juha Honkala

Theor. Comput. Sci., 1997

On N-algebraic Parikh slender power series.

Juha Honkala

J. Univers. Comput. Sci., 1997

On Lindenmayerian Rational Subsets of Monoids.

Juha Honkala

RAIRO Theor. Informatics Appl., 1997

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

Juha Honkala

Int. J. Algebra Comput., 1997

Decision Problems Concerning a Power Series Generalization of DTOL Systems.

Juha Honkala

Fundam. Informaticae, 1997

A Decision Method for Parikh Slenderness of Context-free Languages.

Juha Honkala

Discret. Appl. Math., 1997

Decision Problems Concerning Algebraic Series with Noncommuting Variables.

Juha Honkala

Proceedings of the Structures in Logic and Computer Science, 1997

1996

On Images of Algebraic Series.

Juha Honkala

J. Univers. Comput. Sci., 1996

On Parikh Slender Languages and Power Series.

Juha Honkala

J. Comput. Syst. Sci., 1996

On a Power Series Generalization of ETOL Languages.

Juha Honkala, Werner Kuich

Fundam. Informaticae, 1996

On the Equivalence Problem of Algebraic Series with Commuting Variables.

Juha Honkala

Bull. EATCS, 1996

1995

On Four Classes of Lindenmayerian Power Series.

Juha Honkala, Werner Kuich

J. Univers. Comput. Sci., 1995

A Decision Method for the Unambiguity of Sets Defined by Number Systems

Juha Honkala

J. Univers. Comput. Sci., 1995

On Morphycally Generated Formal Power Series.

Juha Honkala

RAIRO Theor. Informatics Appl., 1995

1994

On Generalized DT0L Systems and Their Fixed Points.

Juha Honkala

Theor. Comput. Sci., 1994

An Iteratio Property of Lindenmayerioan Power Series.

Juha Honkala

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

1993

On D0L Systems with Immigration.

Juha Honkala

Theor. Comput. Sci., 1993

On Lindenmayerian Series in Complete Semirings.

Juha Honkala

Proceedings of the Developments in Language Theory, 1993

1992

Characterization results about L codes.

Juha Honkala, Arto Salomaa

RAIRO Theor. Informatics Appl., 1992

1991

On Algebraic Generalized Zeta Functions of Formal Power Series.

Juha Honkala

Theor. Comput. Sci., 1991

On generalized zeta functions of formal languages and series.

Juha Honkala

Discret. Appl. Math., 1991

L Morphisms: Bounded Delay and Regularity of Ambiguity.

Juha Honkala, Arto Salomaa

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1989

A Necessary Condition for the Rationality of the Zeta Function of a Regular Language.

Juha Honkala

Theor. Comput. Sci., 1989

1988

A defect property of codes with unbounded delays.

Juha Honkala

Discret. Appl. Math., 1988

1986

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

Juha Honkala

RAIRO Theor. Informatics Appl., 1986

1984

Bases and Ambiguity of Number Systems.

Juha Honkala

Theor. Comput. Sci., 1984

1982

Unique representation in number systems and L codes.

Juha Honkala

Discret. Appl. Math., 1982