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=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Definability by programs in first-order structures
A.J. Kfoury
Theoretical Computer Science
25
(1), 1983, pp. 1-66
Iterative algebras
E. Nelson
Theoretical Computer Science
25
(1), 1983, pp. 67-94
Fundamental properties of infinite trees
B. Courcelle
Theoretical Computer Science
25
(2), 1983, pp. 95-169
Infinite regular Thue systems
C. O'DĂșnlaing
Theoretical Computer Science
25
(2), 1983, pp. 171-192
Comparison of identification criteria for machine inductive inference
J. Case
,
C. Smith
Theoretical Computer Science
25
(2), 1983, pp. 193-220
Automata and concurrency
L. Priese
Theoretical Computer Science
25
(3), 1983, pp. 221-265
Calculi for synchrony and asynchrony
R. Milner
Theoretical Computer Science
25
(3), 1983, pp. 267-310
Infinite behaviour of Petri nets
R. Valk
Theoretical Computer Science
25
(3), 1983, pp. 311-341