 | 2009 |
|---|
| 84 |       | Juha Honkala:
The equality problem for infinite words generated by primitive morphisms
CoRR abs/0904.2257: (2009) |
| 83 | | Juha Honkala:
Number Systems and the Injectivity Problem for Matrix Representations of Free Monoids.
IJAC 19(2): 229-233 (2009) |
| 82 | | Juha Honkala:
The equality problem for infinite words generated by primitive morphisms.
Inf. Comput. 207(8): 900-907 (2009) |
| 81 | | Juha Honkala:
On the simplification of infinite morphic words.
Theor. Comput. Sci. 410(8-10): 997-1000 (2009) |
| 2008 |
|---|
| 80 | | Juha Honkala:
Cancellation and periodicity properties of iterated morphisms.
Theor. Comput. Sci. 391(1-2): 61-64 (2008) |
| 2007 |
|---|
| 79 | | Juha Honkala:
A periodicity property of iterated morphisms.
ITA 41(2): 215-223 (2007) |
| 78 | | Juha Honkala:
The D0l omega-equivalence Problem.
Int. J. Found. Comput. Sci. 18(1): 181-194 (2007) |
| 2006 |
|---|
| 77 | | Juha Honkala:
On the Problem Whether the Image of an N-Rational Series Equals.
Fundam. Inform. 73(1-2): 127-132 (2006) |
| 76 | | Juha Honkala:
The Base Problem for D0l Parikh Sets.
Int. J. Found. Comput. Sci. 17(2): 465-474 (2006) |
| 2005 |
|---|
| 75 | | Juha Honkala:
The class of HDT0L sequences is closed with respect to rational functions.
Inf. Process. Lett. 94(4): 155-158 (2005) |
| 74 | | Juha Honkala:
The equivalence problem for languages defined by transductions on D0L languages.
Int. J. Comput. Math. 82(8): 911-918 (2005) |
| 73 | | Juha Honkala:
An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet.
J. Comput. Syst. Sci. 71(4): 506-519 (2005) |
| 72 | | Juha Honkala:
The language equivalence problem for HD0L systems having D0L growths.
Theor. Comput. Sci. 330(1): 123-133 (2005) |
| 2004 |
|---|
| 71 | | Juha Honkala,
Michel Rigo:
Decidability questions related to abstract numeration systems.
Discrete Mathematics 285(1-3): 329-333 (2004) |
| 70 | | Juha Honkala:
Bounds for the D0L language equivalence problem.
Inf. Comput. 190(1): 70-80 (2004) |
| 69 | | Juha Honkala:
On infinite HD0L words having sparse letters.
Int. J. Comput. Math. 81(2): 133-139 (2004) |
| 2003 |
|---|
| 68 |  | Juha Honkala:
On DOL Power Series over Various Semirings.
Grammars and Automata for String Processing 2003: 263-274 |
| 67 | | Juha Honkala:
On D0L systems with finite axiom sets.
Acta Cybern. 16(1): 29-35 (2003) |
| 66 | | Juha Honkala:
The DF0L Language Equivalence Problem.
Bulletin of the EATCS 80: 143-152 (2003) |
| 65 | | Juha Honkala,
Keijo Ruohonen:
On the Images of N-Rational Sequences Counting Multiplicities.
IJAC 13(3): 303-321 (2003) |
| 64 | | Juha Honkala:
A bound for the [omega]-equivalence problem of polynomial D0L systems.
ITA 37(2): 149-157 (2003) |
| 63 | | Juha Honkala:
On images of D0L and DT0L power series.
Theor. Comput. Sci. 290(3): 1869-1882 (2003) |
| 62 | | Juha Honkala:
Decidability results for Watson-Crick D0L systems with nonregular triggers.
Theor. Comput. Sci. 302(1-3): 481-488 (2003) |
| 61 | | 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): 89-103 (2003) |
| 2002 |
|---|
| 60 | | Juha Honkala:
A Note on Systems of Alternative Word Equations.
Bulletin of the EATCS 78: 237-240 (2002) |
| 59 | | Juha Honkala:
On infinite words generated by polynomial D0L systems. Juha Honkala.
Discrete Applied Mathematics 116(3): 297-305 (2002) |
| 58 | | Juha Honkala:
A new class of algebraic series having a decidable equivalence problem.
Fundam. Inform. 53(3-4): 315-320 (2002) |
| 57 | | Juha Honkala:
The equality problem for Parikh simple algebraic power series.
Inf. Process. Lett. 84(2): 57-60 (2002) |
| 56 | | Juha Honkala:
Remarks Concerning the D0L w-Equivalence Problem.
Int. J. Found. Comput. Sci. 13(5): 769-777 (2002) |
| 55 | | Juha Honkala:
The Equivalence Problem for DF0L Languages and Power Series.
J. Comput. Syst. Sci. 65(2): 377-392 (2002) |
| 54 | | Juha Honkala:
On the Simplification of HD0L Power Series.
J. UCS 8(12): 1040-1046 (2002) |
| 2001 |
|---|
| 53 | | Juha Honkala:
On Sparse 0L Languages Over the Binary Alphabet.
Words, Semigroups, and Transductions 2001: 181-188 |
| 52 | | Juha Honkala:
On Slender Languages.
Current Trends in Theoretical Computer Science 2001: 708-716 |
| 51 | | Juha Honkala:
The D0L Problem Revisited.
Current Trends in Theoretical Computer Science 2001: 734-739 |
| 50 | | Juha Honkala:
A Note on Uniform HDT0L Systems.
Bulletin of the EATCS 75: 220 (2001) |
| 49 | | Juha Honkala:
Easy cases of the D0L sequence equivalence problem.
Discrete Applied Mathematics 113(2-3): 285-290 (2001) |
| 48 | | Juha Honkala:
Three Variants of the DT0L Sequence Equivalence Problem.
J. UCS 7(10): 886-892 (2001) |
| 47 | | Juha Honkala:
On Parikh slender context-free languages.
Theor. Comput. Sci. 255(1-2): 667-677 (2001) |
| 46 | | Juha Honkala,
Arto Salomaa:
Watson-Crick D0L systems with regular triggers.
Theor. Comput. Sci. 259(1-2): 689-698 (2001) |
| 45 | | Juha Honkala:
A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem.
Theory Comput. Syst. 34(3): 263-272 (2001) |
| 2000 |
|---|
| 44 | | Juha Honkala:
Results concerning EOL and COL power series.
Acta Cybern. 14(4): 597-605 (2000) |
| 43 | | Juha Honkala:
On Slender 0L Languages over the Binary Alphabet.
Acta Inf. 36(9/10): 805-815 (2000) |
| 42 | | Juha Honkala:
The D0L Problem Revisited.
Bulletin of the EATCS 70: 142-155 (2000) |
| 41 | | Juha Honkala:
Zeros of Z-rational Sequences and Thin 0L Languages.
Bulletin of the EATCS 72: 178-182 (2000) |
| 40 | | Juha Honkala:
Results Concerning Thinness of D0l Languages.
IJAC 10(2): 209-216 (2000) |
| 39 | | Juha Honkala:
A Kleene-Schützenberger theorem for Lindenmayerian rational power series.
ITA 34(4): 297-306 (2000) |
| 38 | | Juha Honkala:
On Formal Power Series Generated by Lindenmayer Systems.
Journal of Automata, Languages and Combinatorics 5(2): 123-144 (2000) |
| 37 | | Juha Honkala:
On D0L power series.
Theor. Comput. Sci. 244(1-2): 117-134 (2000) |
| 36 | | Juha Honkala:
A short solution for the HDT0L sequence equivalence problem.
Theor. Comput. Sci. 244(1-2): 267-270 (2000) |
| 1999 |
|---|
| 35 | | Juha Honkala:
A Power Series Approach to Bounded Languages.
Jewels are Forever 1999: 135-144 |
| 34 | | Juha Honkala:
On Chains of Word Equations and Test Sets.
Bulletin of the EATCS 68: 157-159 (1999) |
| 33 | | Juha Honkala:
On the Equivalence Problem of Context-free and DT0L Languages.
Discrete Applied Mathematics 98(1-2): 147-149 (1999) |
| 32 | | Juha Honkala:
The Equivalence Problem of D0L and DF0L Power Series.
Fundam. Inform. 38(1-2): 201-208 (1999) |
| 31 | | Juha Honkala:
On sequences defined by D0L power series.
ITA 33(2): 125-132 (1999) |
| 30 | | Juha Honkala:
On algebraicness of D0L power series.
J. UCS 5(1): 11-19 (1999) |
| 1998 |
|---|
| 29 | | Juha Honkala:
Decision Problems Concerning Thinness and Slenderness of Formal Languages.
Acta Inf. 35(7): 625-636 (1998) |
| 28 | | Juha Honkala:
On Slender Languages.
Bulletin of the EATCS 64: (1998) |
| 27 | | Juha Honkala:
On Number Systems with Finite Degree of Ambiguity.
Inf. Comput. 145(1): 51-63 (1998) |
| 1997 |
|---|
| 26 | | Juha Honkala:
Decision Problems Concerning Algebraic Series with Noncommuting Variables.
Structures in Logic and Computer Science 1997: 281-290 |
| 25 | | Juha Honkala:
A Decision Method for Parikh Slenderness of Context-free Languages.
Discrete Applied Mathematics 73(1): 1-4 (1997) |
| 24 | | Juha Honkala:
Decision Problems Concerning a Power Series Generalization of DTOL Systems.
Fundam. Inform. 32(3-4): 341-348 (1997) |
| 23 | | Juha Honkala:
On Lindenmayerian Rational Subsets of Monoids.
ITA 31(1): 81-96 (1997) |
| 22 | | Juha Honkala:
On N-algebraic Parikh slender power series.
J. UCS 3(10): 1114-1120 (1997) |
| 21 | | Juha Honkala,
Werner Kuich:
On Lindenmayerian Algebraic Power Series.
Theor. Comput. Sci. 183(1): 113-142 (1997) |
| 20 | | Juha Honkala:
On Lindenmayerian Algebraic Sequences.
Theor. Comput. Sci. 183(1): 143-154 (1997) |
| 1996 |
|---|
| 19 | | Juha Honkala:
On the Equivalence Problem of Algebraic Series with Commuting Variables.
Bulletin of the EATCS 59: (1996) |
| 18 | | Juha Honkala,
Werner Kuich:
On a Power Series Generalization of ETOL Languages.
Fundam. Inform. 25(3): 257-270 (1996) |
| 17 | | Juha Honkala:
On Parikh Slender Languages and Power Series.
J. Comput. Syst. Sci. 52(1): 185-190 (1996) |
| 16 | | Juha Honkala:
On Images of Algebraic Series.
J. UCS 2(4): 217-223 (1996) |
| 1995 |
|---|
| 15 | | Juha Honkala:
On Morphycally Generated Formal Power Series.
ITA 29(2): 105-127 (1995) |
| 14 | | Juha Honkala,
Werner Kuich:
On Four Classes of Lindenmayerian Power Series.
J. UCS 1(2): 131-135 (1995) |
| 13 | | Juha Honkala:
A Decision Method for the Unambiguity of Sets Defined by Number Systems
J. UCS 1(9): 652-657 (1995) |
| 1994 |
|---|
| 12 | | Juha Honkala:
An Iteratio Property of Lindenmayerioan Power Series.
Results and Trends in Theoretical Computer Science 1994: 159-168 |
| 11 | | Juha Honkala:
On Generalized DT0L Systems and Their Fixed Points.
Theor. Comput. Sci. 127(2): 269-286 (1994) |
| 1993 |
|---|
| 10 | | Juha Honkala:
On Lindenmayerian Series in Complete Semirings.
Developments in Language Theory 1993: 179-192 |
| 9 | | Juha Honkala:
On D0L Systems with Immigration.
Theor. Comput. Sci. 120(2): 229-245 (1993) |
| 1992 |
|---|
| 8 | | Juha Honkala,
Arto Salomaa:
Characterization results about L codes.
ITA 26: 287-302 (1992) |
| 1991 |
|---|
| 7 | | Juha Honkala,
Arto Salomaa:
L Morphisms: Bounded Delay and Regularity of Ambiguity.
ICALP 1991: 566-574 |
| 6 | | Juha Honkala:
On generalized zeta functions of formal languages and series.
Discrete Applied Mathematics 32(2): 141-153 (1991) |
| 5 | | Juha Honkala:
On Algebraic Generalized Zeta Functions of Formal Power Series.
Theor. Comput. Sci. 79(1): 263-273 (1991) |
| 1989 |
|---|
| 4 | | Juha Honkala:
A Necessary Condition for the Rationality of the Zeta Function of a Regular Language.
Theor. Comput. Sci. 66(3): 341-347 (1989) |
| 1988 |
|---|
| 3 | | Juha Honkala:
A defect property of codes with unbounded delays.
Discrete Applied Mathematics 21(3): 261-264 (1988) |
| 1986 |
|---|
| 2 | | Juha Honkala:
A Decision Method for The Recognizability of Sets Defined by Number Systems.
ITA 20(4): 395-403 (1986) |
| 1984 |
|---|
| 1 | | Juha Honkala:
Bases and Ambiguity of Number Systems.
Theor. Comput. Sci. 31: 61-71 (1984) |
