Show simple item record

dc.contributor.authorBalcázar Navarro, José Luis
dc.contributor.authorDíaz Iriberri, José
dc.contributor.authorGavaldà Mestre, Ricard
dc.contributor.authorWatanabe, O.
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationBalcázar Navarro, José Luis [et al.]. "An optimal parallel algorithm for learning DFA". Barcelona: Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1993.
dc.descriptionPreliminary version in Proc. COLT'94.
dc.description.abstractIn 1987, D. Angluin presented an algorithm that exactly learns regular languages represented by deterministic finite automata (dfa) from Membership and Equivalence queries. Furthermore, the algorithm is feasible in the sense that it takes time O(n^2m^2), where n is the number of states of the automaton and m is the length of the longest counterexample to an Equivalence query. This paper studies whether parallelism can lead to substantially more efficient algorithms for the problem. We show that no CRCW PRAM machine using a number of processors polynomial in n and m can identify dfa in o(n/log n) time. Furthermore, this lower bound is tight: we develop a CRCW PRAM learning algorithm that uses polynomially many processors and exactly learns dfa in O(n/log n) time.
dc.format.extent19 p.
dc.publisherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherEquivalence queries
dc.titleAn optimal parallel algorithm for learning DFA
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder