J. Honkala

发表

On D0L and HDT0L Sets in Monoids

J. Honkala, 2000 .

It is decidable whether or not a permutation-free morphism is an l code

Juha Honkala, J. Honkala, 1987 .

On n-algebraic power series having polynomial growths

J. Honkala, 2000 .

On Lindenmayerian Series in Complete Semirings

Juha Honkala, J. Honkala, 1993, Developments in Language Theory.

A Note on Uniform HDT0L Systems

Juha Honkala, J. Honkala, 2001, Bull. EATCS.

Sparse and slender subsets of monoids

J. Honkala, 2008 .

On Slender Languages

Juha Honkala, J. Honkala, 2001, Bull. EATCS.

Quasi-universal k-regular sequences

Juha Honkala, J. Honkala, 2021, Theor. Comput. Sci..

A short solution for the HDT0L sequence equivalence problem

Juha Honkala, J. Honkala, 2000, Theor. Comput. Sci..

Commuting upper triangular binary morphisms

J. Honkala, 2023, Fundam. Informaticae.

A characterization of free pairs of upper triangular free monoid morphisms

Juha Honkala, J. Honkala, 2019, Inf. Comput..

A periodicity property of iterated morphisms

Juha Honkala, J. Honkala, 2007, RAIRO Theor. Informatics Appl..

L Morphisms: Bounded Delay and Regularity of Ambiguity

Juha Honkala, Arto Salomaa, A. Salomaa, 1991, ICALP.

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

Juha Honkala, J. Honkala, 1989, Theor. Comput. Sci..

A defect property of codes with unbounded delays

Juha Honkala, J. Honkala, 1988, Discret. Appl. Math..

Characterization results about L codes

Juha Honkala, Arto Salomaa, A. Salomaa, 1992, RAIRO Theor. Informatics Appl..

On Morphycally Generated Formal Power Series

Juha Honkala, J. Honkala, 1995, RAIRO Theor. Informatics Appl..

Cancellation and periodicity properties of iterated morphisms

Juha Honkala, J. Honkala, 2008, Theor. Comput. Sci..

Decidability questions related to abstract numeration systems

Michel Rigo, Juha Honkala, M. Rigo, 2004, Discret. Math..

On Parikh slender context-free languages

Juha Honkala, J. Honkala, 2001, Theor. Comput. Sci..

Decision problems concerning thinness and slenderness of formal languages

Juha Honkala, J. Honkala, 1998, Acta Informatica.

A Decision Method for Parikh Slenderness of Context-free Languages

J. Honkala, 1997, Discret. Appl. Math..

On Parikh Slender Languages and Power Series

Juha Honkala, J. Honkala, 1996, J. Comput. Syst. Sci..

On N-algebraic Parikh slender power series

Juha Honkala, J. Honkala, 1997, J. Univers. Comput. Sci..

A decision method for Parikh slenderness of context-free languages

Juha Honkala, J. Honkala, 1996 .

The equality problem for infinite words generated by primitive morphisms

Juha Honkala, J. Honkala, 2009, Inf. Comput..