An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching
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,...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/22932 |
| Aporte de: |
| id |
I19-R120-10915-22932 |
|---|---|
| record_format |
dspace |
| institution |
Universidad Nacional de La Plata |
| institution_str |
I-19 |
| repository_str |
R-120 |
| collection |
SEDICI (UNLP) |
| language |
Inglés |
| topic |
Ciencias Informáticas Applications Automata (e.g., finite, push-down, resource-bounded) adaptive devices approximate string matching |
| spellingShingle |
Ciencias Informáticas Applications Automata (e.g., finite, push-down, resource-bounded) adaptive devices approximate string matching Rocha, Ricardo L. Neto, João José An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching |
| topic_facet |
Ciencias Informáticas Applications Automata (e.g., finite, push-down, resource-bounded) adaptive devices approximate string matching |
| description |
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 |
| format |
Objeto de conferencia Objeto de conferencia |
| author |
Rocha, Ricardo L. Neto, João José |
| author_facet |
Rocha, Ricardo L. Neto, João José |
| author_sort |
Rocha, Ricardo L. |
| title |
An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching |
| title_short |
An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching |
| title_full |
An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching |
| title_fullStr |
An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching |
| title_full_unstemmed |
An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching |
| title_sort |
adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching |
| publishDate |
2005 |
| url |
http://sedici.unlp.edu.ar/handle/10915/22932 |
| work_keys_str_mv |
AT rocharicardol anadaptivefinitestateautomataapplicationtotheproblemofreducingthenumberofstatesinapproximatestringmatching AT netojoaojose anadaptivefinitestateautomataapplicationtotheproblemofreducingthenumberofstatesinapproximatestringmatching AT rocharicardol adaptivefinitestateautomataapplicationtotheproblemofreducingthenumberofstatesinapproximatestringmatching AT netojoaojose adaptivefinitestateautomataapplicationtotheproblemofreducingthenumberofstatesinapproximatestringmatching |
| bdutipo_str |
Repositorios |
| _version_ |
1764820467917520900 |