...
The resolver has one lookup table with an entry for each known prefix. That lookup table specifies one of 2 behaviors for that prefix, which in our case we anticipate to We anticipate that a prefix will normally correspond to a collection (, but it could be used for distinct services redirecting to the same collection – the resolver wouldn't care).
That lookup table specifies one of a finite set of behaviors for that prefix.
Strict behavior
The resolver would have a 2nd lookup table specific to that prefix (never mind for now how this would be efficiently implemented). If an entry matching the entire identifier part as an indivisible string is found, the resolver redirects to that entry. Otherwise the resolver returns an error. Any of the 6 distinct URI forms above would fail unless the resolver had been provided a redirection location uniquely matching the incoming URI (Note that the redirection locations need not be unique).
...