theorem

Theorem 2.1

Loff–Moreira–Reis

Theorem 2.1 (Loff–Moreira–Reis). For every language KK, K∈PEG⟺KR is decided by a scaffolding automaton.K\in\mathsf{PEG} \quad\Longleftrightarrow\quad K^R\text{ is decided by a scaffolding automaton}.