The question DETERMINISTIC FINITE STATE MACHINE (10k link) had the content of:
DESIGNING A SIMPLE DETERMINISTIC FINITE STATE MACHINE TO RECOGNISE A VALID DUT PASSWORD NUMBER. IT ,MUST FIRST INCLUDE LOWERCASE LETTER,NUMBER AND SUBSEQUENT SYMBOLS @!%$&
What was the quality score for this? How did it get through the quality filter? And does someone need to change the settings on the threshold for the quality filter for P.SE? or add more rules to the quality filter (e.g. '80% non symbol characters in the character set
[A-Z] should get automatically rejected)?
This is tagged as both bug and feature request - its either bug that it got through or a feature request to improve it if this was working as designed.