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=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Infinite arrays and controlled deterministic table OL array systems
R. Siromoney
,
K.G. Subramanian
,
V.R. Dare
Theoretical Computer Science
33
(1), 1984, pp. 3-11
Homomorphic images of sentential form languages defined by semi-Thue systems
M. Jantzen
,
M. Kudlek
Theoretical Computer Science
33
(1), 1984, pp. 13-43
Parametric channels via label expressions in CCS
E. Astesiano
,
E. Zucca
Theoretical Computer Science
33
(1), 1984, pp. 45-63
Fair termination revisited -- with delay
K.R. Apt
,
A. Pnueli
,
J. Stavi
Theoretical Computer Science
33
(1), 1984, pp. 65-84
Coping with known patterns of lies in a search game
B. Ravikumar
,
K.B. Lakshmanan
Theoretical Computer Science
33
(1), 1984, pp. 85-94
Some results on the deductive structure of join dependencies
P. Dybjer
Theoretical Computer Science
33
(1), 1984, pp. 95-105
Secondary attribute retrieval using tree data structures
C.E. Veni Madhavan
Theoretical Computer Science
33
(1), 1984, pp. 107-116
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
V.Ya. Pan
Theoretical Computer Science
33
(1), 1984, pp. 117-138
A systematic study of models of abstract data types
M. Broy
,
M. Wirsing
,
C. Pair
Theoretical Computer Science
33
(2,3), 1984, pp. 139-174
Conditional rewrite rules
S. Kaplan
Theoretical Computer Science
33
(2,3), 1984, pp. 175-193
Expressive power of typed and type-free programming languages
E. Fehr
Theoretical Computer Science
33
(2,3), 1984, pp. 195-238
On test sets for checking morphism equivalence on languages with fair distribution of letters
Y. Maon
,
A. Yehudai
Theoretical Computer Science
33
(2,3), 1984, pp. 239-260
Some undecidability results for non-monadic Church-Rosser Thue systems
F. Otto
Theoretical Computer Science
33
(2,3), 1984, pp. 261-278
Denotational semantics of CSP
N. Soundararajan
Theoretical Computer Science
33
(2,3), 1984, pp. 279-304
Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is
\Sigma_2^P
-complete
Dung T. Huynh
Theoretical Computer Science
33
(2,3), 1984, pp. 305-326
The equations
h(w) = w^n
in binary alphabets
T. Harju
,
M. Linna
Theoretical Computer Science
33
(2,3), 1984, pp. 327-329
Sur les monoïdes à un relateur qui sont des groupes
D. Perrin
,
P. Schupp
Theoretical Computer Science
33
(2,3), 1984, pp. 331-334
Bilimites de langages reconnaissables
D. Girault-Beauquier
Theoretical Computer Science
33
(2,3), 1984, pp. 335-342