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=2
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On some subclasses of the class of generable languages
I. Meznik
Theoretical Computer Science
2
(1), 1976, pp. 1-7
Surface tree languages and parallel derivation trees
J. Engelfriet
Theoretical Computer Science
2
(1), 1976, pp. 9-27
Some uniformly erasable families of languages
S. Ginsburg
,
J. Goldstine
,
S. Greibach
Theoretical Computer Science
2
(1), 1976, pp. 29-44
Information-theoretic characterizations of recursive infinite strings
G.J. Chaitin
Theoretical Computer Science
2
(1), 1976, pp. 45-48
Deterministic Lindenmayer languages, nonterminals and homomorphisms
P.M.B. Vitányi
Theoretical Computer Science
2
(1), 1976, pp. 49-71
Minimal pairs of polynomial degrees with subexponential complexity
M. Machtey
Theoretical Computer Science
2
(1), 1976, pp. 73-76
The equality problem for vector addition systems is undecidable
M. Hack
Theoretical Computer Science
2
(1), 1976, pp. 77-95
An algebraic interpretation of the
\lambda\beta K
-calculus; and an application of a labelled
\lambda
-calculus
J.-J. Lévy
Theoretical Computer Science
2
(1), 1976, pp. 97-114
On the stability of some biological schemes with cellular interactions
G.T. Herman
,
A. Walker
Theoretical Computer Science
2
(1), 1976, pp. 115-130
Computability concepts for programming language semantics
H. Egli
,
R.L. Constable
Theoretical Computer Science
2
(2), 1976, pp. 133-145
Regularity-preserving relations
J.I. Seiferas
,
R. McNaughton
Theoretical Computer Science
2
(2), 1976, pp. 147-154
Least fixed points revisited
J.W. de Bakker
Theoretical Computer Science
2
(2), 1976, pp. 155-181
Correctness of parallel programs: The Church-Rosser approach
B.K. Rosen
Theoretical Computer Science
2
(2), 1976, pp. 183-207
Langages algébriques, paires itérantes et transductions rationnelles
L. Boasson
Theoretical Computer Science
2
(2), 1976, pp. 209-223
Relationship between classes of monotonic functions
M.B. Trakhtenbrot
Theoretical Computer Science
2
(2), 1976, pp. 225-247
Lower bounds for the size of expressions for certain functions in
d
-ary logic
B. Vilfan
Theoretical Computer Science
2
(2), 1976, pp. 249-269
Finite automata with multiplication
O.H. Ibarra
,
S.K. Sahni
,
C.E. Kim
Theoretical Computer Science
2
(3), 1976, pp. 271-294
On the pre-AFL of
[\log n]
space and related families of languages
F.N. Springsteel
Theoretical Computer Science
2
(3), 1976, pp. 295-304
A lower bound on the number of additions in monotone computations
C.P. Schnorr
Theoretical Computer Science
2
(3), 1976, pp. 305-315
Positive rational sequences
M. Soittola
Theoretical Computer Science
2
(3), 1976, pp. 317-322
Characterization of normal forms possessing inverse in the
\lambda-\beta-\eta
-calculus
M. Dezani-Ciancaglini
Theoretical Computer Science
2
(3), 1976, pp. 323-337
Computing an
st
-numbering
S. Even
,
R.E. Tarjan
Theoretical Computer Science
2
(3), 1976, pp. 339-344
Some natural properties of strong-identification in inductive inference
E. Minicozzi
Theoretical Computer Science
2
(3), 1976, pp. 345-360
The covering problem for linear context-free grammars
H.B. Hunt III
,
D.J. Rosenkrantz
,
T.G. Szymanski
Theoretical Computer Science
2
(3), 1976, pp. 361-382
Realizing Boolean functions on disjoint sets of variables
W.J. Paul
Theoretical Computer Science
2
(3), 1976, pp. 383-396
Seiten 1
2
>