Incremental Construction of Minimal Acyclic Finite-State Automata
From MaRDI portal
Publication:4406664
DOI10.1162/089120100561601zbMath1232.68081OpenAlexW2154478838WikidataQ56067413 ScholiaQ56067413MaRDI QIDQ4406664
No author found.
Publication date: 26 June 2003
Published in: Computational Linguistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/089120100561601
Related Items (23)
Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations ⋮ Incremental construction of minimal tree automata ⋮ Incremental construction of minimal deterministic finite cover automata ⋮ Building efficient and compact data structures for simplicial complexes ⋮ On building minimal automaton for subset matching queries ⋮ Regular expressions for decoding of neural network outputs ⋮ 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 ⋮ Fast Approximate Search in Large Dictionaries ⋮ Optimal insertion in deterministic DAWGs ⋮ Hopcroft’s Algorithm and Cyclic Automata ⋮ A Hybrid Approach to Word Segmentation of Vietnamese Texts ⋮ Cycle-aware minimization of acyclic deterministic finite-state automata ⋮ Exact enumeration of acyclic deterministic automata ⋮ Incremental Construction and Maintenance of Minimal Finite-State Automata ⋮ How to squeeze a lexicon ⋮ fsm2 – A Scripting Language for Creating Weighted Finite-State Morphologies ⋮ From tree automata to string automata minimization ⋮ Extending greedy feature selection algorithms to multiple solutions ⋮ Large-Scale Training of SVMs with Automata Kernels ⋮ Chain reduction for binary and zero-suppressed decision diagrams ⋮ A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata ⋮ Minimisation of automata
This page was built for publication: Incremental Construction of Minimal Acyclic Finite-State Automata
