The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Juha Honkala: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  75. The equality problem for infinite words generated by primitive morphisms [Citation Graph (, )][DBLP]


  76. On generalized zeta functions of formal languages and series. [Citation Graph (, )][DBLP]


  77. A defect property of codes with unbounded delays. [Citation Graph (, )][DBLP]


Search in 0.518secs, Finished in 0.522secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002