This document summarizes a proposed algorithm called MIN-MAX for regular expression matching. MIN-MAX uses (MIN, MAX) counters to dynamically track the lower and upper bounds of possible matching counts rather than actual matching counts. This counter-based design can support constraint repetitions using logarithmic memory rather than linear memory used in existing solutions. MIN-MAX can resolve character class ambiguity and support overlapped matching when collisions are absent. Heuristic rules were tested on common rule sets and showed the majority were immune from collisions, allowing cost-effective overlapped matching support. The architecture also enables fast reconfiguration via memory writes instead of full resynthesis.