Incomplete operational transition complexity of regular languages
The state complexity of basic operations on regular languages considering complete deterministic finite automata (DFA) has been extensively studied in the literature. But, if incomplete DFAs are considered, transition complexity is also a significant measure. In this paper we study the incomplete (d...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2015
|
| Assuntos: | |
| Texto completo: | https://repositorio-aberto.up.pt/handle/10216/90779 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/90779 |