default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuha Honkala
Person information
- affiliation: University of Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j100]Juha Honkala:
Commuting Upper Triangular Binary Morphisms. Fundam. Informaticae 191(3-4): 285-298 (2024)- [j99]Juha Honkala:
Rational power series in several noncommuting variables and the Skolem-Mahler-Lech theorem. Theor. Comput. Sci. 998: 114540 (2024) - [i4]Juha Honkala:
Linear equations and recursively enumerable sets. CoRR abs/2406.00688 (2024) - 2023
- [i3]Juha Honkala:
Commuting upper triangular binary morphisms. CoRR abs/2302.06158 (2023) - 2021
- [j98]Juha Honkala:
Quasi-universal k-regular sequences. Theor. Comput. Sci. 891: 84-89 (2021)
2010 – 2019
- 2019
- [j97]Juha Honkala:
A characterization of free pairs of upper triangular free monoid morphisms. Inf. Comput. 267: 110-115 (2019) - 2018
- [j96]Juha Honkala
:
A new bound for the D0L language equivalence problem. Acta Informatica 55(1): 81-88 (2018) - [j95]Juha Honkala:
Equality sets of binary D0L sequences. Theor. Comput. Sci. 740: 63-67 (2018) - 2017
- [j94]Juha Honkala:
D0L Sequences and their Equality Sets. Fundam. Informaticae 154(1-4): 201-206 (2017) - [j93]Juha Honkala:
Rational series with high image complexity. RAIRO Theor. Informatics Appl. 51(1): 1-6 (2017) - [j92]Juha Honkala:
Discrete Watson-Crick dynamical systems. Theor. Comput. Sci. 701: 125-131 (2017) - 2015
- [j91]Juha Honkala:
The finiteness problem for monoids of morphisms. RAIRO Theor. Informatics Appl. 49(1): 61-65 (2015) - [j90]Juha Honkala:
Products of matrices and recursively enumerable sets. J. Comput. Syst. Sci. 81(2): 468-472 (2015) - [j89]Juha Honkala:
Language-theoretic problems in certain matrix monoids. Theor. Comput. Sci. 601: 21-28 (2015) - 2014
- [j88]Emilie Charlier, Juha Honkala:
The freeness problem over matrix semigroups and bounded languages. Inf. Comput. 237: 243-256 (2014) - [j87]Juha Honkala:
A Kraft-McMillan inequality for free semigroups of upper-triangular matrices. Inf. Comput. 239: 216-221 (2014) - [j86]Juha Honkala:
Remarks concerning the freeness problem over morphism and matrix semigroups. Theor. Comput. Sci. 557: 115-119 (2014) - [c8]Juha Honkala:
Recognizability in Certain Matrix Monoids. Discrete Mathematics and Computer Science 2014: 201-206 - 2013
- [j85]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
- [j84]Juha Honkala:
A Characterization of Regular Languages as Equality Sets of HDT0L Sequences. Fundam. Informaticae 116(1-4): 123-128 (2012) - [j83]Juha Honkala:
Equality Sets of Morphic Word Sequences. Int. J. Found. Comput. Sci. 23(8): 1749- (2012) - [j82]Juha Honkala:
Marked D0L systems and the 2n-conjecture. Theor. Comput. Sci. 432: 94-97 (2012) - 2011
- [j81]Juha Honkala:
A characterization of rational D0L power series. Acta Informatica 48(1): 19-24 (2011) - [j80]Juha Honkala:
The Sequence Equivalence Problem for Marked DT0L Systems. Fundam. Informaticae 110(1-4): 175-182 (2011) - [j79]Juha Honkala:
The cyclicity problem for the images of Q-rational series. RAIRO Theor. Informatics Appl. 45(4): 375-381 (2011) - 2010
- [j78]Juha Honkala:
Ultimately Periodic Languages. J. Autom. Lang. Comb. 15(3/4): 255-261 (2010)
2000 – 2009
- 2009
- [j77]Juha Honkala:
The equality problem for infinite words generated by primitive morphisms. Inf. Comput. 207(8): 900-907 (2009) - [j76]Juha Honkala:
Number Systems and the Injectivity Problem for Matrix Representations of Free Monoids. Int. J. Algebra Comput. 19(2): 229-233 (2009) - [j75]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
- [j74]Juha Honkala:
Cancellation and periodicity properties of iterated morphisms. Theor. Comput. Sci. 391(1-2): 61-64 (2008) - 2007
- [j73]Juha Honkala:
The D0l omega-equivalence Problem. Int. J. Found. Comput. Sci. 18(1): 181-194 (2007) - [j72]Juha Honkala:
A periodicity property of iterated morphisms. RAIRO Theor. Informatics Appl. 41(2): 215-223 (2007) - 2006
- [j71]Juha Honkala:
The Ultimate Equivalence Problem for Uniform HDT0L Systems. Bull. EATCS 90: 127-130 (2006) - [j70]Juha Honkala:
On the Problem Whether the Image of an N-Rational Series Equals. Fundam. Informaticae 73(1-2): 127-132 (2006) - [j69]Juha Honkala:
The Base Problem for D0l Parikh Sets. Int. J. Found. Comput. Sci. 17(2): 465-474 (2006) - 2005
- [j68]Juha Honkala:
The equivalence problem for languages defined by transductions on D0L languages. Int. J. Comput. Math. 82(8): 911-918 (2005) - [j67]Juha Honkala:
The class of HDT0L sequences is closed with respect to rational functions. Inf. Process. Lett. 94(4): 155-158 (2005) - [j66]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) - [j65]Juha Honkala:
The language equivalence problem for HD0L systems having D0L growths. Theor. Comput. Sci. 330(1): 123-133 (2005) - 2004
- [j64]Juha Honkala, Michel Rigo:
Decidability questions related to abstract numeration systems. Discret. Math. 285(1-3): 329-333 (2004) - [j63]Juha Honkala:
Bounds for the D0L language equivalence problem. Inf. Comput. 190(1): 70-80 (2004) - [j62]Juha Honkala:
On infinite HD0L words having sparse letters. Int. J. Comput. Math. 81(2): 133-139 (2004) - 2003
- [j61]Juha Honkala:
On D0L systems with finite axiom sets. Acta Cybern. 16(1): 29-35 (2003) - [j60]Juha Honkala:
The DF0L Language Equivalence Problem. Bull. EATCS 80: 143-152 (2003) - [j59]Juha Honkala, Keijo Ruohonen:
On the Images of N-Rational Sequences Counting Multiplicities. Int. J. Algebra Comput. 13(3): 303-321 (2003) - [j58]Juha Honkala:
A bound for the [omega]-equivalence problem of polynomial D0L systems. RAIRO Theor. Informatics Appl. 37(2): 149-157 (2003) - [j57]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) - [j56]Juha Honkala:
On images of D0L and DT0L power series. Theor. Comput. Sci. 290(3): 1869-1882 (2003) - [j55]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
- [j54]Juha Honkala:
On infinite words generated by polynomial D0L systems. Juha Honkala. Discret. Appl. Math. 116(3): 297-305 (2002) - [j53]Juha Honkala:
A Note on Systems of Alternative Word Equations. Bull. EATCS 78: 237-240 (2002) - [j52]Juha Honkala:
A new class of algebraic series having a decidable equivalence problem. Fundam. Informaticae 53(3-4): 315-320 (2002) - [j51]Juha Honkala:
Remarks Concerning the D0L w-Equivalence Problem. Int. J. Found. Comput. Sci. 13(5): 769-777 (2002) - [j50]Juha Honkala:
The equality problem for Parikh simple algebraic power series. Inf. Process. Lett. 84(2): 57-60 (2002) - [j49]Juha Honkala:
The Equivalence Problem for DF0L Languages and Power Series. J. Comput. Syst. Sci. 65(2): 377-392 (2002) - [j48]Juha Honkala:
On the Simplification of HD0L Power Series. J. Univers. Comput. Sci. 8(12): 1040-1046 (2002) - 2001
- [j47]Juha Honkala:
Easy cases of the D0L sequence equivalence problem. Discret. Appl. Math. 113(2-3): 285-290 (2001) - [j46]Juha Honkala:
A Note on Uniform HDT0L Systems. Bull. EATCS 75: 220 (2001) - [j45]Juha Honkala:
Three Variants of the DT0L Sequence Equivalence Problem. J. Univers. Comput. Sci. 7(10): 886-892 (2001) - [j44]Juha Honkala:
A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem. Theory Comput. Syst. 34(3): 263-272 (2001) - [j43]Juha Honkala:
On Parikh slender context-free languages. Theor. Comput. Sci. 255(1-2): 667-677 (2001) - [j42]Juha Honkala, Arto Salomaa:
Watson-Crick D0L systems with regular triggers. Theor. Comput. Sci. 259(1-2): 689-698 (2001) - [c6]Juha Honkala:
On Sparse 0L Languages Over the Binary Alphabet. Words, Semigroups, and Transductions 2001: 181-188 - [p2]Juha Honkala:
On Slender Languages. Current Trends in Theoretical Computer Science 2001: 708-716 - [p1]Juha Honkala:
The D0L Problem Revisited. Current Trends in Theoretical Computer Science 2001: 734-739 - 2000
- [j41]Juha Honkala:
On Slender 0L Languages over the Binary Alphabet. Acta Informatica 36(9/10): 805-815 (2000) - [j40]Juha Honkala:
Results concerning EOL and COL power series. Acta Cybern. 14(4): 597-605 (2000) - [j39]Juha Honkala:
The D0L Problem Revisited. Bull. EATCS 70: 142-155 (2000) - [j38]Juha Honkala:
Zeros of Z-rational Sequences and Thin 0L Languages. Bull. EATCS 72: 178-182 (2000) - [j37]Juha Honkala:
Results Concerning Thinness of D0l Languages. Int. J. Algebra Comput. 10(2): 209-216 (2000) - [j36]Juha Honkala:
A Kleene-Schützenberger theorem for Lindenmayerian rational power series. RAIRO Theor. Informatics Appl. 34(4): 297-306 (2000) - [j35]Juha Honkala:
On Formal Power Series Generated by Lindenmayer Systems. J. Autom. Lang. Comb. 5(2): 123-144 (2000) - [j34]Juha Honkala:
On D0L power series. Theor. Comput. Sci. 244(1-2): 117-134 (2000) - [j33]Juha Honkala:
A short solution for the HDT0L sequence equivalence problem. Theor. Comput. Sci. 244(1-2): 267-270 (2000)
1990 – 1999
- 1999
- [j32]Juha Honkala:
On the Equivalence Problem of Context-free and DT0L Languages. Discret. Appl. Math. 98(1-2): 147-149 (1999) - [j31]Juha Honkala:
On Chains of Word Equations and Test Sets. Bull. EATCS 68: 157-159 (1999) - [j30]Juha Honkala:
The Equivalence Problem of D0L and DF0L Power Series. Fundam. Informaticae 38(1-2): 201-208 (1999) - [j29]Juha Honkala:
On sequences defined by D0L power series. RAIRO Theor. Informatics Appl. 33(2): 125-132 (1999) - [j28]Juha Honkala:
On algebraicness of D0L power series. J. Univers. Comput. Sci. 5(1): 11-19 (1999) - [c5]Juha Honkala:
A Power Series Approach to Bounded Languages. Jewels are Forever 1999: 135-144 - 1998
- [j27]Juha Honkala:
Decision Problems Concerning Thinness and Slenderness of Formal Languages. Acta Informatica 35(7): 625-636 (1998) - [j26]Juha Honkala:
On Slender Languages. Bull. EATCS 64 (1998) - [j25]Juha Honkala:
On Number Systems with Finite Degree of Ambiguity. Inf. Comput. 145(1): 51-63 (1998) - 1997
- [j24]Juha Honkala:
A Decision Method for Parikh Slenderness of Context-free Languages. Discret. Appl. Math. 73(1): 1-4 (1997) - [j23]Juha Honkala:
Decision Problems Concerning a Power Series Generalization of DTOL Systems. Fundam. Informaticae 32(3-4): 341-348 (1997) - [j22]Juha Honkala:
On the Decidability of Some Equivalence Problems for L Algebraic Series. Int. J. Algebra Comput. 7(3): 339-352 (1997) - [j21]Juha Honkala:
On Lindenmayerian Rational Subsets of Monoids. RAIRO Theor. Informatics Appl. 31(1): 81-96 (1997) - [j20]Juha Honkala:
On N-algebraic Parikh slender power series. J. Univers. Comput. Sci. 3(10): 1114-1120 (1997) - [j19]Juha Honkala, Werner Kuich:
On Lindenmayerian Algebraic Power Series. Theor. Comput. Sci. 183(1): 113-142 (1997) - [j18]Juha Honkala:
On Lindenmayerian Algebraic Sequences. Theor. Comput. Sci. 183(1): 143-154 (1997) - [c4]Juha Honkala:
Decision Problems Concerning Algebraic Series with Noncommuting Variables. Structures in Logic and Computer Science 1997: 281-290 - 1996
- [j17]Juha Honkala:
On the Equivalence Problem of Algebraic Series with Commuting Variables. Bull. EATCS 59 (1996) - [j16]Juha Honkala, Werner Kuich:
On a Power Series Generalization of ETOL Languages. Fundam. Informaticae 25(3): 257-270 (1996) - [j15]Juha Honkala:
On Parikh Slender Languages and Power Series. J. Comput. Syst. Sci. 52(1): 185-190 (1996) - [j14]Juha Honkala:
On Images of Algebraic Series. J. Univers. Comput. Sci. 2(4): 217-223 (1996) - 1995
- [j13]Juha Honkala:
On Morphycally Generated Formal Power Series. RAIRO Theor. Informatics Appl. 29(2): 105-127 (1995) - [j12]Juha Honkala, Werner Kuich:
On Four Classes of Lindenmayerian Power Series. J. Univers. Comput. Sci. 1(2): 131-135 (1995) - [j11]Juha Honkala:
A Decision Method for the Unambiguity of Sets Defined by Number Systems. J. Univers. Comput. Sci. 1(9): 652-657 (1995) - 1994
- [j10]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
- [j9]Juha Honkala:
On D0L Systems with Immigration. Theor. Comput. Sci. 120(2): 229-245 (1993) - [c2]Juha Honkala:
On Lindenmayerian Series in Complete Semirings. Developments in Language Theory 1993: 179-192 - 1992
- [j8]Juha Honkala, Arto Salomaa:
Characterization results about L codes. RAIRO Theor. Informatics Appl. 26: 287-301 (1992) - 1991
- [j7]Juha Honkala:
On generalized zeta functions of formal languages and series. Discret. Appl. Math. 32(2): 141-153 (1991) - [j6]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
- [j5]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
- [j4]Juha Honkala:
A defect property of codes with unbounded delays. Discret. Appl. Math. 21(3): 261-264 (1988) - 1986
- [j3]Juha Honkala:
A Decision Method for The Recognizability of Sets Defined by Number Systems. RAIRO Theor. Informatics Appl. 20(4): 395-403 (1986) - 1984
- [j2]Juha Honkala:
Bases and Ambiguity of Number Systems. Theor. Comput. Sci. 31: 61-71 (1984) - 1982
- [j1]Juha Honkala:
Unique representation in number systems and L codes. Discret. Appl. Math. 4(3): 229-232 (1982)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
