The following pages link to Thomas Zeugmann (Q440005):
Displayed 32 items.
- (Q4282561) (← links)
- LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES (Q4286118) (← links)
- Characterization of language learning front informant under various monotonicity constraints (Q4290131) (← links)
- Ignoring data may be the only way to learn efficiently (Q4290134) (← links)
- Classifying Predicates and Languages (Q4341040) (← links)
- (Q4470529) (← links)
- (Q4470571) (← links)
- (Q4473234) (← links)
- (Q4473535) (← links)
- (Q4473560) (← links)
- (Q4505383) (← links)
- (Q4617615) (← links)
- (Q4703441) (← links)
- (Q4703851) (← links)
- (Q4703875) (← links)
- Set-driven and rearrangement-independent learning of recursive languages (Q4717054) (← links)
- (Q4739609) (← links)
- (Q4835903) (← links)
- (Q4844749) (← links)
- On the Size Complexity of Deterministic Frequency Automata (Q4910466) (← links)
- Recent Experiences in Parameter-Free Data Mining (Q4932738) (← links)
- (Q4937849) (← links)
- (Q4955318) (← links)
- (Q4967201) (← links)
- Teaching Randomized Learners (Q5307571) (← links)
- Algorithmic Learning Theory (Q5395058) (← links)
- Editors’ Introduction (Q5891268) (← links)
- Algorithmic Learning Theory (Q5897376) (← links)
- Algorithmic Learning Theory (Q5897390) (← links)
- Theory and Applications of Models of Computation (Q5898900) (← links)
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries (Q5941371) (← links)
- Stochastic finite learning of the pattern languages (Q5945682) (← links)