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=44
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A fast numerical algorithm for the composition of power series with complex coefficients
P. Ritzmann
Theoretical Computer Science
44
(1), 1986, pp. 1-16
Coded systems
F. Blanchard
,
G. Hansel
Theoretical Computer Science
44
(1), 1986, pp. 17-49
Typing and computational properties of lambda expressions
D. Leivant
Theoretical Computer Science
44
(1), 1986, pp. 51-68
Boundedness, empty channel detection, and synchronization for communicating finite automata
L.E. Rosier
,
H.-C. Yen
Theoretical Computer Science
44
(1), 1986, pp. 69-105
Dense orbit points of certain languages of infinite words
F. Blanchard
,
S. Martinez
Theoretical Computer Science
44
(1), 1986, pp. 107-110
On pebble automata
J.H. Chang
,
O.H. Ibarra
,
M.A. Palis
,
B. Ravikumar
Theoretical Computer Science
44
(1), 1986, pp. 111-121
On solving the equality problem in theories defined by Horn clauses
E. Paul
Theoretical Computer Science
44
(2), 1986, pp. 127-153
Generalized language equations with multiple solutions
E.L. Leiss
Theoretical Computer Science
44
(2), 1986, pp. 155-174
Repetition-free words
Y. Kobayashi
Theoretical Computer Science
44
(2), 1986, pp. 175-197
Complete semi-Thue systems for Abelian groups
V. Diekert
Theoretical Computer Science
44
(2), 1986, pp. 199-208
An algorithm for generating shift-register cycles
T. Etzion
Theoretical Computer Science
44
(2), 1986, pp. 209-224
On the impossibility of the homomorphic characterization of context-sensitive languages
S. Okawa
,
S. Hirose
,
M. Yoneda
Theoretical Computer Science
44
(2), 1986, pp. 225-228
On Greibach normal form construction
F.J. Urbanek
Theoretical Computer Science
44
(2), 1986, pp. 229-236
On the equivalence problem for regular Thue systems
P. Narendran
Theoretical Computer Science
44
(2), 1986, pp. 237-245
The complexity of central slice functions
P.E. Dunne
Theoretical Computer Science
44
(3), 1986, pp. 247-257
The greatest fixed-points and rational
\omega
-tree languages
M. Takahashi
Theoretical Computer Science
44
(3), 1986, pp. 259-274
Net processes correspond to derivation processes in graph grammars
H.-J. Kreowski
,
A. Wilharm
Theoretical Computer Science
44
(3), 1986, pp. 275-305
Continuation semantics for flowgraph equations
W.F. Dowling
,
J.H. Gallier
Theoretical Computer Science
44
(3), 1986, pp. 307-331
The Ehrenfeucht conjecture: an algebra-framework for its proof
E.T. Poulsen
Theoretical Computer Science
44
(3), 1986, pp. 333-339