QA · Recursively enumerable
Perfect copy: w#w
Accepts w#w — an exact repetition. No PDA can do this (stacks reverse), but FIFO order makes it natural: the queue front always holds the next symbol the copy must produce.
The author’s examples, run
ab#ab → acceptabb#abb → accept# → acceptab#ba → rejectab#a → reject