News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Document

An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching

Rocha, Ricardo L. et al · SEDICI UNLP · 2005

Open-access full text
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Rocha, Ricardo L. et al
Publisher
SEDICI UNLP
Year
2005
Language
English

Resource access

Open the content from the main option or choose another available source.

SEDICI UNLP SEDICI UNLP OAI-PMH
Entrar por SEDICI UNLP
Main access

Open-access full text

Texto completo identificado como acceso abierto.
Open text

Summary

Descripción general del contenido del recurso.

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 Eje: VI Workshop de Agentes y Sistemas Inteligentes (WASI) Red de Universidades con Carreras en Informática (RedUNCI)

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Rocha, R. L. E. A. (2005). An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/22932

MLA

Rocha, Ricardo L. et al. An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching. SEDICI UNLP, 2005. http://sedici.unlp.edu.ar/handle/10915/22932.

Chicago

Rocha, Ricardo L. et al. 2005. An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/22932.

Harvard

Rocha, R. L. E. A. 2005, An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/22932 [Accessed 9 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching
Author / contributors
Rocha, Ricardo L. et al
Publisher
SEDICI UNLP
Publication year
2005
Language
English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; Applications; Automata (e.g. finite push-down resource-bounded); adaptive devices; approximate string matching
Copied