dc.contributor.author | Lingg, Jonas | |
dc.contributor.author | De Oliveira Oliveira, Mateus | |
dc.contributor.author | Wolf, Petra Henrike Karola | |
dc.date.accessioned | 2024-03-19T09:51:39Z | |
dc.date.available | 2024-03-19T09:51:39Z | |
dc.date.created | 2023-09-07T10:52:16Z | |
dc.date.issued | 2024 | |
dc.identifier.issn | 0020-0190 | |
dc.identifier.uri | https://hdl.handle.net/11250/3123048 | |
dc.description.abstract | One of the most fundamental problems in computational learning theory is the problem of learning a finite automaton A consistent with a finite set P of positive examples and with a finite set N of negative examples. By consistency, we mean that A accepts all strings in P and rejects all strings in N. It is well known that this problem is NP-complete. In the literature, it is stated that NP-hardness holds even in the case of a binary alphabet. As a standard reference for this theorem, the work of Gold from 1978 is either cited or adapted. Nevertheless, the results in Gold's work are stated in terms of Mealy machines, and not in terms of deterministic finite automata (DFAs) as most commonly defined. As Mealy machines are equipped with an output function, they can be more compact than DFAs which accept the same language. We show that the adaptations of Gold's construction for Mealy machines stated in the literature have some issues, and provide a correct proof for the fact that the DFA-consistency problem for binary alphabets is NP-complete. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | Learning from positive and negative examples: New proof for binary alphabets | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright 2023 The Author(s) | en_US |
dc.source.articlenumber | 106427 | en_US |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |
dc.identifier.doi | 10.1016/j.ipl.2023.106427 | |
dc.identifier.cristin | 2173151 | |
dc.source.journal | Information Processing Letters | en_US |
dc.relation.project | Norges forskningsråd: 288761 | en_US |
dc.relation.project | Norges forskningsråd: 326537 | en_US |
dc.identifier.citation | Information Processing Letters. 2024, 183, 106427. | en_US |
dc.source.volume | 183 | en_US |