theorem

Theorem 2.3

Loff–Moreira–Reis [12, Theorem 16, p. 21]

Theorem 2.3 (Loff–Moreira–Reis [12, Theorem 16, p. 21]). A language LL is in PEG\mathsf{PEG} if and only if LRL^R is decided by some scaffolding automaton.