Incremental Construction and Maintenance of Minimal Finite-State Automata

DOI10.1162/089120102760173652zbMath1232.68080OpenAlexW2123135686MaRDI QIDQ4406659

Rafael C. Carrasco, Mikel L. Forcada

Publication date: 26 June 2003

Published in: Computational Linguistics (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.2750

zbMATH Keywords

deterministicstringsfinite-state automataminimalacycliccyclicdictionariesdictionary constructiondictionary maintenanceincremental addition of stringsincremental removal of strings

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Linguistics (91F20)

Related Items (10)

Incremental construction of minimal tree automata ⋮ Incremental construction of minimal deterministic finite cover automata ⋮ Building efficient and compact data structures for simplicial complexes ⋮ A DUAL COORDINATE DESCENT ALGORITHM FOR SVMs COMBINED WITH RATIONAL KERNELS ⋮ Comments on “Incremental Construction and Maintenance of Minimal Finite-State Automata,” by Rafael C. Carrasco and Mikel L. Forcada ⋮ Description and analysis of a bottom-up DFA minimization algorithm ⋮ From tree automata to string automata minimization ⋮ Large-Scale Training of SVMs with Automata Kernels ⋮ A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata ⋮ Minimisation of automata

Cites Work

• Incremental Construction of Minimal Acyclic Finite-State Automata

This page was built for publication: Incremental Construction and Maintenance of Minimal Finite-State Automata