DFA minimization: from Brzozowski to Hopcroft

Buscar en RiuNet

Nombre: partial rev determ.pdf

Tamaño: 176.5Kb

Formato: PDF

Descripción: Technical report

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	2013-03-14T12:08:54Z
dc.date.available	2013-03-14T12:08:54Z
dc.date.issued	2013-03-14
dc.identifier.uri	http://hdl.handle.net/10251/27623
dc.description.abstract	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.	es_ES
dc.language	Inglés	es_ES
dc.publisher	Universitat Politècnica de València	es_ES
dc.rights	Reserva de todos los derechos	es_ES
dc.subject	DFA minimization	es_ES
dc.subject	Brzozowski algorithm
dc.subject	Hopcroft algorithm
dc.subject.classification	LENGUAJES Y SISTEMAS INFORMATICOS	es_ES
dc.title	DFA minimization: from Brzozowski to Hopcroft	es_ES
dc.type	Informe	es_ES
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. (2013). DFA minimization: from Brzozowski to Hopcroft. http://hdl.handle.net/10251/27623	es_ES

Informes técnicos de investigación DSIC-TLCC [1]
TLCC: Extensiones de la Programación Lógica (Extensions of Logic Programming)