Theorem 1.1

Theorem 1.1 (Real-time transfer). Let $L$ be recognized by a finite deterministic strict real-time multitape Turing machine with a fixed positive number of ordinary single-head work tapes. The machine receives one input symbol and makes one global transition per step, has no input-length advice, and performs no post-input computation. Then $$L^R\in\mathsf{PEG}.$$