Comments on “Incremental Construction and Maintenance of Minimal Finite-State Automata,” by Rafael C. Carrasco and Mikel L. Forcada

DOI10.1162/089120104323093302zbMath1234.68207OpenAlexW2084345521MaRDI QIDQ3225415

Jan Daciuk

Publication date: 20 March 2012

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

Full work available at URL: https://doi.org/10.1162/089120104323093302

zbMATH Keywords

addition of stringsalgorithm for unsorted dataminimal deterministic acyclic automatonminimal deterministic cyclic automatonremoval of strings

Mathematics Subject Classification ID

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

Related Items (3)

Incremental construction of minimal tree automata ⋮ A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata ⋮ Minimisation of automata

Cites Work

• Incremental Construction and Maintenance of Minimal Finite-State Automata
• Incremental Construction of Minimal Acyclic Finite-State Automata

This page was built for publication: Comments on “Incremental Construction and Maintenance of Minimal Finite-State Automata,” by Rafael C. Carrasco and Mikel L. Forcada