Juha Honkala

114 papers A* 1C 1Journal 104Unranked 6
YearRankTypeTitle / Venue / Authors
2024 J jnl
Commuting Upper Triangular Binary Morphisms.
Fundam. Informaticae
Juha Honkala
2024 J jnl
Linear equations and recursively enumerable sets.
CoRR
Juha Honkala
2024 J jnl
Rational power series in several noncommuting variables and the Skolem-Mahler-Lech theorem.
Theor. Comput. Sci.
Juha Honkala
2023 J jnl
Commuting upper triangular binary morphisms.
CoRR
Juha Honkala
2021 J jnl
Quasi-universal
Theor. Comput. Sci.
Juha Honkala
2019 J jnl
A characterization of free pairs of upper triangular free monoid morphisms.
Inf. Comput.
Juha Honkala
2018 J jnl
A new bound for the D0L language equivalence problem.
Acta Informatica
Juha Honkala
2018 J jnl
Equality sets of binary D0L sequences.
Theor. Comput. Sci.
Juha Honkala
2017 J jnl
D0L Sequences and their Equality Sets.
Fundam. Informaticae
Juha Honkala
2017 J jnl
Discrete Watson-Crick dynamical systems.
Theor. Comput. Sci.
Juha Honkala
2017 J jnl
Rational series with high image complexity.
RAIRO Theor. Informatics Appl.
Juha Honkala
2015 J jnl
Language-theoretic problems in certain matrix monoids.
Theor. Comput. Sci.
Juha Honkala
2015 J jnl
Products of matrices and recursively enumerable sets.
J. Comput. Syst. Sci.
Juha Honkala
2015 J jnl
The finiteness problem for monoids of morphisms.
RAIRO Theor. Informatics Appl.
Juha Honkala
2014 J jnl
A Kraft-McMillan inequality for free semigroups of upper-triangular matrices.
Inf. Comput.
Juha Honkala
2014 — conf
Recognizability in Certain Matrix Monoids.
Discrete Mathematics and Computer Science
Juha Honkala
2014 J jnl
Remarks concerning the freeness problem over morphism and matrix semigroups.
Theor. Comput. Sci.
Juha Honkala
2014 J jnl
The freeness problem over matrix semigroups and bounded languages.
Inf. Comput.
Emilie Charlier, Juha Honkala
2013 J jnl
The freeness problem over matrix semigroups and bounded languages
CoRR
Emilie Charlier, Juha Honkala
2013 J jnl
The sequence equivalence problem for primitive D0L systems.
J. Comput. Syst. Sci.
Juha Honkala
2012 J jnl
A Characterization of Regular Languages as Equality Sets of HDT0L Sequences.
Fundam. Informaticae
Juha Honkala
2012 J jnl
Equality Sets of Morphic Word Sequences.
Int. J. Found. Comput. Sci.
Juha Honkala
2012 J jnl
Marked D0L systems and the 2n-conjecture.
Theor. Comput. Sci.
Juha Honkala
2011 J jnl
A characterization of rational D0L power series.
Acta Informatica
Juha Honkala
2011 J jnl
The Sequence Equivalence Problem for Marked DT0L Systems.
Fundam. Informaticae
Juha Honkala
2011 J jnl
The cyclicity problem for the images of Q-rational series.
RAIRO Theor. Informatics Appl.
Juha Honkala
2010 J jnl
Ultimately Periodic Languages.
J. Autom. Lang. Comb.
Juha Honkala
2009 J jnl
Number Systems and the Injectivity Problem for Matrix Representations of Free Monoids.
Int. J. Algebra Comput.
Juha Honkala
2009 J jnl
On the simplification of infinite morphic words.
Theor. Comput. Sci.
Juha Honkala
2009 J jnl
The equality problem for infinite words generated by primitive morphisms
CoRR
Juha Honkala
2009 J jnl
The equality problem for infinite words generated by primitive morphisms.
Inf. Comput.
Juha Honkala
2008 J jnl
Cancellation and periodicity properties of iterated morphisms.
Theor. Comput. Sci.
Juha Honkala
2007 J jnl
A periodicity property of iterated morphisms.
RAIRO Theor. Informatics Appl.
Juha Honkala
2007 J jnl
The D0l omega-equivalence Problem.
Int. J. Found. Comput. Sci.
Juha Honkala
2006 J jnl
On the Problem Whether the Image of an N-Rational Series Equals.
Fundam. Informaticae
Juha Honkala
2006 J jnl
The Base Problem for D0l Parikh Sets.
Int. J. Found. Comput. Sci.
Juha Honkala
2006 J jnl
The Ultimate Equivalence Problem for Uniform HDT0L Systems.
Bull. EATCS
Juha Honkala
2005 J jnl
An
J. Comput. Syst. Sci.
Juha Honkala
2005 J jnl
The class of HDT0L sequences is closed with respect to rational functions.
Inf. Process. Lett.
Juha Honkala
2005 J jnl
The equivalence problem for languages defined by transductions on D0L languages.
Int. J. Comput. Math.
Juha Honkala
2005 J jnl
The language equivalence problem for HD0L systems having D0L growths.
Theor. Comput. Sci.
Juha Honkala
2004 J jnl
Bounds for the D0L language equivalence problem.
Inf. Comput.
Juha Honkala
2004 J jnl
Decidability questions related to abstract numeration systems.
Discret. Math.
Juha Honkala, Michel Rigo
2004 J jnl
On infinite HD0L words having sparse letters.
Int. J. Comput. Math.
Juha Honkala
2003 J jnl
A bound for the [omega]-equivalence problem of polynomial D0L systems.
RAIRO Theor. Informatics Appl.
Juha Honkala
2003 J jnl
Decidability results for Watson-Crick D0L systems with nonregular triggers.
Theor. Comput. Sci.
Juha Honkala
2003 J jnl
On D0L systems with finite axiom sets.
Acta Cybern.
Juha Honkala
2003 — conf
On DOL Power Series over Various Semirings.
Grammars and Automata for String Processing
Juha Honkala
2003 J jnl
On images of D0L and DT0L power series.
Theor. Comput. Sci.
Juha Honkala
2003 J jnl
On the Images of N-Rational Sequences Counting Multiplicities.
Int. J. Algebra Comput.
Juha Honkala, Keijo Ruohonen
2003 J jnl
The DF0L Language Equivalence Problem.
Bull. EATCS
Juha Honkala
2003 J jnl
The Equivalence Problem of Polynomially Bounded D0L Systems - a Bound Depending Only on the Size of the Alphabet.
Theory Comput. Syst.
Juha Honkala
2002 J jnl
A Note on Systems of Alternative Word Equations.
Bull. EATCS
Juha Honkala
2002 J jnl
A new class of algebraic series having a decidable equivalence problem.
Fundam. Informaticae
Juha Honkala
2002 J jnl
On infinite words generated by polynomial D0L systems. Juha Honkala.
Discret. Appl. Math.
Juha Honkala
2002 J jnl
On the Simplification of HD0L Power Series.
J. Univers. Comput. Sci.
Juha Honkala
2002 J jnl
Remarks Concerning the D0L w-Equivalence Problem.
Int. J. Found. Comput. Sci.
Juha Honkala
2002 J jnl
The Equivalence Problem for DF0L Languages and Power Series.
J. Comput. Syst. Sci.
Juha Honkala
2002 J jnl
The equality problem for Parikh simple algebraic power series.
Inf. Process. Lett.
Juha Honkala
2001 J jnl
A Note on Uniform HDT0L Systems.
Bull. EATCS
Juha Honkala
2001 J jnl
A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem.
Theory Comput. Syst.
Juha Honkala
2001 J jnl
Easy cases of the D0L sequence equivalence problem.
Discret. Appl. Math.
Juha Honkala
2001 J jnl
On Parikh slender context-free languages.
Theor. Comput. Sci.
Juha Honkala
2001 — ch.
On Slender Languages.
Current Trends in Theoretical Computer Science
Juha Honkala
2001 — conf
On Sparse 0L Languages Over the Binary Alphabet.
Words, Semigroups, and Transductions
Juha Honkala
2001 — ch.
The D0L Problem Revisited.
Current Trends in Theoretical Computer Science
Juha Honkala
2001 J jnl
Three Variants of the DT0L Sequence Equivalence Problem.
J. Univers. Comput. Sci.
Juha Honkala
2001 J jnl
Watson-Crick D0L systems with regular triggers.
Theor. Comput. Sci.
Juha Honkala, Arto Salomaa
2000 J jnl
A Kleene-Schützenberger theorem for Lindenmayerian rational power series.
RAIRO Theor. Informatics Appl.
Juha Honkala
2000 J jnl
A short solution for the HDT0L sequence equivalence problem.
Theor. Comput. Sci.
Juha Honkala
2000 J jnl
On D0L power series.
Theor. Comput. Sci.
Juha Honkala
2000 J jnl
On Formal Power Series Generated by Lindenmayer Systems.
J. Autom. Lang. Comb.
Juha Honkala
2000 J jnl
On Slender 0L Languages over the Binary Alphabet.
Acta Informatica
Juha Honkala
2000 J jnl
Results Concerning Thinness of D0l Languages.
Int. J. Algebra Comput.
Juha Honkala
2000 J jnl
Results concerning EOL and COL power series.
Acta Cybern.
Juha Honkala
2000 J jnl
The D0L Problem Revisited.
Bull. EATCS
Juha Honkala
2000 J jnl
Zeros of Z-rational Sequences and Thin 0L Languages.
Bull. EATCS
Juha Honkala
1999 — conf
A Power Series Approach to Bounded Languages.
Jewels are Forever
Juha Honkala
1999 J jnl
On Chains of Word Equations and Test Sets.
Bull. EATCS
Juha Honkala
1999 J jnl
On algebraicness of D0L power series.
J. Univers. Comput. Sci.
Juha Honkala
1999 J jnl
On sequences defined by D0L power series.
RAIRO Theor. Informatics Appl.
Juha Honkala
1999 J jnl
On the Equivalence Problem of Context-free and DT0L Languages.
Discret. Appl. Math.
Juha Honkala
1999 J jnl
The Equivalence Problem of D0L and DF0L Power Series.
Fundam. Informaticae
Juha Honkala
1998 J jnl
Decision Problems Concerning Thinness and Slenderness of Formal Languages.
Acta Informatica
Juha Honkala
1998 J jnl
On Number Systems with Finite Degree of Ambiguity.
Inf. Comput.
Juha Honkala
1998 J jnl
On Slender Languages.
Bull. EATCS
Juha Honkala
1997 J jnl
A Decision Method for Parikh Slenderness of Context-free Languages.
Discret. Appl. Math.
Juha Honkala
1997 — conf
Decision Problems Concerning Algebraic Series with Noncommuting Variables.
Structures in Logic and Computer Science
Juha Honkala
1997 J jnl
Decision Problems Concerning a Power Series Generalization of DTOL Systems.
Fundam. Informaticae
Juha Honkala
1997 J jnl
On Lindenmayerian Algebraic Power Series.
Theor. Comput. Sci.
Juha Honkala, Werner Kuich
1997 J jnl
On Lindenmayerian Algebraic Sequences.
Theor. Comput. Sci.
Juha Honkala
1997 J jnl
On Lindenmayerian Rational Subsets of Monoids.
RAIRO Theor. Informatics Appl.
Juha Honkala
1997 J jnl
On N-algebraic Parikh slender power series.
J. Univers. Comput. Sci.
Juha Honkala
1997 J jnl
On the Decidability of Some Equivalence Problems for L Algebraic Series.
Int. J. Algebra Comput.
Juha Honkala
1996 J jnl
On Images of Algebraic Series.
J. Univers. Comput. Sci.
Juha Honkala
1996 J jnl
On Parikh Slender Languages and Power Series.
J. Comput. Syst. Sci.
Juha Honkala
1996 J jnl
On a Power Series Generalization of ETOL Languages.
Fundam. Informaticae
Juha Honkala, Werner Kuich
1996 J jnl
On the Equivalence Problem of Algebraic Series with Commuting Variables.
Bull. EATCS
Juha Honkala
1995 J jnl
A Decision Method for the Unambiguity of Sets Defined by Number Systems
J. Univers. Comput. Sci.
Juha Honkala
1995 J jnl
On Four Classes of Lindenmayerian Power Series.
J. Univers. Comput. Sci.
Juha Honkala, Werner Kuich
1995 J jnl
On Morphycally Generated Formal Power Series.
RAIRO Theor. Informatics Appl.
Juha Honkala
1994 — conf
An Iteratio Property of Lindenmayerioan Power Series.
Results and Trends in Theoretical Computer Science
Juha Honkala
1994 J jnl
On Generalized DT0L Systems and Their Fixed Points.
Theor. Comput. Sci.
Juha Honkala
1993 J jnl
On D0L Systems with Immigration.
Theor. Comput. Sci.
Juha Honkala
1993 C conf
On Lindenmayerian Series in Complete Semirings.
Developments in Language Theory
Juha Honkala
1992 J jnl
Characterization results about L codes.
RAIRO Theor. Informatics Appl.
Juha Honkala, Arto Salomaa
1991 A* conf
L Morphisms: Bounded Delay and Regularity of Ambiguity.
ICALP
Juha Honkala, Arto Salomaa
1991 J jnl
On Algebraic Generalized Zeta Functions of Formal Power Series.
Theor. Comput. Sci.
Juha Honkala
1991 J jnl
On generalized zeta functions of formal languages and series.
Discret. Appl. Math.
Juha Honkala
1989 J jnl
A Necessary Condition for the Rationality of the Zeta Function of a Regular Language.
Theor. Comput. Sci.
Juha Honkala
1988 J jnl
A defect property of codes with unbounded delays.
Discret. Appl. Math.
Juha Honkala
1986 J jnl
A Decision Method for The Recognizability of Sets Defined by Number Systems.
RAIRO Theor. Informatics Appl.
Juha Honkala
1984 J jnl
Bases and Ambiguity of Number Systems.
Theor. Comput. Sci.
Juha Honkala
1982 J jnl
Unique representation in number systems and L codes.
Discret. Appl. Math.
Juha Honkala