#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2008

2016

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

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Jeffrey Heinz, Anna Kasprzik, Timo Kötzing
- Theor. Comput. Sci.
- 2012

We define a collection of language classes which are TxtEx-learnable (learnable in the limit from positive data). The learners map any data input to an element of a fixed lattice, and keep the least upper bound of all lattice elements thus obtained as the current hypothesis. Each element of the lattice is a grammar for a language, and the learner climbs the… (More)

- Anna Kasprzik
- FSMNLP
- 2008

We provide a new term-like representation for multi-dimensional trees as defined by Rogers [8,9] which establishes them as a direct generalization of classical trees. As a consequence these structures can be used as input for finite-state applications based on classical tree language theory. Via the correspondence between string and tree languages these… (More)

- Anna Kasprzik
- ICGI
- 2008

- Anna Kasprzik, Ryo Yoshinaka
- ALT
- 2011

- Anna Kasprzik
- DCFS
- 2009

We define a two-step learner for RFSAs based on an observation table by using an algorithm for minimal DFAs to build a table for the reversal of the language in question and showing that we can derive the minimal RFSA from it after some simple modifications. We compare the algorithm to two other table-based ones of which one (by Bollig et al. [8]) infers a… (More)

- Anna Kasprzik, Timo Kötzing
- LATA
- 2010

1 D imo uötzing 2 1 pf s ! eteilung snformtikD
niversität rierD SRPVT rierD qermny Abstract. he lss of regulr lnguges is not identi(le from posiE tive dt in qold9s lnguge lerning modelF wny ttempts hve een mde to de(ne interesting lsses tht are lernle in this modelD preferE ly with the ssoited lerner hving ertin… (More)

- Anna Kasprzik
- 2009

We present a learning algorithm for regular languages that unifies three existing ones for the settings of minimally adequate teacher learning, learning from membership queries and positive data, and learning from positive and negative data, respectively. We choose these three algorithms as an example to back up the conjecture that the learning process of… (More)

- Anna Kasprzik
- Developments in Language Theory
- 2011

- Anna Kasprzik
- LATA
- 2009

In this paper two methods of how to make derivation in a Tree Adjoining Grammar a regular process without loss of expressive power are presented and compared. In a TAG, derivation is based upon the expansion of tree nodes into other trees. One regularization method is based on an algebraic operation called Lifting, while the other exploits an additional… (More)

- Anna Kasprzik
- 2010

Four classical kinds of information sources that are consulted in formal language learning processes as studied in the area of Grammatical Inference are the following: Membership queries, equivalence queries, finite subsets of the target language (positive samples), and finite subsets of its complement (negative samples). One of the language classes that… (More)