On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
Extended regular expressions (with complement and intersection) are used in many applications due to their succinctness. In particular, regular expressions extended with intersection only (also called semi-extended) can already be exponentially smaller than standard regular expressions or equivalent...
| Autor principal: | |
|---|---|
| Outros Autores: | , , , |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2016
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/90771 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/90771 |