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=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A variant of random context grammars: semi-conditional grammars
G. Păun
Theoretical Computer Science
41
(1), 1985, pp. 1-17
Dynamics of positive automata networks
E. Goles
Theoretical Computer Science
41
(1), 1985, pp. 19-32
On context-free trees
V.E. Cazanescu
Theoretical Computer Science
41
(1), 1985, pp. 33-50
An algorithm to decide whether a rational subset of
N^k
is recognizable
P. Gohon
Theoretical Computer Science
41
(1), 1985, pp. 51-59
On the combinatorial of two-word codes
E. Barbin-Le Rest
,
M. Le Rest
Theoretical Computer Science
41
(1), 1985, pp. 61-80
Computing in general Abelian groups is hard
C.S. Iliopoulos
Theoretical Computer Science
41
(1), 1985, pp. 81-93
Adjunction of semifunctors: categorical structures in nonextensional Lambda calculus
S. Hayashi
Theoretical Computer Science
41
(1), 1985, pp. 95-104
On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
Y. Maon
Theoretical Computer Science
41
(1), 1985, pp. 105-107
Integrity of algebras of formal series on a partially commutative alphabet
J.-Y. Thibon
Theoretical Computer Science
41
(1), 1985, pp. 109-112
Possible forms of evaluation or reduction in Martin-Lof type theory
M.W. Bunder
Theoretical Computer Science
41
(1), 1985, pp. 113-120
A proof of Ehrenfeucht's conjecture
M.H. Albert
,
J. Lawrence
Theoretical Computer Science
41
(1), 1985, pp. 121-123
Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
B. Helfrich
Theoretical Computer Science
41
(2-3), 1985, pp. 125-139
Bandwidth constrained
NP
-complete problems
B. Monien
,
I.H. Sudborough
Theoretical Computer Science
41
(2-3), 1985, pp. 141-167
Concerning two-adjacent context-free languages
E. Dahlhaus
,
H. Gaifman
Theoretical Computer Science
41
(2-3), 1985, pp. 169-184
Petri nets with individual tokens
W. Reisig
Theoretical Computer Science
41
(2-3), 1985, pp. 185-213
A property of three-element codes
J. Karhumäki
Theoretical Computer Science
41
(2-3), 1985, pp. 215-222
A weaker sufficient condition for the equivalence of a pair of DPDAs to be decidable
E. Tomita
,
K. Seino
Theoretical Computer Science
41
(2-3), 1985, pp. 223-230
Fast parallel language recognition by cellular automata
O.H. Ibarra
,
M.A. Palis
,
S.M. Kim
Theoretical Computer Science
41
(2-3), 1985, pp. 231-246
On the complexity of theories of permutations
E. Pelz
Theoretical Computer Science
41
(2-3), 1985, pp. 247-269
Inferences for numerical dependencies
J. Grant
,
J. Minker
Theoretical Computer Science
41
(2-3), 1985, pp. 271-287
Complexity of the combinator reduction machine
S. Hirokawa
Theoretical Computer Science
41
(2-3), 1985, pp. 289-303
Alternating tree automata
G. Slutzki
Theoretical Computer Science
41
(2-3), 1985, pp. 305-318
The complexity of evaluating interpolation polynomials
H.-J. Stoss
Theoretical Computer Science
41
(2-3), 1985, pp. 319-323
Simulating probabilistic by deterministic algebraic computation trees
F. Meyer auf der Heide
Theoretical Computer Science
41
(2-3), 1985, pp. 325-330
Alternating on-line Turing machines with only universal states and small space bounds
K. Inoue
,
I. Takanami
,
R. Vollmar
Theoretical Computer Science
41
(2-3), 1985, pp. 331-339