Juha Honkala

ORCID

Publication Activity (10 Years)

Years Active: 1982-2024
Publications (10 Years): 14

Top Venues

Publications

Juha Honkala
Linear equations and recursively enumerable sets. CoRR (2024)
Juha Honkala
Rational power series in several noncommuting variables and the Skolem-Mahler-Lech theorem. Theor. Comput. Sci. 998 (2024)
Juha Honkala
Commuting Upper Triangular Binary Morphisms. Fundam. Informaticae 191 (3-4) (2024)
Juha Honkala
Commuting upper triangular binary morphisms. CoRR (2023)
Juha Honkala
-regular sequences. Theor. Comput. Sci. 891 (2021)
Juha Honkala
A characterization of free pairs of upper triangular free monoid morphisms. Inf. Comput. 267 (2019)
Juha Honkala
Equality sets of binary D0L sequences. Theor. Comput. Sci. 740 (2018)
Juha Honkala
A new bound for the D0L language equivalence problem. Acta Informatica 55 (1) (2018)
Juha Honkala
Rational series with high image complexity. RAIRO Theor. Informatics Appl. 51 (1) (2017)
Juha Honkala
D0L Sequences and their Equality Sets. Fundam. Informaticae 154 (1-4) (2017)
Juha Honkala
Discrete Watson-Crick dynamical systems. Theor. Comput. Sci. 701 (2017)
Juha Honkala
The finiteness problem for monoids of morphisms. RAIRO Theor. Informatics Appl. 49 (1) (2015)
Juha Honkala
Products of matrices and recursively enumerable sets. J. Comput. Syst. Sci. 81 (2) (2015)
Juha Honkala
Language-theoretic problems in certain matrix monoids. Theor. Comput. Sci. 601 (2015)
Emilie Charlier, Juha Honkala
The freeness problem over matrix semigroups and bounded languages. Inf. Comput. 237 (2014)
Juha Honkala
Recognizability in Certain Matrix Monoids. Discrete Mathematics and Computer Science (2014)
Juha Honkala
Remarks concerning the freeness problem over morphism and matrix semigroups. Theor. Comput. Sci. 557 (2014)
Juha Honkala
A Kraft-McMillan inequality for free semigroups of upper-triangular matrices. Inf. Comput. 239 (2014)
Emilie Charlier, Juha Honkala
The freeness problem over matrix semigroups and bounded languages CoRR (2013)
Juha Honkala
The sequence equivalence problem for primitive D0L systems. J. Comput. Syst. Sci. 79 (1) (2013)
Juha Honkala
A Characterization of Regular Languages as Equality Sets of HDT0L Sequences. Fundam. Informaticae 116 (1-4) (2012)
Juha Honkala
Marked D0L systems and the 2n-conjecture. Theor. Comput. Sci. 432 (2012)
Juha Honkala
Equality Sets of Morphic Word Sequences. Int. J. Found. Comput. Sci. 23 (8) (2012)
Juha Honkala
The cyclicity problem for the images of Q-rational series. RAIRO Theor. Informatics Appl. 45 (4) (2011)
Juha Honkala
The Sequence Equivalence Problem for Marked DT0L Systems. Fundam. Informaticae 110 (1-4) (2011)
Juha Honkala
A characterization of rational D0L power series. Acta Informatica 48 (1) (2011)
Juha Honkala
Ultimately Periodic Languages. J. Autom. Lang. Comb. 15 (3/4) (2010)
Juha Honkala
On the simplification of infinite morphic words. Theor. Comput. Sci. 410 (8-10) (2009)
Juha Honkala
The equality problem for infinite words generated by primitive morphisms. Inf. Comput. 207 (8) (2009)
Juha Honkala
The equality problem for infinite words generated by primitive morphisms CoRR (2009)
Juha Honkala
Number Systems and the Injectivity Problem for Matrix Representations of Free Monoids. Int. J. Algebra Comput. 19 (2) (2009)
Juha Honkala
Cancellation and periodicity properties of iterated morphisms. Theor. Comput. Sci. 391 (1-2) (2008)
Juha Honkala
A periodicity property of iterated morphisms. RAIRO Theor. Informatics Appl. 41 (2) (2007)
Juha Honkala
The D0l omega-equivalence Problem. Int. J. Found. Comput. Sci. 18 (1) (2007)
Juha Honkala
On the Problem Whether the Image of an N-Rational Series Equals. Fundam. Informaticae 73 (1-2) (2006)
Juha Honkala
The Base Problem for D0l Parikh Sets. Int. J. Found. Comput. Sci. 17 (2) (2006)
Juha Honkala
The Ultimate Equivalence Problem for Uniform HDT0L Systems. Bull. EATCS 90 (2006)
Juha Honkala
-letter alphabet. J. Comput. Syst. Sci. 71 (4) (2005)
Juha Honkala
The equivalence problem for languages defined by transductions on D0L languages. Int. J. Comput. Math. 82 (8) (2005)
Juha Honkala
The language equivalence problem for HD0L systems having D0L growths. Theor. Comput. Sci. 330 (1) (2005)
Juha Honkala
The class of HDT0L sequences is closed with respect to rational functions. Inf. Process. Lett. 94 (4) (2005)
Juha Honkala, Michel Rigo
Decidability questions related to abstract numeration systems. Discret. Math. 285 (1-3) (2004)
Juha Honkala
On infinite HD0L words having sparse letters. Int. J. Comput. Math. 81 (2) (2004)
Juha Honkala
Bounds for the D0L language equivalence problem. Inf. Comput. 190 (1) (2004)
Juha Honkala
The DF0L Language Equivalence Problem. Bull. EATCS 80 (2003)
Juha Honkala
A bound for the [omega]-equivalence problem of polynomial D0L systems. RAIRO Theor. Informatics Appl. 37 (2) (2003)
Juha Honkala
The Equivalence Problem of Polynomially Bounded D0L Systems - a Bound Depending Only on the Size of the Alphabet. Theory Comput. Syst. 36 (1) (2003)
Juha Honkala
On D0L systems with finite axiom sets. Acta Cybern. 16 (1) (2003)
Juha Honkala, Keijo Ruohonen
On the Images of N-Rational Sequences Counting Multiplicities. Int. J. Algebra Comput. 13 (3) (2003)
Juha Honkala
On DOL Power Series over Various Semirings. Grammars and Automata for String Processing (2003)
Juha Honkala
On images of D0L and DT0L power series. Theor. Comput. Sci. 290 (3) (2003)
Juha Honkala
Decidability results for Watson-Crick D0L systems with nonregular triggers. Theor. Comput. Sci. 302 (1-3) (2003)
Juha Honkala
A new class of algebraic series having a decidable equivalence problem. Fundam. Informaticae 53 (3-4) (2002)
Juha Honkala
On the Simplification of HD0L Power Series. J. Univers. Comput. Sci. 8 (12) (2002)
Juha Honkala
Remarks Concerning the D0L w-Equivalence Problem. Int. J. Found. Comput. Sci. 13 (5) (2002)
Juha Honkala
A Note on Systems of Alternative Word Equations. Bull. EATCS 78 (2002)
Juha Honkala
The Equivalence Problem for DF0L Languages and Power Series. J. Comput. Syst. Sci. 65 (2) (2002)
Juha Honkala
The equality problem for Parikh simple algebraic power series. Inf. Process. Lett. 84 (2) (2002)
Juha Honkala
On infinite words generated by polynomial D0L systems. Juha Honkala. Discret. Appl. Math. 116 (3) (2002)
Juha Honkala
On Sparse 0L Languages Over the Binary Alphabet. Words, Semigroups, and Transductions (2001)
Juha Honkala, Arto Salomaa
Watson-Crick D0L systems with regular triggers. Theor. Comput. Sci. 259 (1-2) (2001)
Juha Honkala
A Note on Uniform HDT0L Systems. Bull. EATCS 75 (2001)
Juha Honkala
A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem. Theory Comput. Syst. 34 (3) (2001)
Juha Honkala
Three Variants of the DT0L Sequence Equivalence Problem. J. Univers. Comput. Sci. 7 (10) (2001)
Juha Honkala
On Parikh slender context-free languages. Theor. Comput. Sci. 255 (1-2) (2001)
Juha Honkala
Easy cases of the D0L sequence equivalence problem. Discret. Appl. Math. 113 (2-3) (2001)
Juha Honkala
A Kleene-Schützenberger theorem for Lindenmayerian rational power series. RAIRO Theor. Informatics Appl. 34 (4) (2000)
Juha Honkala
On Formal Power Series Generated by Lindenmayer Systems. J. Autom. Lang. Comb. 5 (2) (2000)
Juha Honkala
Results Concerning Thinness of D0l Languages. Int. J. Algebra Comput. 10 (2) (2000)
Juha Honkala
A short solution for the HDT0L sequence equivalence problem. Theor. Comput. Sci. 244 (1-2) (2000)
Juha Honkala
Zeros of Z-rational Sequences and Thin 0L Languages. Bull. EATCS 72 (2000)
Juha Honkala
On Slender 0L Languages over the Binary Alphabet. Acta Informatica 36 (9/10) (2000)
Juha Honkala
On D0L power series. Theor. Comput. Sci. 244 (1-2) (2000)
Juha Honkala
The D0L Problem Revisited. Bull. EATCS 70 (2000)
Juha Honkala
Results concerning EOL and COL power series. Acta Cybern. 14 (4) (2000)
Juha Honkala
A Power Series Approach to Bounded Languages. Jewels are Forever (1999)
Juha Honkala
On sequences defined by D0L power series. RAIRO Theor. Informatics Appl. 33 (2) (1999)
Juha Honkala
On algebraicness of D0L power series. J. Univers. Comput. Sci. 5 (1) (1999)
Juha Honkala
On the Equivalence Problem of Context-free and DT0L Languages. Discret. Appl. Math. 98 (1-2) (1999)
Juha Honkala
The Equivalence Problem of D0L and DF0L Power Series. Fundam. Informaticae 38 (1-2) (1999)
Juha Honkala
On Chains of Word Equations and Test Sets. Bull. EATCS 68 (1999)
Juha Honkala
On Slender Languages. Bull. EATCS 64 (1998)
Juha Honkala
Decision Problems Concerning Thinness and Slenderness of Formal Languages. Acta Informatica 35 (7) (1998)
Juha Honkala
On Number Systems with Finite Degree of Ambiguity. Inf. Comput. 145 (1) (1998)
Juha Honkala
Decision Problems Concerning Algebraic Series with Noncommuting Variables. Structures in Logic and Computer Science (1997)
Juha Honkala
On the Decidability of Some Equivalence Problems for L Algebraic Series. Int. J. Algebra Comput. 7 (3) (1997)
Juha Honkala
On Lindenmayerian Algebraic Sequences. Theor. Comput. Sci. 183 (1) (1997)
Juha Honkala, Werner Kuich
On Lindenmayerian Algebraic Power Series. Theor. Comput. Sci. 183 (1) (1997)
Juha Honkala
On N-algebraic Parikh slender power series. J. Univers. Comput. Sci. 3 (10) (1997)
Juha Honkala
Decision Problems Concerning a Power Series Generalization of DTOL Systems. Fundam. Informaticae 32 (3-4) (1997)
Juha Honkala
On Lindenmayerian Rational Subsets of Monoids. RAIRO Theor. Informatics Appl. 31 (1) (1997)
Juha Honkala
A Decision Method for Parikh Slenderness of Context-free Languages. Discret. Appl. Math. 73 (1) (1997)
Juha Honkala
On Images of Algebraic Series. J. Univers. Comput. Sci. 2 (4) (1996)
Juha Honkala
On the Equivalence Problem of Algebraic Series with Commuting Variables. Bull. EATCS 59 (1996)
Juha Honkala
On Parikh Slender Languages and Power Series. J. Comput. Syst. Sci. 52 (1) (1996)
Juha Honkala, Werner Kuich
On a Power Series Generalization of ETOL Languages. Fundam. Informaticae 25 (3) (1996)
Juha Honkala, Werner Kuich
On Four Classes of Lindenmayerian Power Series. J. Univers. Comput. Sci. 1 (2) (1995)
Juha Honkala
A Decision Method for the Unambiguity of Sets Defined by Number Systems J. Univers. Comput. Sci. 1 (9) (1995)
Juha Honkala
On Morphycally Generated Formal Power Series. RAIRO Theor. Informatics Appl. 29 (2) (1995)
Juha Honkala
An Iteratio Property of Lindenmayerioan Power Series. Results and Trends in Theoretical Computer Science (1994)

Juha Honkala.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Juha Honkala