- -

A sufficient condition to polynomially compute a minimum separating DFA

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

A sufficient condition to polynomially compute a minimum separating DFA

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: MinSepDFA.pdf
Tamaño: 331.0Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir
[Cerrado]
Nombre: definitivo INS.pdf
Tamaño: 1.290Mb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Vázquez-De-Parga Andrade, Manuel es_ES
dc.contributor.author García Gómez, Pedro es_ES
dc.contributor.author López Rodríguez, Damián es_ES
dc.date.accessioned 2017-05-31T11:21:08Z
dc.date.available 2017-05-31T11:21:08Z
dc.date.issued 2016-11-20
dc.identifier.issn 0020-0255
dc.identifier.uri http://hdl.handle.net/10251/82093
dc.description This is the author’s version of a work that was accepted for publication in Information Sciences. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Information Sciences 370–371 (2016) 204–220. DOI 10.1016/j.ins.2016.07.053. es_ES
dc.description.abstract The computation of a minimal separating automaton (MSA) for regular languages has been studied from many different points of view, from synthesis of automata or Grammatical Inference to the minimization of incompletely specified machines or Compositional Verification. In the general case, the problem is NP-complete, but this drawback does not prevent the problem from having a real application in the above-mentioned fields. In this paper, we propose a sufficient condition that guarantees that the computation of the MSA can be carried out with polynomial time complexity. © 2016 Elsevier Inc. All rights reserved. es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof Information Sciences es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Minimal separating DFA es_ES
dc.subject Minimal consistent DFA es_ES
dc.subject Model checking es_ES
dc.subject Minimization of incompletely specified automata es_ES
dc.subject.classification LENGUAJES Y SISTEMAS INFORMATICOS es_ES
dc.title A sufficient condition to polynomially compute a minimum separating DFA es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.ins.2016.07.053
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Escola Tècnica Superior d'Enginyeria Informàtica es_ES
dc.description.bibliographicCitation Vázquez-De-Parga Andrade, M.; García Gómez, P.; López Rodríguez, D. (2016). A sufficient condition to polynomially compute a minimum separating DFA. Information Sciences. 370-371:204-220. doi:10.1016/j.ins.2016.07.053 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1016/j.ins.2016.07.053 es_ES
dc.description.upvformatpinicio 204 es_ES
dc.description.upvformatpfin 220 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 370-371 es_ES
dc.relation.senia 316405 es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem