A note on mc-DFA and its minimization

DOI10.1080/02522667.2003.10699580MaRDI QIDQ4469160zbMATH OpenOpenAlexFDO

Authors

Publication date 14 June 2004

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.2003.10699580

zbMATH Keywords

multiclassified-final-state Deterministic Finite Automatastate minimization

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45)

Recommendations

• The complete-tree-like matching mc-DFA and their implementation
• Fast brief practical DFA minimization
• Incremental DFA minimisation
• Incremental DFA minimisation
• An efficient linear pseudo-minimization algorithm for Aho-Corasick automata

Cites work

• An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
• Automata-driven efficient subterm unification
• Efficient string matching
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 108390 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• K-M-P string matching revisited

Cited in

(2)

• ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS
• The complete-tree-like matching mc-DFA and their implementation

This page was built for publication: A note on mc-DFA and its minimization

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