On-line construction of a small automaton for a finite set of words

DOI10.1142/S0129054112400138zbMATH Open1283.68192DBLPjournals/ijfcs/CrochemoreGL12OpenAlexW2106606282WikidataQ61677873 ScholiaQ61677873MaRDI QIDQ2909196FDOQ2909196

Authors: Maxime Crochemore, Laura Giambruno, Alessio Langiu 

Publication date: 30 August 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054112400138

Recommendations

• Incremental Construction and Maintenance of Minimal Finite-State Automata
• On-line construction of suffix trees
• Direct construction of minimal acyclic finite states automata
• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• scientific article; zbMATH DE number 3883638

zbMATH Keywords

minimal automatadeterministic automataacyclic automatafinite set of wordson-line constructionsemi-incremental construction

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms on Strings
• Minimisation of acyclic deterministic automata in linear time
• A new algorithm for the construction of minimal acyclic DFAs.

Cited In (4)

• Title not available (Why is that?)
• Parsing with a finite dictionary
• Comments on ``Incremental construction and maintenance of minimal finite-state automata
• Title not available (Why is that?)

This page was built for publication: On-line construction of a small automaton for a finite set of words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909196)