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=65
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Modal resolution in clausal form
Patrice Enjalbert
,
Luis Farinas del Cerro
Theoretical Computer Science
65
, 1989, pp. 1-33
The power of temporal proofs
Martin Abadi
Theoretical Computer Science
65
, 1989, pp. 35-83
Full abstraction and limiting completeness in equational languages
Satish R. Thatte
Theoretical Computer Science
65
, 1989, pp. 85-119
On a sequence of rational functions
Jean-Paul Allouche
Theoretical Computer Science
65
, 1989, pp. 123-130
\beta
-expansions and symbolic dynamics
F. Blanchard
Theoretical Computer Science
65
, 1989, pp. 131-141
On a possible classification of real-time constructed sequences
Noelle Bleuzen-Guernalec
Theoretical Computer Science
65
, 1989, pp. 143-148
On the probability of occurrence of labelled subtrees of a randomly labelled tree
F.M. Dekking
Theoretical Computer Science
65
, 1989, pp. 149-152
Systèmes de numération et fonctions fractales relatifs aux substitutions
Jean-Marie Dumont
,
Alain Thomas
Theoretical Computer Science
65
, 1989, pp. 153-169
Rational probability measures
G. Hansel
,
D. Perrin
Theoretical Computer Science
65
, 1989, pp. 171-188
On Weyl sums and Skew products over irrational rotations
P. Hellekalek
,
G. Larcher
Theoretical Computer Science
65
, 1989, pp. 189-196
Statistic and ergodic properties of Minkowski's diagonal continued fraction
Cor Kraaikamp
Theoretical Computer Science
65
, 1989, pp. 197-212
From geometry to Euler identities
M. Mendes France
,
A.J. Van der Poorten
Theoretical Computer Science
65
, 1989, pp. 213-220
Infinite words with linear subword complexity
Filippo Mignosi
Theoretical Computer Science
65
, 1989, pp. 221-242
On the Fredholm determinant of a piecewise linear transformation
Makoto Mori
Theoretical Computer Science
65
, 1989, pp. 243-248
q
-adic spectral analysis of some arithmetic sequences
Brigitte Mosse
Theoretical Computer Science
65
, 1989, pp. 249-263
Finitely generated sofic systems
Antonio Restivo
Theoretical Computer Science
65
, 1989, pp. 265-270
Church-Rosser theorem for a rewriting system on categorical combinators
Hirofumi Yokouchi
Theoretical Computer Science
65
, 1989, pp. 271-290
Confluence results for the pure strong categorical logic CCL.
\lambda
-calculi as subsystems of CCL
Thérèse Hardin
Theoretical Computer Science
65
, 1989, pp. 291-342
A sound and complete semantics for a version of negation as failure
J.C. Shepherdson
Theoretical Computer Science
65
, 1989, pp. 343-371