DECHIFFRIERUNG VON ND-AUTOMATEN. = DECHIFFRAGE D'AUTOMATES NON DETERMINISTESWIEHAGEN R.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 1-2; PP. 39-60; ABS. ANGL. RUSSE; BIBL. 7 REF.Article

CHARACTERIZATION PROBLEMS IN THE THEORY OF INDUCTIVE INFERENCE.WIEHAGEN R.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 494-508; BIBL. 2 P.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

REKURSIONTHEORETISCHE CHARAKTERISIERUNG VON ERKENNBAREN KLASSEN REKURSIVER FUNKTIONEN. = CARACTERISATION RECURSIVE DE CLASSES RECONNAISSABLES DE FONCTIONS RECURSIVESWIEHAGEN R; JUNG H.1977; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1977; VOL. 13; NO 7-8; PP. 385-397; ABS. ANGL. RUSSE.; BIBL. 11 REF.Article

CHARAKTERISTISCHE EIGENSCHAFTEN VON ERKENNBAREN KLASSEN REKURSIVER FUNKTIONEN. = PROPRIETES CARACTERISTIQUES DE CLASSES RECONNAISSABLES DE FONCTIONS RECURSIVESWIEHAGEN R; LIEPE W.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 8-9; PP. 421-438; ABS. ANGL. RUSSE; BIBL. 8 REF.Article

RESEARCH IN THE THEORY OF INDUCTIVE INFERENCE BY GDR MATHEMATICIANS. A SURVEYKLETTE R; WIEHAGEN R.1980; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1980; VOL. 22; NO 2; PP. 149-169; BIBL. 79 REF.Article

INDUCTIVE INTERFERENCE WITH ADDITIONAL INFORMATIONFREIVALD RV; WIEHAGEN R.1979; ELEKTRON. INFORM.-VERARBEIT-KYBERN.; DDR; DA. 1979; VOL. 15; NO 4; PP. 179-185; ABS. RUS/GER; BIBL. 12 REF.Article

From inductive inference to algorithmic learning theoryWIEHAGEN, R.New generation computing. 1994, Vol 12, Num 4, pp 321-335, issn 0288-3635Conference Paper

On the power of probabilistic strategies in inductive inferenceWIEHAGEN, R; FREIVALDS, R; KINBER, E. B et al.Theoretical computer science. 1984, Vol 28, Num 1-2, pp 111-133, issn 0304-3975Article

On the power of inductive inference from good examplesFREIVALDS, R; KINBER, E. B; WIEHAGEN, R et al.Theoretical computer science. 1993, Vol 110, Num 1, pp 131-144, issn 0304-3975Article

Aspects of complexity of probabilistic learning under monotonicity constraintsMEYER, Léa.Theoretical computer science. 2001, Vol 268, Num 2, pp 275-322, issn 0304-3975Conference Paper

Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductionsFISCHLIN, Marc.Theoretical computer science. 2001, Vol 268, Num 2, pp 199-219, issn 0304-3975Conference Paper

Algorithmic Learning TheoryWIEHAGEN, R; ZEUGMANN, T.Theoretical computer science. 2001, Vol 268, Num 2, issn 0304-3975, 221 p.Conference Proceedings

How inductive inference strategies discover their errorsFREIVALDS, R; KINBER, E. B; WIEHAGEN, R et al.Information and computation (Print). 1995, Vol 118, Num 2, pp 208-226, issn 0890-5401Article

Learning algebraic structures from textSTEPHAN, Frank; VENTSOV, Yuri.Theoretical computer science. 2001, Vol 268, Num 2, pp 221-273, issn 0304-3975Conference Paper

Learning languages and functions by erasingJAIN, S; KINBER, E; LANGE, S et al.Theoretical computer science. 2000, Vol 241, Num 1-2, pp 143-189, issn 0304-3975Article

Closedness properties in ex-identificationAPSITIS, Kalvis; FREIVALDS, Rusins; SIMANOVSKIS, Raimonds et al.Theoretical computer science. 2001, Vol 268, Num 2, pp 367-393, issn 0304-3975Conference Paper

Polynomial-time leamability of logic programs with local variables from entailmentKRISHNA RAO, M. R. K; SATTAR, A.Theoretical computer science. 2001, Vol 268, Num 2, pp 179-198, issn 0304-3975Conference Paper

Editors' introductionRICHTER, M. M; SMITH, C. H; WIEHAGEN, R et al.Lecture notes in computer science. 1998, pp 1-10, issn 0302-9743, isbn 3-540-63577-7Conference Paper

Predictive learning models for concept driftCASE, John; JAIN, Sanjay; KAUFMANN, Susanne et al.Theoretical computer science. 2001, Vol 268, Num 2, pp 323-349, issn 0304-3975Conference Paper