Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Honkala, Juha"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A Kraft-McMillan inequality for free semigroups of upper-triangular matrices
Juha Honkala
Information and Computation
239
, 2014, pp. 216-221
Remarks concerning the freeness problem over morphism and matrix semigroups
Juha Honkala
Theoretical Computer Science
557
, 2014, pp. 115-119
The sequence equivalence problem for primitive D0L systems
Juha Honkala
Journal of Computer and System Sciences
79
(1), 2013, pp. 101-110
Equality sets of morphic word sequences
Juha Honkala
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1749-1766
Marked D0L systems and the
2n
-conjecture
Juha Honkala
Theoretical Computer Science
432
, 2012, pp. 94-97
A characterization of rational D0L power series
Juha Honkala
Acta Informatica
48
(1), 2011, pp. 19-24
The equality problem for infinite words generated by primitive morphisms
Juha Honkala
Information and Computation
207
(8), 2009, pp. 900-907
On the simplification of infinite morphic words
Juha Honkala
Theoretical Computer Science
410
(8-10), 2009, pp. 997-1000
Cancellation and periodicity properties of iterated morphisms
Juha Honkala
Theoretical Computer Science
391
(1-2), 2008, pp. 61-64
A new bound for the D0Ll sequence equivalence problem
Juha Honkala
Acta Informatica
43
(6), 2007, pp. 419-429
The D0L
\omega
-equivalence problem
Juha Honkala
International Journal of Foundations of Computer Science
18
(1), 2007, pp. 181-194
The base problem for D0L Parikh sets
Juha Honkala
International Journal of Foundations of Computer Science
17
(2), 2006, pp. 465-473
The class of HDT0L sequences is closed with respect to rational functions
Juha Honkala
Information Processing Letters
94
(4), 2005, pp. 155-158
An
n^2
-bound for the ultimate equivalence problem of certain DOL systems over an
n
-letter alphabet
Juha Honkala
Journal of Computer and System Sciences
71
(4), 2005, pp. 506-519
The language equivalence problem for HD0L systems having H0L growths
Juha Honkala
Theoretical Computer Science
330
(1), 2005, pp. 123-133
Bounds for the DOL language equivalence problem
Juha Honkala
Information and Computation
190
(1), 2004, pp. 70-80
On images of D0L and DT0L power series
Juha Honkala
Theoretical Computer Science
290
(3), 2003, pp. 1869-1882
Decidability results for Watson-Crick D0L systems with nonregular triggers
Juha Honkala
Theoretical Computer Science
302
(1-3), 2003, pp. 481-488
The equivalence problem of polynomially bounded D0L systems - A bound depending only on the size of the alphabet
Juha Honkala
Theory of Computing Systems
36
(1), 2003, pp. 89-103
On infinite words generated by polynomial D0L systems
Juha Honkala
Discrete Applied Mathematics
116
(3), 2002, pp. 297-305
The equality problem for Parikh simple algebraic power series
Juha Honkala
Information Processing Letters
84
(2), 2002, pp. 57-60
The equivalence problem for DF0L languages and power series
Juha Honkala
Journal of Computer and System Sciences
65
(2), 2002, pp. 377-392
Remarks concerning the D0L
\omega
-equivalence problem
Juha Honkala
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 769-777
Watson-Crick D0L systems with regular triggers
Juha Honkala
,
Arto Salomaa
Theoretical Computer Science
259
(1-2), 2001, pp. 689-698
Easy cases of the D0L sequence equivalence problem
Juha Honkala
Discrete Applied Mathematics
113
(2-3), 2001, pp. 285-290
Seiten 1
2
>