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="Harju, T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Gene assembly through cyclic graph decomposition
A. Ehrenfeucht
,
T. Harju
,
G. Rozenberg
Theoretical Computer Science
281
(1-2), 2002, pp. 325-349
A note on decidability questions on presentations of word semigroups
C. Choffrut
,
T. Harju
,
J. Karhumäki
Theoretical Computer Science
183
(1), 1997, pp. 83-92
Compactness of systems of equations in semigroups
T. Harju
,
J. Karhumäki
,
W. Plandowski
International Journal of Algebra and Computation
7
(4), 1997, pp. 457-470
Characterization and complexity of uniformly nonprimitive labeled 2-structures
J. Engelfriet
,
T. Harju
,
A. Proskurowski
,
G. Rozenberg
Theoretical Computer Science
154
(2), 1996, pp. 247-282
Remarks on generalized post correspondence problem
T. Harju
,
J. Karhumäki
,
D. Krob
Lecture Notes in Computer Science
1046
, 1996, pp. 39-48
Theory of 2-structures
A. Ehrenfeucht
,
T. Harju
,
G. Rozenberg
Lecture Notes in Computer Science
944
, 1995, pp. 1-14
Compactness of systems of equations in semigroups
T. Harju
,
J. Karhumäki
,
W. Plandowski
Lecture Notes in Computer Science
944
, 1995, pp. 444-454
Identities and transductions
T. Harju
,
H.J. Hoogeboom
,
H.C.M. Kleijn
Proceedings of the Colloquium in Honor of Arto Salomaa. Results and Trends in Theoretical Computer Science (Graz, Austria, June 10-11, 1994)
LNCS 812
, 1994, pp. 140-144
Representation of rational functions with prefix and suffix codings
T. Harju
,
H.C.M. Kleijn
,
M. Latteux
,
A. Terlutte
Theoretical Computer Science
134
(2), 1994, pp. 403-413
Decomposition of infinite labeled 2-structures
T. Harju
,
G. Rozenberg
Proceedings of the Colloquium in Honor of Arto Salomaa. Results and Trends in Theoretical Computer Science (Graz, Austria, June 10-11, 1994)
LNCS 812
, 1994, pp. 145-158
Deterministic sequential functions
T. Harju
,
H.C.M. Kleijn
,
M. Latteux
Acta Informatica
29
, 1992, pp. 545-554
Decidability problems for unary output sequential transducers
T. Harju
,
H.C.M. Kleijn
Discrete Applied Mathematics
32
, 1991, pp. 131-140
The equivalence problem of multitape finite automata
T. Harju
,
J. Karhumäki
Theoretical Computer Science
78
, 1990, pp. 347-355
Decidability of the multiplicity equivalence of multitape finite automata
T. Harju
,
J. Karhumäki
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 477-481
Dominoes and the regularity of DNA splicing languages
K. Culik II
,
T. Harju
Lecture Notes in Computer Science
372
, 1989, pp. 222-233
Cardinality problems of compositions of morphisms and inverse morphisms
T. Harju
,
H.C.M. Kleijn
Math. Systems Theory
22
, 1989, pp. 151-159
On morphic generation of regular languages
T. Harju
,
J. Karhumäki
,
H.C.M. Kleijn
Discrete Applied Mathematics
15
, 1986, pp. 55-60
The
\omega
-sequence equivalence problem for DOL systems is decidable
K. Culik II
,
T. Harju
Journal of the ACM
31
(2), 1984, pp. 282-298
The equations
h(w) = w^n
in binary alphabets
T. Harju
,
M. Linna
Theoretical Computer Science
33
(2,3), 1984, pp. 327-329
Dominoes over a free monoid
K. Culik II
,
T. Harju
Theoretical Computer Science
18
, 1982, pp. 279-300
The
\omega
-sequence equivalence problem for DOL systems is decidable
K. Culik II
,
T. Harju
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC'81 (Milwaukee, WI, May 11-13, 1981)
, 1981, pp. 1-6
A simulation result for the auxiliary pushdown automata
T. Harju
Journal of Computer and System Sciences
19
(2), 1979, October, pp. 119-132