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: Journal=Theor.~Comput.~Sci. AND Volume=108
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Locally commutative power semigroups and counting factors of words
Jorge Almeida
Theoretical Computer Science
108
, 1993, pp. 3-16
On Kleene algebras
Sinis̑a Crvenković
,
Rozália S. Madarász
Theoretical Computer Science
108
, 1993, pp. 17-24
Möbius functions and confluent semi-commutations
Volker Diekert
Theoretical Computer Science
108
, 1993, pp. 25-43
Synchronized rational relations of finite and infinite words
Christiane Frougny
,
Jacques Sakarovitch
Theoretical Computer Science
108
, 1993, pp. 45-82
Cayley automata
Max Garzon
Theoretical Computer Science
108
, 1993, pp. 83-102
Equations over finite sets of words and equivalence problems in automata theory
J. Karhumäki
Theoretical Computer Science
108
, 1993, pp. 103-118
Groups of finite elementary codes
Masashi Katsura
,
Genjiro Tanaka
Theoretical Computer Science
108
, 1993, pp. 119-149
Standard automata and semidirect products of transformation semigroups
Michael Kunze
Theoretical Computer Science
108
, 1993, pp. 151-171
Decompositions of recognizable strong maximal codes
Liang Zhang
,
Weide Qiu
Theoretical Computer Science
108
, 1993, pp. 173-183
Tree transducers with external functions
Zoltán Fülöp
,
Frank Herrmann
,
Sándor Vágvölgyi
,
Heiko Vogler
Theoretical Computer Science
108
, 1993, pp. 185-236
Stability for the zigzag submonoids
Do Long Van
,
Bertrand Le Saëc
,
Igor Litovsky
Theoretical Computer Science
108
, 1993, pp. 237-249
A generalization of Sardinas and Patterson's algorithm to
z
-codes
M. Madonia
,
S. Salemi
,
T. Sportelli
Theoretical Computer Science
108
, 1993, pp. 251-270
The complexity of matrix transposition on one-tape off-line Turing machines with output tape
Martin Dietzfelbinger
,
Wolfgang Maass
Theoretical Computer Science
108
, 1993, pp. 271-290
The average CRI-length of a controlles ALOHA collision resolution algorithm
Ulrich Schmid
Theoretical Computer Science
108
(2), 1993, pp. 291-310
Rotating-table games and derivatives of words
Reuven Bar Yehuda
,
Tuvi Etzion
,
Shlomo Moran
Theoretical Computer Science
108
, 1993, pp. 311-329
Efficient CRCW-PRAM algorithms for universal substring searching
Alberto Apostolico
Theoretical Computer Science
108
, 1993, pp. 331-344
On finding common subtrees
Roberto Grossi
Theoretical Computer Science
108
, 1993, pp. 345-356
Picture words with invisible lines
Karine Slowinski
Theoretical Computer Science
108
, 1993, pp. 357-363
The shortest common nonsubsequence problem is NP-complete
M. Middendorf
Theoretical Computer Science
108
, 1993, pp. 365-369
The weighted list update problem and the lazy adversary
Fabrizio d'Amore
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Theoretical Computer Science
108
, 1993, pp. 371-384
Sums and rational multiples of
q
-automatic sequences are
q
-automatic
S. Lehr
Theoretical Computer Science
108
, 1993, pp. 385-391
A note on realtime one-way synchronized alternating one-counter automata
Juraj Hromkovic̑
,
Katsushi Inoue
Theoretical Computer Science
108
, 1993, pp. 393-400