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
[1]
Hilfe
Suche: Journal=Acta Inf. AND Volume=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Elementary transition systems and refinement
M. Nielsen
,
G. Rozenberg
,
P.S. Thiagarajan
Acta Informatica
29
, 1992, pp. 555-578
Naive asymptotics for hitting time bounds in Markov chains
Vernon Rego
Acta Informatica
29
, 1992, pp. 579-594
Two impossibility theorems on behaviour specification of abstract data types
Oliver Schoett
Acta Informatica
29
, 1992, pp. 595-621
Classes of systolic Y-tree automata and a comparison with systolic trellis automata
E. Fachini
,
A. Maggiolo-Schettini
,
D. Sangiorgi
Acta Informatica
29
, 1992, pp. 623-643
Expressibility of ouptut equals input. Negative and positive results
Leo Marcus
,
Telis Menas
Acta Informatica
29
, 1992, pp. 645-662
On the lengths of values in a finite transducer
Andreas Weber
Acta Informatica
29
, 1992, pp. 663-687
Toward formal development of programs from algebraic specifications: parameterisation revisited
Donald Sannella
,
Stefan SokoĈowski
,
Andrzej Tarlecki
Acta Informatica
29
, 1992, pp. 689-736
An efficiency preorder for processes
S. Arun-Kumar
,
M. Hennessy
Acta Informatica
29
, 1992, pp. 737-760
Languages accepted by systolic Y-tree automata: structural characterizations
E. Fachini
,
A. Monti
,
M. Napoli
,
D. Parente
Acta Informatica
29
, 1992, pp. 761-778
A class of coders based on gsm
Adrian Atanasiu
Acta Informatica
29
, 1992, pp. 779-791
Seiten
<
1
2