The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Juha Honkala" ( http://dblp.L3S.de/Authors/Juha_Honkala )

  Author page on DBLP  Author page in RDF  Community of Juha Honkala in ASPL-2

Publication years (Num. hits)
1984-1995 (15) 1996-1999 (20) 2000-2001 (18) 2002-2003 (15) 2004-2009 (17) 2011 (2)
Publication types (Num. hits)
article(78) incollection(2) inproceedings(7)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 87 publication records. Showing 87 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Juha Honkala A characterization of rational D0L power series. Search on Bibsonomy Acta Inf. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Juha Honkala The Sequence Equivalence Problem for Marked DT0L Systems. Search on Bibsonomy Fundam. Inform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Juha Honkala On the simplification of infinite morphic words. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Juha Honkala Number Systems and the Injectivity Problem for Matrix Representations of Free Monoids. Search on Bibsonomy IJAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Juha Honkala The equality problem for infinite words generated by primitive morphisms. Search on Bibsonomy Inf. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Juha Honkala The equality problem for infinite words generated by primitive morphisms Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Juha Honkala Cancellation and periodicity properties of iterated morphisms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Juha Honkala A periodicity property of iterated morphisms. Search on Bibsonomy ITA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Juha Honkala The D0l omega-equivalence Problem. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Juha Honkala The Base Problem for D0l Parikh Sets. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Juha Honkala On the Problem Whether the Image of an N-Rational Series Equals. Search on Bibsonomy Fundam. Inform. The full citation details ... 2006 DBLP  BibTeX  RDF
1Juha Honkala The Ultimate Equivalence Problem for Uniform HDT0L Systems. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2006 DBLP  BibTeX  RDF
1Juha Honkala The class of HDT0L sequences is closed with respect to rational functions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Juha Honkala The language equivalence problem for HD0L systems having D0L growths. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Juha Honkala An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Juha Honkala The equivalence problem for languages defined by transductions on D0L languages. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Juha Honkala, Michel Rigo Decidability questions related to abstract numeration systems. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Juha Honkala Bounds for the D0L language equivalence problem. Search on Bibsonomy Inf. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Juha Honkala On infinite HD0L words having sparse letters. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Juha Honkala On D0L systems with finite axiom sets. Search on Bibsonomy Acta Cybern. The full citation details ... 2003 DBLP  BibTeX  RDF
1Juha Honkala On images of D0L and DT0L power series. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Juha Honkala Decidability results for Watson-Crick D0L systems with nonregular triggers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Juha Honkala A bound for the [omega]-equivalence problem of polynomial D0L systems. Search on Bibsonomy ITA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Juha Honkala, Keijo Ruohonen On the Images of N-Rational Sequences Counting Multiplicities. Search on Bibsonomy IJAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Juha Honkala The DF0L Language Equivalence Problem. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2003 DBLP  BibTeX  RDF
1Juha Honkala The Equivalence Problem of Polynomially Bounded D0L Systems - a Bound Depending Only on the Size of the Alphabet. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Juha Honkala On DOL Power Series over Various Semirings. Search on Bibsonomy Grammars and Automata for String Processing The full citation details ... 2003 DBLP  BibTeX  RDF
1Juha Honkala The equality problem for Parikh simple algebraic power series. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Juha Honkala Remarks Concerning the D0L w-Equivalence Problem. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Juha Honkala On the Simplification of HD0L Power Series. Search on Bibsonomy J. UCS The full citation details ... 2002 DBLP  BibTeX  RDF
1Juha Honkala A new class of algebraic series having a decidable equivalence problem. Search on Bibsonomy Fundam. Inform. The full citation details ... 2002 DBLP  BibTeX  RDF
1Juha Honkala A Note on Systems of Alternative Word Equations. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2002 DBLP  BibTeX  RDF
1Juha Honkala On infinite words generated by polynomial D0L systems. Juha Honkala. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Juha Honkala The Equivalence Problem for DF0L Languages and Power Series. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Parikh slender context-free languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Juha Honkala, Arto Salomaa Watson-Crick D0L systems with regular triggers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Juha Honkala Three Variants of the DT0L Sequence Equivalence Problem. Search on Bibsonomy J. UCS The full citation details ... 2001 DBLP  BibTeX  RDF
1Juha Honkala A Note on Uniform HDT0L Systems. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2001 DBLP  BibTeX  RDF
1Juha Honkala A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Juha Honkala Easy cases of the D0L sequence equivalence problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Slender Languages. Search on Bibsonomy Current Trends in Theoretical Computer Science The full citation details ... 2001 DBLP  BibTeX  RDF
1Juha Honkala The D0L Problem Revisited. Search on Bibsonomy Current Trends in Theoretical Computer Science The full citation details ... 2001 DBLP  BibTeX  RDF
1Juha Honkala On Sparse 0L Languages Over the Binary Alphabet. Search on Bibsonomy Words, Semigroups, and Transductions The full citation details ... 2001 DBLP  BibTeX  RDF
1Juha Honkala Results concerning EOL and COL power series. Search on Bibsonomy Acta Cybern. The full citation details ... 2000 DBLP  BibTeX  RDF
1Juha Honkala A short solution for the HDT0L sequence equivalence problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Juha Honkala On D0L power series. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Juha Honkala A Kleene-Schützenberger theorem for Lindenmayerian rational power series. Search on Bibsonomy ITA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Juha Honkala Results Concerning Thinness of D0l Languages. Search on Bibsonomy IJAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Slender 0L Languages over the Binary Alphabet. Search on Bibsonomy Acta Inf. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Formal Power Series Generated by Lindenmayer Systems. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2000 DBLP  BibTeX  RDF
1Juha Honkala The D0L Problem Revisited. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2000 DBLP  BibTeX  RDF
1Juha Honkala Zeros of Z-rational Sequences and Thin 0L Languages. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2000 DBLP  BibTeX  RDF
1Juha Honkala On sequences defined by D0L power series. Search on Bibsonomy ITA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Juha Honkala On algebraicness of D0L power series. Search on Bibsonomy J. UCS The full citation details ... 1999 DBLP  BibTeX  RDF
1Juha Honkala The Equivalence Problem of D0L and DF0L Power Series. Search on Bibsonomy Fundam. Inform. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Chains of Word Equations and Test Sets. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1999 DBLP  BibTeX  RDF
1Juha Honkala On the Equivalence Problem of Context-free and DT0L Languages. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Juha Honkala A Power Series Approach to Bounded Languages. Search on Bibsonomy Jewels are Forever The full citation details ... 1999 DBLP  BibTeX  RDF
1Juha Honkala Decision Problems Concerning Thinness and Slenderness of Formal Languages. Search on Bibsonomy Acta Inf. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Number Systems with Finite Degree of Ambiguity. Search on Bibsonomy Inf. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Slender Languages. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1998 DBLP  BibTeX  RDF
1Juha Honkala On Lindenmayerian Algebraic Sequences. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Juha Honkala, Werner Kuich On Lindenmayerian Algebraic Power Series. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Lindenmayerian Rational Subsets of Monoids. Search on Bibsonomy ITA The full citation details ... 1997 DBLP  BibTeX  RDF
1Juha Honkala On N-algebraic Parikh slender power series. Search on Bibsonomy J. UCS The full citation details ... 1997 DBLP  BibTeX  RDF
1Juha Honkala Decision Problems Concerning a Power Series Generalization of DTOL Systems. Search on Bibsonomy Fundam. Inform. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Juha Honkala A Decision Method for Parikh Slenderness of Context-free Languages. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Juha Honkala Decision Problems Concerning Algebraic Series with Noncommuting Variables. Search on Bibsonomy Structures in Logic and Computer Science The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Images of Algebraic Series. Search on Bibsonomy J. UCS The full citation details ... 1996 DBLP  BibTeX  RDF
1Juha Honkala, Werner Kuich On a Power Series Generalization of ETOL Languages. Search on Bibsonomy Fundam. Inform. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Juha Honkala On the Equivalence Problem of Algebraic Series with Commuting Variables. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1996 DBLP  BibTeX  RDF
1Juha Honkala On Parikh Slender Languages and Power Series. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Morphycally Generated Formal Power Series. Search on Bibsonomy ITA The full citation details ... 1995 DBLP  BibTeX  RDF
1Juha Honkala, Werner Kuich On Four Classes of Lindenmayerian Power Series. Search on Bibsonomy J. UCS The full citation details ... 1995 DBLP  BibTeX  RDF
1Juha Honkala A Decision Method for the Unambiguity of Sets Defined by Number Systems Search on Bibsonomy J. UCS The full citation details ... 1995 DBLP  BibTeX  RDF
1Juha Honkala On Generalized DT0L Systems and Their Fixed Points. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Juha Honkala An Iteratio Property of Lindenmayerioan Power Series. Search on Bibsonomy Results and Trends in Theoretical Computer Science The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Juha Honkala On D0L Systems with Immigration. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Juha Honkala On Lindenmayerian Series in Complete Semirings. Search on Bibsonomy Developments in Language Theory The full citation details ... 1993 DBLP  BibTeX  RDF
1Juha Honkala, Arto Salomaa Characterization results about L codes. Search on Bibsonomy ITA The full citation details ... 1992 DBLP  BibTeX  RDF
1Juha Honkala On Algebraic Generalized Zeta Functions of Formal Power Series. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Juha Honkala On generalized zeta functions of formal languages and series. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Juha Honkala, Arto Salomaa L Morphisms: Bounded Delay and Regularity of Ambiguity. Search on Bibsonomy ICALP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Juha Honkala A Necessary Condition for the Rationality of the Zeta Function of a Regular Language. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Juha Honkala A defect property of codes with unbounded delays. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Juha Honkala A Decision Method for The Recognizability of Sets Defined by Number Systems. Search on Bibsonomy ITA The full citation details ... 1986 DBLP  BibTeX  RDF
1Juha Honkala Bases and Ambiguity of Number Systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #87 of 87 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.