Left/right deterministic linear languages identification

Please use this identifier to cite or link to this item: http://hdl.handle.net/10045/8629
Full metadata record
Full metadata record
DC FieldValueLanguage
dc.contributorReconocimiento de Formas e Inteligencia Artificialen
dc.contributor.authorCalera Rubio, Jorge-
dc.contributor.authorOncina Carratalá, Jose-
dc.contributor.otherUniversidad de Alicante. Departamento de Lenguajes y Sistemas Informáticosen
dc.identifier.citationCALERA RUBIO, Jorge; ONCINA CARRATALÁ, Jose. "Left/right deterministic linear languages identification". En: Pattern recognition: progress, directions and applications / edited by Filiberto Pla, Petia Radeva and Jordi Vitrià. Barcelona : Centre de Visió per Computador, Universitat Autònoma de Barcelona, 2006. ISBN 84-933652-6-2, pp. 313-326en
dc.description.abstractLeft deterministic linear languages are a subclass of context free languages that includes all regular languages. Recently was proposed an algorithm to identify in the limit with polynomial time and data such class of languages. It was also pointed that a symmetric class, right deterministic linear languages, is also identifiable in the limit from polynomial time and data. In this paper we show that the class of the Left-Right Deterministic Languages formed by the union of both classes is also identifiable. The resulting class is the largest one for which this type of results has been obtained so far. In this paper we introduce the notion of n-negative characteristic sample, that is a sample that forces an inference algorithm to output a hypothesis of size bigger than n when strings from a non identifiable language are provided.en
dc.description.sponsorshipWork partially supported by Spanish CICyT though project TIC2003-08496-C04 and by the IST Programme of the European Community, under the Pascal Network of Excellence, IST-2002-506778.en
dc.publisherUniversitat Autònoma de Barcelona. Centre de Visió per Computadoren
dc.subjectExample-based learningen
dc.subjectLearning context-free languagesen
dc.subject.otherLenguajes y Sistemas Informáticosen
dc.titleLeft/right deterministic linear languages identificationen
Appears in Collections:INV - GRFIA - Capítulos de Libros

Files in This Item:
Files in This Item:
File Description SizeFormat 
Thumbnail1_-_calera_oncina.pdf278,03 kBAdobe PDFOpen Preview

Items in RUA are protected by copyright, with all rights reserved, unless otherwise indicated.