Compact and fast algorithms for safe regular expression search

DOI10.1080/00207160310001650025MaRDI QIDQ4831427zbMATH OpenOpenAlexFDO

Authors Thomas Paranthoën, Jean-Marc Champarnaud, Fabien Coulon

Publication date 29 December 2004

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Bitwise TechniquesHomogeneous NFAsNFA DeterminizationRegular Expression Search

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
• Implementation and Application of Automata
• New techniques for regular expression searching
• scientific article; zbMATH DE number 1848391
• From regular expressions to DFA's using compressed NFA's

Cites work

• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• An efficient null-free procedure for deciding regular language membership
• Characterization of Glushkov automata
• Regular expressions into finite automata

Cited in

(9)

• NFA reduction algorithms by means of regular inequalities
• BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
• New techniques for regular expression searching
• Compact representations of automata for regular expression matching
• Compressing regular expressions' DFA table by matrix decomposition
• Smaller representation of compiled regular expressions
• scientific article; zbMATH DE number 798342 (Why is no real title available?)
• Multi-tilde-bar expressions and their automata
• Implementation and Application of Automata

This page was built for publication: Compact and fast algorithms for safe regular expression search

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