- -

DFA minimization: Double reversal versus split minimization algorithms

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

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

DFA minimization: Double reversal versus split minimization algorithms

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: tcs_submission.pdf
Tamaño: 207.7Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir
[Cerrado]
Nombre: GLV15.pdf
Tamaño: 306.7Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author García Gómez, Pedro es_ES
dc.contributor.author López Rodríguez, Damián es_ES
dc.contributor.author Vázquez-De-Parga Andrade, Manuel es_ES
dc.date.accessioned 2016-05-17T13:45:09Z
dc.date.available 2016-05-17T13:45:09Z
dc.date.issued 2015-06
dc.identifier.issn 0304-3975
dc.identifier.uri http://hdl.handle.net/10251/64262
dc.description “NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. 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 inTheoretical Computer Science, [Volume 583, 7 June 2015, Pages 78–85] DOI 10.1016/j.tcs.2015.04.002 es_ES
dc.description.abstract In this paper, we show the relationship between the two most widely used approaches for the minimization of deterministic finite automata: minimization by split of partitions and minimization by double reversal. Even though the double reversal approach has usually been considered to be unconventional with respect to the more common split approach, we show that any double reversal minimization algorithm can be related to a split minimization algorithm and vice versa. es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof Theoretical Computer Science es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject DFA minimization es_ES
dc.subject Atomic automaton es_ES
dc.subject Double reversal algorithms es_ES
dc.subject Split minimization algorithms es_ES
dc.subject.classification LENGUAJES Y SISTEMAS INFORMATICOS es_ES
dc.title DFA minimization: Double reversal versus split minimization algorithms es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.tcs.2015.04.002
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació es_ES
dc.description.bibliographicCitation García Gómez, P.; López Rodríguez, D.; Vázquez-De-Parga Andrade, M. (2015). DFA minimization: Double reversal versus split minimization algorithms. Theoretical Computer Science. 583:78-85. doi:10.1016/j.tcs.2015.04.002 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1016/j.tcs.2015.04.002 es_ES
dc.description.upvformatpinicio 78 es_ES
dc.description.upvformatpfin 85 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 583 es_ES
dc.relation.senia 309047 es_ES


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

Mostrar el registro sencillo del ítem