Consider the following strings in $L_{\text{s}\text{t}\text{r}\text{i}\text{n}\text{g}}($for variable symbols $x,y,$ a unary predicate symbol $P$ and

a binary predicate symbol $Q)$:

AAxAAyQxy$=>PxPy,$;$,$not$=>$AAxPx$=>$PynotQxy