Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Kasprzik, Anna
Kötzing, Timo

dblp
dblp

Not MPG Author(s):

Kasprzik, Anna

Editor(s):

Martin-Vide, Carlos
Fernau, Henning
Dediu, Adrian Horia

dblp
dblp
dblp

Not MPII Editor(s):

Martin-Vide, Carlos
Fernau, Henning
Dediu, Adrian Horia

BibTeX cite key*:

Koetzing2010LatticeLearning

Title, Booktitle

Title*:

String Extension Learning Using Lattices

Booktitle*:

Language and Automata Theory and Applications : 4th International Conference, LATA 2010

Event, URLs

URL of the conference:

http://grammars.grlmc.com/LATA2010

URL for downloading the paper:

http://dx.doi.org/10.1007/978-3-642-13089-2_32

Event Address*:

Trier, Germany

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

24 May 2010

Event End Date:

28 May 2010

Publisher

Name*:

Springer

URL:


Address*:

Berlin

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

6031

Number:


Month:


Pages:

380-391

Year*:

2010

VG Wort Pages:


ISBN/ISSN:

978-3-642-13088-5

Sequence Number:


DOI:

10.1007/978-3-642-13089-2_32



Note, Abstract, ©


(LaTeX) Abstract:

The class of regular languages is not identifiable from positive data in Gold's language learning model.
Many attempts have been made to define interesting classes that \emph{are} learnable in this model, preferably with the associated learner having certain advantageous properties. Heinz '09 presents a set of language classes called \emph{String Extension (Learning) Classes}, and shows it to have several desirable properties.

In the present paper, we extend the notion of String Extension Classes by basing it on \emph{lattices} and formally establish further useful properties resulting from this extension. Using lattices enables us to cover a larger range of language classes including the \emph{pattern languages}, as well as to give various ways of \emph{characterizing} String Extension Classes and its learners. We believe this paper to show that String Extension Classes are learnable in a \emph{very natural way}, and thus worthy of further study.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Koetzing2010LatticeLearning,
AUTHOR = {Kasprzik, Anna and K{\"o}tzing, Timo},
EDITOR = {Martin-Vide, Carlos and Fernau, Henning and Dediu, Adrian Horia},
TITLE = {String Extension Learning Using Lattices},
BOOKTITLE = {Language and Automata Theory and Applications : 4th International Conference, LATA 2010},
PUBLISHER = {Springer},
YEAR = {2010},
VOLUME = {6031},
PAGES = {380--391},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Trier, Germany},
ISBN = {978-3-642-13088-5},
DOI = {10.1007/978-3-642-13089-2_32},
}


Entry last modified by Anja Becker, 01/10/2011
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
12/13/2010 03:46:23 PM
Revision
1.
0.


Editor
Anja Becker
Timo Kötzing


Edit Date
10.01.2011 13:53:20
12/13/2010 03:46:23 PM


Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section