On regular expression hashing to reduce FA size

DOI10.1142/S0129054109007042MaRDI QIDQ3655538zbMATH OpenFDO

Authors Wikus Coetser, Derrick Kourie, B. W. Watson

Publication date 8 January 2010

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

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

zbMATH Keywords

DFAequivalence classesexact automatonfinite state automatonhash functionminimizationNFAregular languagesstate mergingsuper-automaton

Mathematics Subject Classification ID

Semisimple Lie groups and their representations (22E46) Differential geometry of symmetric spaces (53C35) Noncompact Lie groups of transformations (57S20) Formal languages and automata (68Q45)

Recommendations

• Minimized Thompson NFA
• Implementation and Application of Automata
• Implementation and Application of Automata
• Theory Is Forever
• Obtaining shorter regular expressions from finite-state automata

Cites work

• Derivatives of Regular Expressions
• Discrete mathematics with applications
• scientific article; zbMATH DE number 824931 (Why is no real title available?)

Cited in

(1)

• Analysis of an efficient reduction algorithm for random regular expressions based on universality detection

This page was built for publication: On regular expression hashing to reduce FA size

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