Show simple item record

dc.date.accessioned2006-04-05T13:55:30Z
dc.date.available2006-04-05T13:55:30Z
dc.date.issued2005
dc.identifier.uriurn:nbn:de:hebis:34-200604059068
dc.identifier.urihttp://hdl.handle.net/123456789/200604059068
dc.format.extent142852 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherUniversität Kassel, FB 17, Mathematik/Informatikeng
dc.subjectTheoretische Informatikeng
dc.subjectReduktionssystemeng
dc.subjectLearningeng
dc.subjectRestartingeng
dc.subjectAutomataeng
dc.subject.ddc004
dc.titleLearning analysis by reduction from positive dataeng
dc.typePreprint
dcterms.abstractAnalysis 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.accessRightsopen access
dcterms.creatorMráz, František
dcterms.creatorOtto, Friedrich
dcterms.creatorPlátek, Martin
dcterms.isPartOfMathematische Schriften Kasseleng
dcterms.isPartOf05, 07eng


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record