The following pages link to E. B. Kinber (Q760794):
Displaying 50 items.
- (Q329604) (redirect page) (← links)
- Parallel learning of automatic classes of languages (Q329605) (← links)
- Mind change speed-up for learning languages from positive data (Q388110) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Learning all subfunctions of a function (Q596299) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Frequency computation and bounded queries (Q671360) (← links)
- On the power of probabilistic strategies in inductive inference (Q760795) (← links)
- A class of multitape automata with a decidable equivalence problem (Q794436) (← links)
- One-sided error probabilistic inductive inference and reliable frequency identification (Q803119) (← links)
- Learning and extending sublanguages (Q924178) (← links)
- Learning languages from positive data and negative counterexamples (Q927865) (← links)
- One-shot learners using negative counterexamples and nearest positive examples (Q1029327) (← links)
- The inclusion problem for some classes of deterministic multitape automata (Q1056540) (← links)
- Three-way automata on rectangular types over a one-letter alphabet (Q1075759) (← links)
- On inclusion problem for deterministic multitape automata (Q1146516) (← links)
- On complete sets of samples for generalized regular expressions (Q1183590) (← links)
- On the power of inductive inference from good examples (Q1210543) (← links)
- On frequency-enumerable sets (Q1222649) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- Learning recursive functions from approximations (Q1370868) (← links)
- On the intrinsic complexity of learning recursive functions (Q1398370) (← links)
- (Q1575463) (redirect page) (← links)
- Learning languages and functions by erasing (Q1575464) (← links)
- Language learning from texts: Degrees of intrinsic complexity and their characterizations (Q1604194) (← links)
- Generalized regular expressions - a language for synthesis of programs with branching in loops (Q1822523) (← links)
- Inductive syntactic synthesis of programs with FOR loops and interpreted functions (Q1822935) (← links)
- On learning of functions refutably. (Q1874231) (← links)
- Intrinsic complexity of learning geometrical concepts from positive data (Q1877693) (← links)
- On learning multiple concepts in parallel (Q1892204) (← links)
- How inductive inference strategies discover their errors (Q1892886) (← links)
- Language learning from texts: Mindchanges, limited memory and monotonicity (Q1908348) (← links)
- Automatic learning from positive data and negative counterexamples (Q2013555) (← links)
- On separation of the emptiness and equivalence problems for program schemes (Q2265797) (← links)
- Intrinsic complexity of partial learning (Q2419119) (← links)
- Iterative learning from positive data and negative counterexamples (Q2464142) (← links)
- Learning multiple languages in groups (Q2465037) (← links)
- Learning languages from positive data and a limited number of short counterexamples (Q2465639) (← links)
- Learning languages from positive data and a finite number of queries (Q2490120) (← links)
- Variations on U-shaped learning (Q2500523) (← links)
- On the intrinsic complexity of learning (Q2508338) (← links)
- Intrinsic Complexity of Partial Learning (Q2830275) (← links)
- Mind Change Speed-up for Learning Languages from Positive Data (Q2904775) (← links)
- Parallel Learning of Automatic Classes of Languages (Q2938724) (← links)
- Learning from Positive Data and Negative Counterexamples: A Survey (Q2944899) (← links)
- (Q3050411) (← links)
- (Q3142563) (← links)
- (Q3148805) (← links)
- Automatic Learning from Positive Data and Negative Counterexamples (Q3164811) (← links)
- Inductive Inference and Computable One‐One Numberings (Q3328535) (← links)
