A note on mc-DFA and its minimization

DOI10.1080/02522667.2003.10699580zbMath1100.68581OpenAlexW2065445384MaRDI QIDQ4469160

No author found.

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

state minimizationmulticlassified-final-state Deterministic Finite Automata

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• K-M-P string matching revisited
• An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
• Efficient string matching
• Fast Pattern Matching in Strings
• Automata-driven efficient subterm unification

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