Mostrar el registro completo del ítem
Vázquez-De-Parga Andrade, M.; García Gómez, P.; López Rodríguez, D. (2016). A sufficient condition to polynomially compute a minimum separating DFA. Information Sciences. 370-371:204-220. doi:10.1016/j.ins.2016.07.053
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/82093
Título: | A sufficient condition to polynomially compute a minimum separating DFA | |
Autor: | García Gómez, Pedro | |
Entidad UPV: |
|
|
Fecha difusión: |
|
|
Resumen: |
The computation of a minimal separating automaton (MSA) for regular languages has been
studied from many different points of view, from synthesis of automata or Grammatical Inference
to the minimization of incompletely ...[+]
|
|
Palabras clave: |
|
|
Derechos de uso: | Reserva de todos los derechos | |
Fuente: |
|
|
DOI: |
|
|
Editorial: |
|
|
Versión del editor: | http://dx.doi.org/10.1016/j.ins.2016.07.053 | |
Descripción: |
|
|
Tipo: |
|