Learning analysis by reduction from positive data
| dc.date.accessioned | 2006-04-05T13:55:30Z | |
| dc.date.available | 2006-04-05T13:55:30Z | |
| dc.date.issued | 2005 | |
| dc.format.extent | 142852 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | urn:nbn:de:hebis:34-200604059068 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/200604059068 | |
| dc.language.iso | eng | |
| dc.publisher | Universität Kassel, FB 17, Mathematik/Informatik | eng |
| dc.rights | Urheberrechtlich geschützt | |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | |
| dc.subject | Theoretische Informatik | eng |
| dc.subject | Reduktionssystem | eng |
| dc.subject | Learning | eng |
| dc.subject | Restarting | eng |
| dc.subject | Automata | eng |
| dc.subject.ddc | 004 | |
| dc.title | Learning analysis by reduction from positive data | eng |
| dc.type | Preprint | |
| dcterms.abstract | Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. It can be modelled by restarting automata. In this paper we propose a method for learning restarting automata which are strictly locally testable (SLT-R-automata). The method is based on the concept of identification in the limit from positive examples only. Also we characterize the class of languages accepted by SLT-R-automata with respect to the Chomsky hierarchy. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Mráz, František | |
| dcterms.creator | Otto, Friedrich | |
| dcterms.creator | Plátek, Martin | |
| dcterms.isPartOf | Mathematische Schriften Kassel | eng |
| dcterms.isPartOf | 05, 07 | eng |
| dcterms.source.journal | Mathematische Schriften Kassel | |
| dcterms.source.volume | 05, 07 |