Small nfas from regular expressions: Some experimental results
Regular expressions (RES), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recognition depend on the size of the equivalent nondeterministic finite automata (NFA). We present the implementation of sever...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2010
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/96756 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/96756 |