I'm working on a project where I get to use XPath, .NET regular expressions, and SQL LIKE patterns. Lots of fun

I'm wondering what the shortest possible patterns are in each of these pattern-matching languages that either a) match every expression or b) fail to match every expression.
I've got the "match everything" expressions down for two of them, I think:
// (regex, match everything)
If the null pattern is disallowed (suppose this is javascript) then I'm not sure... /.*/ works, and perhaps /^/ is worth considering.
'%' (LIKE, match everything)
The "match nothing" cases are harder. I've come up with some to beat:
/a\bc/ (regex, match nothing)
'[]' (LIKE, match nothing)