#### Filter Results:

- Full text PDF available (52)

#### Publication Year

1976

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Organism

Learn More

- Steffen Lange, Rolf Wiehagen
- New Generation Computing
- 1991

A pattern is a finite string of constants and variables (cf. [1]). The language of a pattern is the set of all strings which can be obtained by substituting non-null strings of constants for theâ€¦ (More)

- Steffen Lange, Thomas Zeugmann
- J. Comput. Syst. Sci.
- 1996

The present paper deals with a systematic study of incremental learning algorithms. The general scenario is as follows. Let c be any concept; then every innnite sequence of elements exhausting c isâ€¦ (More)

- Thomas Zeugmann, Steffen Lange
- GOSLER Final Report
- 1995

The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider the in uence ofâ€¦ (More)

- Steffen Lange, Thomas Zeugmann
- COLT
- 1993

We study the learnability of indexed families 4 = (Lj )jEFJ of uniformly recursive languages under certain monotonicity constraints. Thereby we distinguish between ezact learnability (L has to beâ€¦ (More)

- Steffen Lange, Rolf Wiehagen
- ALT
- 1990

- Steffen Lange, Thomas Zeugmann
- Mathematical systems theory
- 1994

This paper studies the impact of order independence to the learnability of indexed families $$\mathcal{L}$$ of uniformly recursive languages from positive data. In particular, we considerset-drivenâ€¦ (More)

- Sandra Zilles, Steffen Lange, Robert C. Holte, Martin Zinkevich
- Journal of Machine Learning Research
- 2011

While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooperative teacher thatâ€¦ (More)

- Steffen Lange, Thomas Zeugmann
- Nonmonotonic and Inductive Logic
- 1991

In the present paper strong{monotonic, monotonic and weak{monotonic reasoning is studied in the context of algorithmic language learning theory from positive as well as from positive and negativeâ€¦ (More)

- Steffen Lange, Rolf Wiehagen, Thomas Zeugmann
- ALT
- 1996

Learning by erasing means the process of eliminating potential hypotheses from further consideration thereby converging to the least hypothesis never eliminated and this one must be a solution to theâ€¦ (More)

- Steffen Lange, Thomas Zeugmann, Shyam Kapur
- Theor. Comput. Sci.
- 1996

Monotonic and dual monotonic language learning from positive as well as from positive and negative examples is investigated. Three different notions of monotonicity are considered. Each of themâ€¦ (More)