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: Author="Kinber, E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the power of inductive inference from good examples
R. Freivalds
,
E.B. Kinber
,
R. Wiehagen
Theoretical Computer Science
110
, 1993, pp. 131-144
On complete sets of samples for generalized regular expressions
E.B. Kinber
Theoretical Computer Science
91
, 1991, pp. 101-117
Monte-Carlo inference and its relations to reliable frequency identification
E. Kinber
,
T. Zeugmann
Lecture Notes in Computer Science
380
, 1989, pp. 257-266
Inductive syntactical synthesis of programs from sample computations
E.B. Kinber
Lecture Notes in Computer Science
324
, 1988, pp. 73-84
Generalized regular expressions-a language for synthesis of programs with branching in loops
A. Brazma
,
E. Kinber
Theoretical Computer Science
46
(2-3), 1986, pp. 175-195
On separation of the emptiness and equivalence problems for program schemes
A.J. Auzins
,
E.B. Kinber
Information Processing Letters
20
(2), 1985, February, pp. 91-93
On the power of probabilistic strategies in inductive inference
R. Wiehagen
,
R. Freivalds
,
E.B. Kinber
Theoretical Computer Science
28
(1,2), 1984, pp. 111-133
The inclusion problem for some classes of deterministic multitape automata
E.B. Kinber
Theoretical Computer Science
26
(1,2), 1983, pp. 1-24
On inclusion problem for deterministic multitape automata
E.B. Kinber
Information Processing Letters
11
(3), 1980, November, pp. 144-146