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...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2013 |
| País: | España |
| Institución: | 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 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/27623 |
| Access Level: | acceso abierto |
| Palabra clave: | DFA minimization Brzozowski algorithm Hopcroft algorithm LENGUAJES Y SISTEMAS INFORMATICOS |
| Sumario: | 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. |
|---|