Compact and fast algorithms for safe regular expression search

DOI10.1080/00207160310001650025zbMATH Open1093.68595OpenAlexW2074691992MaRDI QIDQ4831427FDOQ4831427

Jean-Marc Champarnaud, Thomas Paranthoën, 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)

Cites Work

• Title not available (Why is that?)
• An efficient null-free procedure for deciding regular language membership
• Characterization of Glushkov automata
• Regular expressions into finite automata

Cited In (9)

• Multi-tilde-bar expressions and their automata
• Compressing Regular Expressions’ DFA Table by Matrix Decomposition
• Title not available (Why is that?)
• NFA reduction algorithms by means of regular inequalities
• New techniques for regular expression searching
• Compact representations of automata for regular expression matching
• Smaller representation of compiled regular expressions
• BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
• Implementation and Application of Automata

   Recommendations

• BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS 👍 👎
• Implementation and Application of Automata 👍 👎
• New techniques for regular expression searching 👍 👎
• Title not available (Why is that?) 👍 👎
• From regular expressions to DFA's using compressed NFA's 👍 👎

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)