State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To overcome this, simple heuristic methods have been...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2010
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/90548 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/90548 |