Busque entre los 170597 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-10-25T13:30:35Z | |
dc.date.available | 2012-10-25T13:30:35Z | |
dc.date.issued | 2005-10 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/22932 | |
dc.description.abstract | This paper presents an alternative way to use finite-state automata in order to deal with approximate string matching. By exploring some adaptive features that enable any finitestate automaton model to change configuration during computational steps, dynamically deleting or creating new transitions, we can actually control the behavior and the topology of the automaton. We use these features for an application to approximate string matching trying to reduce the number of states required | en |
dc.language | en | es |
dc.subject | Applications | es |
dc.subject | adaptive devices | en |
dc.subject | approximate string matching | en |
dc.subject | Automata (e.g., finite, push-down, resource-bounded) | es |
dc.title | An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching | en |
dc.type | Objeto de conferencia | es |
sedici.creator.person | Rocha, Ricardo L. | es |
sedici.creator.person | Neto, João José | es |
sedici.description.note | Eje: VI Workshop de Agentes y Sistemas Inteligentes (WASI) | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2005-10 | |
sedici.relation.event | XI Congreso Argentino de Ciencias de la Computación | es |
sedici.description.peerReview | peer-review | es |