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=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recurrent words and simultaneous growth in TOL systems
K.-J. Lange
,
E. Welzl
Theoretical Computer Science
35
(1), 1985, pp. 1-15
Characterizations of some classes of regular events
J. Stern
Theoretical Computer Science
35
(1), 1985, pp. 17-42
A logical characterization of observation equivalence
S.L. Bloom
,
D.R. Troeger
Theoretical Computer Science
35
(1), 1985, pp. 43-53
Finding transversals for sets of simple geometric figures
H. Edelsbrunner
Theoretical Computer Science
35
(1), 1985, pp. 55-69
Calcul de longueurs de chaînes de réécriture dans le monoïde libre
Y. Métivier
Theoretical Computer Science
35
(1), 1985, pp. 71-87
Axiomatisation des tests
C. Benoit
Theoretical Computer Science
35
(1), 1985, pp. 89-107
An
O({|T|}^3)
algorithm for testing the Church-Rosser property of Thue systems
D. Kapur
,
M.S. Krishnamoorthy
,
R. McNaughton
,
P. Narendran
Theoretical Computer Science
35
(1), 1985, pp. 109-114
Automates boustrophédon et mots infinis
J.-P. Pécuchet
Theoretical Computer Science
35
(1), 1985, pp. 115-122
A superposition oriented theorem prover
L. Fribourg
Theoretical Computer Science
35
(2,3), 1985, pp. 129-164
On the existence of acyclic views in a database scheme
G. Ausiello
,
A. d'Atri
,
M. Moscarini
Theoretical Computer Science
35
(2,3), 1985, pp. 165-177
Recognizable subsets of some partially abelian monoids
R. Cori
,
Y. Métivier
Theoretical Computer Science
35
(2,3), 1985, pp. 179-189
An introduction to FIFO nets -- monogeneous nets: A subclass of FIFO nets
G. Memmi
,
A. Finkel
Theoretical Computer Science
35
(2,3), 1985, pp. 191-214
On proving time constructibility of functions
K. Kobayashi
Theoretical Computer Science
35
(2,3), 1985, pp. 215-225
Complexity results on the conjugacy problem for monoids
P. Narendran
,
F. Otto
Theoretical Computer Science
35
(2,3), 1985, pp. 227-243
Complete divisibility problems for slowly utilized oracles
D.A. Plaisted
Theoretical Computer Science
35
(2,3), 1985, pp. 245-260
A homomorphic characterization of recursively enumerable languages
S. Hirose
,
S. Okawa
,
M. Yoneda
Theoretical Computer Science
35
(2,3), 1985, pp. 261-269
Une application de la representation matricielle des transductions
J.-E. Pin
,
J. Sakarovitch
Theoretical Computer Science
35
(2,3), 1985, pp. 271-293
Code properties and homomorphisms of DOL systems
T. Head
,
J. Wilkinson
Theoretical Computer Science
35
(2,3), 1985, pp. 295-312
On classes of tractable unrestricted regular expressions
E. Leiss
Theoretical Computer Science
35
(2,3), 1985, pp. 313-327
On the data type extension problem for algebraic specifications
M. Oyamaguchi
Theoretical Computer Science
35
(2,3), 1985, pp. 329-336
A finite Thue system with decidable word problem and without equivalent finite canonical system
D. Kapur
,
P. Narendran
Theoretical Computer Science
35
(2,3), 1985, pp. 337-344
A simple proof for the completeness of Floyd's method
I. Sain
Theoretical Computer Science
35
(2,3), 1985, pp. 345-348