Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Juha Honkala
2010 – today
- 2013
[j83]Juha Honkala: The sequence equivalence problem for primitive D0L systems. J. Comput. Syst. Sci. 79(1): 101-110 (2013)- [i2]Emilie Charlier, Juha Honkala: The freeness problem over matrix semigroups and bounded languages. CoRR abs/1304.1637 (2013)
- 2012
- [j82]Juha Honkala: A Characterization of Regular Languages as Equality Sets of HDT0L Sequences. Fundam. Inform. 116(1-4): 123-128 (2012)
- [j81]Juha Honkala: Equality Sets of Morphic Word Sequences. Int. J. Found. Comput. Sci. 23(8): 1749- (2012)
- [j80]
- 2011
- [j79]
- [j78]Juha Honkala: The Sequence Equivalence Problem for Marked DT0L Systems. Fundam. Inform. 110(1-4): 175-182 (2011)
- [j77]Juha Honkala: The cyclicity problem for the images of Q-rational series. RAIRO - Theor. Inf. and Applic. 45(4): 375-381 (2011)
- 2010
- [j76]Juha Honkala: Ultimately Periodic Languages. Journal of Automata, Languages and Combinatorics 15(3/4): 255-261 (2010)
2000 – 2009
- 2009
- [j75]Juha Honkala: The equality problem for infinite words generated by primitive morphisms. Inf. Comput. 207(8): 900-907 (2009)
- [j74]Juha Honkala: Number Systems and the Injectivity Problem for Matrix Representations of Free Monoids. IJAC 19(2): 229-233 (2009)
- [j73]Juha Honkala: On the simplification of infinite morphic words. Theor. Comput. Sci. 410(8-10): 997-1000 (2009)
- [i1]Juha Honkala: The equality problem for infinite words generated by primitive morphisms. CoRR abs/0904.2257 (2009)
- 2008
- [j72]Juha Honkala: Cancellation and periodicity properties of iterated morphisms. Theor. Comput. Sci. 391(1-2): 61-64 (2008)
- 2007
- [j71]
- [j70]
- 2006
- [j69]Juha Honkala: The Ultimate Equivalence Problem for Uniform HDT0L Systems. Bulletin of the EATCS 90: 127-130 (2006)
- [j68]Juha Honkala: On the Problem Whether the Image of an N-Rational Series Equals. Fundam. Inform. 73(1-2): 127-132 (2006)
- [j67]Juha Honkala: The Base Problem for D0l Parikh Sets. Int. J. Found. Comput. Sci. 17(2): 465-474 (2006)
- 2005
- [j66]Juha Honkala: The equivalence problem for languages defined by transductions on D0L languages. Int. J. Comput. Math. 82(8): 911-918 (2005)
- [j65]Juha Honkala: The class of HDT0L sequences is closed with respect to rational functions. Inf. Process. Lett. 94(4): 155-158 (2005)
- [j64]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)
- [j63]Juha Honkala: The language equivalence problem for HD0L systems having D0L growths. Theor. Comput. Sci. 330(1): 123-133 (2005)
- 2004
- [j62]Juha Honkala, Michel Rigo: Decidability questions related to abstract numeration systems. Discrete Mathematics 285(1-3): 329-333 (2004)
- [j61]
- [j60]Juha Honkala: On infinite HD0L words having sparse letters. Int. J. Comput. Math. 81(2): 133-139 (2004)
- 2003
- [j59]
- [j58]
- [j57]Juha Honkala, Keijo Ruohonen: On the Images of N-Rational Sequences Counting Multiplicities. IJAC 13(3): 303-321 (2003)
- [j56]Juha Honkala: A bound for the [omega]-equivalence problem of polynomial D0L systems. ITA 37(2): 149-157 (2003)
- [j55]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)
- [j54]
- [j53]Juha Honkala: Decidability results for Watson-Crick D0L systems with nonregular triggers. Theor. Comput. Sci. 302(1-3): 481-488 (2003)
- [c7]Juha Honkala: On DOL Power Series over Various Semirings. Grammars and Automata for String Processing 2003: 263-274
- 2002
- [j52]Juha Honkala: On infinite words generated by polynomial D0L systems. Juha Honkala. Discrete Applied Mathematics 116(3): 297-305 (2002)
- [j51]Juha Honkala: A Note on Systems of Alternative Word Equations. Bulletin of the EATCS 78: 237-240 (2002)
- [j50]Juha Honkala: A new class of algebraic series having a decidable equivalence problem. Fundam. Inform. 53(3-4): 315-320 (2002)
- [j49]Juha Honkala: Remarks Concerning the D0L w-Equivalence Problem. Int. J. Found. Comput. Sci. 13(5): 769-777 (2002)
- [j48]Juha Honkala: The equality problem for Parikh simple algebraic power series. Inf. Process. Lett. 84(2): 57-60 (2002)
- [j47]Juha Honkala: The Equivalence Problem for DF0L Languages and Power Series. J. Comput. Syst. Sci. 65(2): 377-392 (2002)
- [j46]
- 2001
- [j45]Juha Honkala: Easy cases of the D0L sequence equivalence problem. Discrete Applied Mathematics 113(2-3): 285-290 (2001)
- [j44]
- [j43]
- [j42]Juha Honkala: A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem. Theory Comput. Syst. 34(3): 263-272 (2001)
- [j41]Juha Honkala: On Parikh slender context-free languages. Theor. Comput. Sci. 255(1-2): 667-677 (2001)
- [j40]Juha Honkala, Arto Salomaa: Watson-Crick D0L systems with regular triggers. Theor. Comput. Sci. 259(1-2): 689-698 (2001)
- [p2]
- [p1]Juha Honkala: The D0L Problem Revisited. Current Trends in Theoretical Computer Science 2001: 734-739
- [c6]Juha Honkala: On Sparse 0L Languages Over the Binary Alphabet. Words, Semigroups, and Transductions 2001: 181-188
- 2000
- [j39]
- [j38]
- [j37]
- [j36]Juha Honkala: Zeros of Z-rational Sequences and Thin 0L Languages. Bulletin of the EATCS 72: 178-182 (2000)
- [j35]
- [j34]Juha Honkala: A Kleene-Schützenberger theorem for Lindenmayerian rational power series. ITA 34(4): 297-306 (2000)
- [j33]Juha Honkala: On Formal Power Series Generated by Lindenmayer Systems. Journal of Automata, Languages and Combinatorics 5(2): 123-144 (2000)
- [j32]
- [j31]Juha Honkala: A short solution for the HDT0L sequence equivalence problem. Theor. Comput. Sci. 244(1-2): 267-270 (2000)
1990 – 1999
- 1999
- [j30]Juha Honkala: On the Equivalence Problem of Context-free and DT0L Languages. Discrete Applied Mathematics 98(1-2): 147-149 (1999)
- [j29]
- [j28]Juha Honkala: The Equivalence Problem of D0L and DF0L Power Series. Fundam. Inform. 38(1-2): 201-208 (1999)
- [j27]
- [j26]
- [c5]
- 1998
- [j25]Juha Honkala: Decision Problems Concerning Thinness and Slenderness of Formal Languages. Acta Inf. 35(7): 625-636 (1998)
- [j24]
- [j23]
- 1997
- [j22]Juha Honkala: A Decision Method for Parikh Slenderness of Context-free Languages. Discrete Applied Mathematics 73(1): 1-4 (1997)
- [j21]Juha Honkala: Decision Problems Concerning a Power Series Generalization of DTOL Systems. Fundam. Inform. 32(3-4): 341-348 (1997)
- [j20]
- [j19]
- [j18]Juha Honkala, Werner Kuich: On Lindenmayerian Algebraic Power Series. Theor. Comput. Sci. 183(1): 113-142 (1997)
- [j17]
- [c4]Juha Honkala: Decision Problems Concerning Algebraic Series with Noncommuting Variables. Structures in Logic and Computer Science 1997: 281-290
- 1996
- [j16]Juha Honkala: On the Equivalence Problem of Algebraic Series with Commuting Variables. Bulletin of the EATCS 59 (1996)
- [j15]Juha Honkala, Werner Kuich: On a Power Series Generalization of ETOL Languages. Fundam. Inform. 25(3): 257-270 (1996)
- [j14]Juha Honkala: On Parikh Slender Languages and Power Series. J. Comput. Syst. Sci. 52(1): 185-190 (1996)
- [j13]
- 1995
- [j12]
- [j11]Juha Honkala, Werner Kuich: On Four Classes of Lindenmayerian Power Series. J. UCS 1(2): 131-135 (1995)
- [j10]Juha Honkala: A Decision Method for the Unambiguity of Sets Defined by Number Systems. J. UCS 1(9): 652-657 (1995)
- 1994
- [j9]Juha Honkala: On Generalized DT0L Systems and Their Fixed Points. Theor. Comput. Sci. 127(2): 269-286 (1994)
- [c3]Juha Honkala: An Iteratio Property of Lindenmayerioan Power Series. Results and Trends in Theoretical Computer Science 1994: 159-168
- 1993
- [j8]
- [c2]Juha Honkala: On Lindenmayerian Series in Complete Semirings. Developments in Language Theory 1993: 179-192
- 1992
- [j7]
- 1991
- [j6]Juha Honkala: On generalized zeta functions of formal languages and series. Discrete Applied Mathematics 32(2): 141-153 (1991)
- [j5]Juha Honkala: On Algebraic Generalized Zeta Functions of Formal Power Series. Theor. Comput. Sci. 79(1): 263-273 (1991)
- [c1]Juha Honkala, Arto Salomaa: L Morphisms: Bounded Delay and Regularity of Ambiguity. ICALP 1991: 566-574
1980 – 1989
- 1989
- [j4]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
- [j3]Juha Honkala: A defect property of codes with unbounded delays. Discrete Applied Mathematics 21(3): 261-264 (1988)
- 1986
- [j2]Juha Honkala: A Decision Method for The Recognizability of Sets Defined by Number Systems. ITA 20(4): 395-403 (1986)
- 1984
- [j1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-03 21:42 CEST by the dblp team