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

DOI10.1142/S0129054112400138MaRDI QIDQ2909196zbMATH OpenOpenAlexDBLPWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A new algorithm for the construction of minimal acyclic DFAs.
• Algorithms on Strings
• Minimisation of acyclic deterministic automata in linear time

Cited in

(4)

• scientific article; zbMATH DE number 3883638 (Why is no real title available?)
• Comments on ``Incremental construction and maintenance of minimal finite-state automata
• scientific article; zbMATH DE number 2050933 (Why is no real title available?)
• Parsing with a finite dictionary

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)