An Adaptive Finite-State Automata Application to the problem of Reducing the Number of States in Approximate String Matching
Ricardo Luis de Azevedo da Rocha, João José Neto · El Servicio de Difusión de la Creación Intelectual (National University of La Plata) · 2005
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