Compact and fast algorithms for safe regular expression search

DOI10.1080/00207160310001650025zbMath1093.68595OpenAlexW2074691992MaRDI QIDQ4831427

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)

Related Items (6)

Smaller representation of compiled regular expressions ⋮ NFA reduction algorithms by means of regular inequalities ⋮ Multi-tilde-bar expressions and their automata ⋮ Compressing Regular Expressions’ DFA Table by Matrix Decomposition ⋮ Compact representations of automata for regular expression matching ⋮ BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS

Cites Work

• Regular expressions into finite automata
• An efficient null-free procedure for deciding regular language membership
• Characterization of Glushkov automata
• Unnamed Item

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