DFA minimization: from Brzozowski to Hopcroft

Minimization of automata is a classic problem in Computer Sci- ence which is still studied nowadays. In this paper, we first propose a polynomial minimization method directly derived from Brzozowski¿s algorithm, and second, we show how the consideration of some effi- ciency improvements on this algo...

ver descrição completa

Detalhes bibliográficos
Autores: García Gómez, Pedro, López Rodríguez, Damián|||0000-0003-3633-3862, Vázquez-de-Parga Andrade, Manuel
Formato: informe técnico
Fecha de publicación:2013
País:España
Recursos:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/27623
Acesso em linha:https://riunet.upv.es/handle/10251/27623
Access Level:acceso abierto
Palavra-chave:DFA minimization
Brzozowski algorithm
Hopcroft algorithm
LENGUAJES Y SISTEMAS INFORMATICOS
id ES_4c6e059dfb71ea64309dc90ac6552e0f
oai_identifier_str oai:riunet.upv.es:10251/27623
network_acronym_str ES
network_name_str España
repository_id_str
spelling DFA minimization: from Brzozowski to HopcroftGarcía Gómez, PedroLópez Rodríguez, Damián|||0000-0003-3633-3862Vázquez-de-Parga Andrade, ManuelDFA minimizationBrzozowski algorithmHopcroft algorithmLENGUAJES Y SISTEMAS INFORMATICOSMinimization of automata is a classic problem in Computer Sci- ence which is still studied nowadays. In this paper, we first propose a polynomial minimization method directly derived from Brzozowski¿s algorithm, and second, we show how the consideration of some effi- ciency improvements on this algorithm lead to obtain an algorithm equivalent to Hopcroft¿s.Universitat Politècnica de ValènciaDepartamento de Sistemas Informáticos y ComputaciónEscuela Técnica Superior de Ingeniería InformáticaInstituto Universitario Valenciano de Investigación en Inteligencia ArtificialRepositorio Institucional de la Universitat Politècnica de València Riunet20132013-03-14reporthttp://purl.org/coar/resource_type/c_93fcinfo:eu-repo/semantics/reportapplication/pdfhttps://riunet.upv.es/handle/10251/27623reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/276232026-06-13T07:49:27Z
dc.title.none.fl_str_mv DFA minimization: from Brzozowski to Hopcroft
title DFA minimization: from Brzozowski to Hopcroft
spellingShingle DFA minimization: from Brzozowski to Hopcroft
García Gómez, Pedro
DFA minimization
Brzozowski algorithm
Hopcroft algorithm
LENGUAJES Y SISTEMAS INFORMATICOS
title_short DFA minimization: from Brzozowski to Hopcroft
title_full DFA minimization: from Brzozowski to Hopcroft
title_fullStr DFA minimization: from Brzozowski to Hopcroft
title_full_unstemmed DFA minimization: from Brzozowski to Hopcroft
title_sort DFA minimization: from Brzozowski to Hopcroft
dc.creator.none.fl_str_mv García Gómez, Pedro
López Rodríguez, Damián|||0000-0003-3633-3862
Vázquez-de-Parga Andrade, Manuel
author García Gómez, Pedro
author_facet García Gómez, Pedro
López Rodríguez, Damián|||0000-0003-3633-3862
Vázquez-de-Parga Andrade, Manuel
author_role author
author2 López Rodríguez, Damián|||0000-0003-3633-3862
Vázquez-de-Parga Andrade, Manuel
author2_role author
author
dc.contributor.none.fl_str_mv Departamento de Sistemas Informáticos y Computación
Escuela Técnica Superior de Ingeniería Informática
Instituto Universitario Valenciano de Investigación en Inteligencia Artificial
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv DFA minimization
Brzozowski algorithm
Hopcroft algorithm
LENGUAJES Y SISTEMAS INFORMATICOS
topic DFA minimization
Brzozowski algorithm
Hopcroft algorithm
LENGUAJES Y SISTEMAS INFORMATICOS
description Minimization of automata is a classic problem in Computer Sci- ence which is still studied nowadays. In this paper, we first propose a polynomial minimization method directly derived from Brzozowski¿s algorithm, and second, we show how the consideration of some effi- ciency improvements on this algorithm lead to obtain an algorithm equivalent to Hopcroft¿s.
publishDate 2013
dc.date.none.fl_str_mv 2013
2013-03-14
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/27623
url https://riunet.upv.es/handle/10251/27623
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universitat Politècnica de València
publisher.none.fl_str_mv Universitat Politècnica de València
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869407626775756800
score 15.300719

Registos relacionados